Geant4 Geometry Speed-ups

Slides:



Advertisements
Similar presentations
Geant4 v9.2p02 Speed up Makoto Asai (SLAC) Geant4 Tutorial Course.
Advertisements

Specialized Geant4 navigation for GATE Jan De Beenhouwer Steven Staelens.
Localization of Piled Boxes by Means of the Hough Transform Dimitrios Katsoulas Institute for Pattern Recognition and Image Processing University of Freiburg.
Review CPSC 321 Andreas Klappenecker Announcements Tuesday, November 30, midterm exam.
Nested Parameterization
Game Mathematics & Game State The Complexity of Games Expectations of Players Efficiency Game Mathematics o Collision Detection & Response o Object Overlap.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Geometry 5 I.Hrivnacova¹, J.Apostolakis² ¹IPN, Orsay; ²CERN Cours Paris June 2007.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Detector Description – advanced features The full set of lecture notes of this Geant4 Course is available at
COMPUTER AIDED DESIGN -(CAD)-3
G EANT highlights kernel modules Gabriele Cosmo, CERN PH-SFT for the Geant4 Collaboration Gabriele Cosmo, CERN PH-SFT for the Geant4 Collaboration.
Geometry Detector geometry A detector geometry in Geant4 is made of a number of volumes. The largest volume is called the World volume. It must contain.
Geometry and Field: New features and Developments T. Nikitina For Geometry Working Group Geant4 workshop, Hebden Bridge september 2007 G4Paraboloid.
Planned Geant4 developments for LLR Marc Verderi Laboratoire Leprince-Ringuet, École polytechnique Annecy ATF-2 meeting October 2006.
Use of Coverity & Valgrind in Geant4 Gabriele Cosmo.
Motion Planning in Games Mark Overmars Utrecht University.
Alex Howard, CERN – Performance Improvement – Hebden Bridge 14 th September Recommendations for improving application performance (… but not presentation.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Geometry 4 I.Hrivnacova IPN, Orsay Most slides thanks to M. Asai, SLAC Cours Paris June 2007.
3D Viewers Two main uses: –Detector/event exploration – interactivity priority (15fps min). –Generate presentation material (still/movie renders) – quality.
Jump to first page The new ROOT geometry package Andrei Gheata - ALICE Institute of Space Sciences, Bucharest.
The CMS Simulation Software Julia Yarba, Fermilab on behalf of CMS Collaboration 22 m long, 15 m in diameter Over a million geometrical volumes Many complex.
VMC workshop1 Ideas for G4 navigation interface using ROOT geometry A.Gheata ALICE offline week, 30 May 05.
Geant4 Simulation of the Beam Line for the HARP Experiment M.Gostkin, A.Jemtchougov, E.Rogalev (JINR, Dubna)
STATUS OF THE UNIFIED SOLIDS LIBRARY Gabriele Cosmo/CERN Tatiana Nikitina/CERN.
CS 147 Virtual Memory Prof. Sin Min Lee Anthony Palladino.
Outline  Developments/fixes in the last year  Introduced in release 9.6 and patches  Planned for release 10.0 and ongoing …  Currently under development.
Geant4 CPU performance : an update Geant4 Technical Forum, CERN, 07 November 2007 J.Apostolakis, G.Cooperman, G.Cosmo, V.Ivanchenko, I.Mclaren, T.Nikitina,
Status of BDSIM Simulation L. Nevay, S. Boogert, H. Garcia-Morales, S. Gibson, R. Kwee-Hinzmann, J. Snuverink Royal Holloway, University of London 17 th.
Pedro Arce G4WS’10 October 6th, Voxelised geometries intersected with a volume Pedro Arce CIEMAT, Madrid 2010 Geant4 Workshop ESA, 4-8 October 2010.
1 Giuseppe G. Daquino 26 th January 2005 SoFTware Development for Experiments Group Physics Department, CERN Background radiation studies using Geant4.
Geometry 3 I.Hrivnacova IPN, Orsay Most slides thanks to M. Asai, SLAC Cours Paris June 2007.
Outline  Developments/fixes in the last year  Introduced in release 10.1 and patches (also to 10.0)  Planned for release 10.2 and ongoing …  Currently.
FNAL Software School: Lecture 2 Hit Finding Performance Matt Herndon, University of Wisconsin – Madison.
CMSC 611: Advanced Computer Architecture Memory & Virtual Memory Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material.
EDGE DETECTION USING EVOLUTIONARY ALGORITHMS. INTRODUCTION What is edge detection? Edge detection refers to the process of identifying and locating sharp.
Code improvement: Coverity static analysis Valgrind dynamic analysis GABRIELE COSMO CERN, EP/SFT.
Update on USolids/VecGeom integration in Geant4 Gabriele Cosmo, CERN EP/SFT.
Geometry & Persistency Recent & ongoing developments
CS161 – Design and Architecture of Computer
Code Optimization.
Virtual memory.
Memory Management.
Chapter 2 Memory and process management
CHAPTER 2 - EXPLICIT TRANSIENT DYNAMIC ANALYSYS
CS161 – Design and Architecture of Computer
Status of geometrical modeler
Chapter 8 – Software Testing
SOLID MODELLING.
Software Design Team KANG Group 1.
CPU Benchmarks Parallel Session Summary
Simulation Project Structure and tasks
Detector Description – advanced features
Markus Frank CERN/LHCb CHEP2013, Amsterdam, October 14th–18th 2013
Ideas for G4 navigation interface using ROOT geometry
Database Performance Tuning and Query Optimization
(CMS GEANT4 simulation)
Vehicle Segmentation and Tracking in the Presence of Occlusions
Detector Description – advanced features
Geometry checking tools
Sculpting 3D Models Dorsey & McMillan
A shortcut to the tracking
Automatic Test Pattern Generation
3-D Modeling Concepts Part 2.
Chapter 11 Database Performance Tuning and Query Optimization
GEANT4: Patch-02 to Release 8.1 (released on November 10th, 2006)
Marc Verderi GEANT4 collaboration meeting 01/10/2002
COMP755 Advanced Operating Systems
Presentation transcript:

Geant4 Geometry Speed-ups G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Geant4 Geometry Speed-ups Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF

Geometry optimisation G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Geometry optimisation ‘Smart voxels’ technique to optimise search for intersections Adopted and ‘tuned’ since the early years of the Geant4 project (1995) Do not require large memory or computing resources At tracking time, searching is done in a hierarchy of virtual divisions No need to tune geometry according to different topology Possibility to manual tune voxels resolution for specific setups - SetSmartless(n) Can handle at the best also ‘flat’ geometries 3D voxelisation can be applied also to parameterised volumes Improves efficiency in complex geometry setups where more than one parameterisation in different axes is applied - kUndefined in G4PVParameterised constructor Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF

Use of verbosity Print the statistics of voxelisation Using /run/verbose 2 Allows to identify volumes which are more consuming Geant4 Geometry - Speed-ups

Prefer structured geometry setups to flat geometries Avoid defining volumes with too many daughters Will help in the generation of a proper optimisation, avoiding to manually tune it afterwards Will allow navigation to happen more efficiently Geant4 Geometry - Speed-ups

G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Selection of Solids If CPU performance is a constraint Avoid choice of solids which may require high CPU cost Complex compositions of G4Polycone , G4Polyhedra Solids with complex surfaces: twisted solids, G4Torus Adopt simple basic shapes if at all possible Avoid an excessive use of Boolean solids Automatic geometry translations Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF

G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Dynamic geometries Geant4 can handle geometries which varies in time Multiple geometry setups in memory with immediate switching between runs Modification of just a portion of the ‘active’ geometry setup Adopts optimisation technique to consider ‘partial’ regeneration of voxels Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF

Use of Detector Regions G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Use of Detector Regions A region represents a set of geometry volumes, typically of a sub-system Has a cut in range associated. A different range cut for each particle is allowed in a region Region B Default Region B Region A C Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF

Tuning of geometrical tolerance G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Tuning of geometrical tolerance An absolute small value (10E-9 mm) of accuracy may be redundant and inefficient for use on simulation of detectors of big size or macroscopic dimensions Geant4 Geometry - Speed-ups Available since Geant4 9.0 Geant4 Workshop 2003 - TRIUMF

Avoid overlaps of volumes G.Cosmo, Recent Developments in the Geometry & Future Plans 3 September 2003 Avoid overlaps of volumes “Overlaps” in the geometry can be detected at volume positioning stage Boolean flag to be activated in the physical-volume constructor Valid for placements and parameterised volumes With explicit call to CheckOverlaps() through the pointer of the physical-volume A correctly defined geometry helps in preventing problems of looping particles or particles stuck on boundaries Geant4 Geometry - Speed-ups Geant4 Workshop 2003 - TRIUMF