The large diffusion of shared-memory multi-core machines has impacted the way Parallel Discrete Event Simulation (PDES) engines are built. While they were originally conceived as data-partitioned platforms, where each thread is in charge of managing a subset of simulation objects, nowadays the trend is to shift towards share-everything settings. In this scenario, any thread can (in principle) take care of CPU-dispatching pending events bound to whichever simulation object, which helps to fully share the load across the available CPU-cores. Hence, a fundamental aspect to be tackled is to provide an efficient globally-shared pending events’ set from which multiple worker threads can concurrently extract events to be processed, and into which they can concurrently insert new produced events to be processed in the future. To cope with this aspect, we present the design and implementation of a concurrent non-blocking pending events’ set data structure, which can be seen as a variant of a classical calendar queue. Early experimental data collected with a synthetic stress test are reported, showing excellent scalability of our proposal on a machine equipped with 32 CPU-cores.

Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F. (2016). A non-blocking priority queue for the pending event set. In Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques, SIMUTools 2016 (pp.46-55). European Alliance for Innovation [10.5555/3021426.3021434].

A non-blocking priority queue for the pending event set

Marotta, R;Ianni, M;Pellegrini, A;Quaglia, F
2016-08-01

Abstract

The large diffusion of shared-memory multi-core machines has impacted the way Parallel Discrete Event Simulation (PDES) engines are built. While they were originally conceived as data-partitioned platforms, where each thread is in charge of managing a subset of simulation objects, nowadays the trend is to shift towards share-everything settings. In this scenario, any thread can (in principle) take care of CPU-dispatching pending events bound to whichever simulation object, which helps to fully share the load across the available CPU-cores. Hence, a fundamental aspect to be tackled is to provide an efficient globally-shared pending events’ set from which multiple worker threads can concurrently extract events to be processed, and into which they can concurrently insert new produced events to be processed in the future. To cope with this aspect, we present the design and implementation of a concurrent non-blocking pending events’ set data structure, which can be seen as a variant of a classical calendar queue. Early experimental data collected with a synthetic stress test are reported, showing excellent scalability of our proposal on a machine equipped with 32 CPU-cores.
9th EAI International Conference on Simulation Tools and Techniques
cze
2016
Rilevanza internazionale
ago-2016
Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI
English
Intervento a convegno
Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F. (2016). A non-blocking priority queue for the pending event set. In Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques, SIMUTools 2016 (pp.46-55). European Alliance for Innovation [10.5555/3021426.3021434].
Marotta, R; Ianni, M; Pellegrini, A; Quaglia, F
File in questo prodotto:
File Dimensione Formato  
Mar16b.pdf

solo utenti autorizzati

Tipologia: Documento in Pre-print
Licenza: Copyright dell'editore
Dimensione 675.68 kB
Formato Adobe PDF
675.68 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/323505
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? ND
social impact