Cargando…
Adaptive track scheduling to optimize concurrency and vectorization in GeantV
The GeantV project is focused on the R&D; of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of trac...
Autores principales: | , , , , , , , , , , , , , , , |
---|---|
Lenguaje: | eng |
Publicado: |
2015
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1088/1742-6596/608/1/012003 http://cds.cern.ch/record/2159059 |
_version_ | 1780950825256878080 |
---|---|
author | Apostolakis, J Bandieramonte, M Bitzes, G Brun, R Canal, P Carminati, F Licht, J C De Fine Duhem, L Elvira, V D Gheata, A Jun, S Y Lima, G Novak, M Sehgal, R Shadura, O Wenzel, S |
author_facet | Apostolakis, J Bandieramonte, M Bitzes, G Brun, R Canal, P Carminati, F Licht, J C De Fine Duhem, L Elvira, V D Gheata, A Jun, S Y Lima, G Novak, M Sehgal, R Shadura, O Wenzel, S |
author_sort | Apostolakis, J |
collection | CERN |
description | The GeantV project is focused on the R&D; of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. This work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results. |
id | oai-inspirehep.net-1372955 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2015 |
record_format | invenio |
spelling | oai-inspirehep.net-13729552019-09-30T06:29:59Zdoi:10.1088/1742-6596/608/1/012003http://cds.cern.ch/record/2159059engApostolakis, JBandieramonte, MBitzes, GBrun, RCanal, PCarminati, FLicht, J C De FineDuhem, LElvira, V DGheata, AJun, S YLima, GNovak, MSehgal, RShadura, OWenzel, SAdaptive track scheduling to optimize concurrency and vectorization in GeantVComputing and ComputersParticle Physics - ExperimentThe GeantV project is focused on the R&D; of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. This work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results.oai:inspirehep.net:13729552015 |
spellingShingle | Computing and Computers Particle Physics - Experiment Apostolakis, J Bandieramonte, M Bitzes, G Brun, R Canal, P Carminati, F Licht, J C De Fine Duhem, L Elvira, V D Gheata, A Jun, S Y Lima, G Novak, M Sehgal, R Shadura, O Wenzel, S Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title | Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title_full | Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title_fullStr | Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title_full_unstemmed | Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title_short | Adaptive track scheduling to optimize concurrency and vectorization in GeantV |
title_sort | adaptive track scheduling to optimize concurrency and vectorization in geantv |
topic | Computing and Computers Particle Physics - Experiment |
url | https://dx.doi.org/10.1088/1742-6596/608/1/012003 http://cds.cern.ch/record/2159059 |
work_keys_str_mv | AT apostolakisj adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT bandieramontem adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT bitzesg adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT brunr adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT canalp adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT carminatif adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT lichtjcdefine adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT duheml adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT elviravd adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT gheataa adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT junsy adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT limag adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT novakm adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT sehgalr adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT shadurao adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv AT wenzels adaptivetrackschedulingtooptimizeconcurrencyandvectorizationingeantv |