The large diffusion of highly-parallel sharedmemory multi-core machines has led Parallel Discrete Event Simulation (PDES) platforms to a shift towards a share-everything model. This model is based on loose coupling between simulation objects and threads, lasting (as an extreme) no more than the lifetime of individual events. Concurrent threads can therefore CPU-dispatch events destined to any object at any point in time, thus fully sharing the workload of events to be processed on a fine grain basis. This demands for efficient mechanisms to share the overall pool of pending events by enabling parallelism in insertion and extraction operations. In this article we present a lock-free event pool which also provides amortized O(1) time complexity for both insertions and extractions. It can sustain highly concurrent accesses, while not leading to noticeable performance degradation when scaling up the thread count. Experimental results demonstrate that our solution stands as a core facility capable of further raising up the pragmatical impact of such an emerging shareeverything PDES paradigm.

Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F. (2016). A Lock-Free O(1) Event Pool and Its Application to Share-Everything PDES Platforms. ??????? it.cilea.surplus.oa.citation.tipologie.CitationProceedings.prensentedAt ??????? IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications [10.1109/DS-RT.2016.33].

A Lock-Free O(1) Event Pool and Its Application to Share-Everything PDES Platforms

Alessandro Pellegrini;Francesco Quaglia
2016-09-01

Abstract

The large diffusion of highly-parallel sharedmemory multi-core machines has led Parallel Discrete Event Simulation (PDES) platforms to a shift towards a share-everything model. This model is based on loose coupling between simulation objects and threads, lasting (as an extreme) no more than the lifetime of individual events. Concurrent threads can therefore CPU-dispatch events destined to any object at any point in time, thus fully sharing the workload of events to be processed on a fine grain basis. This demands for efficient mechanisms to share the overall pool of pending events by enabling parallelism in insertion and extraction operations. In this article we present a lock-free event pool which also provides amortized O(1) time complexity for both insertions and extractions. It can sustain highly concurrent accesses, while not leading to noticeable performance degradation when scaling up the thread count. Experimental results demonstrate that our solution stands as a core facility capable of further raising up the pragmatical impact of such an emerging shareeverything PDES paradigm.
IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications
Rilevanza internazionale
set-2016
Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI
English
Intervento a convegno
Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F. (2016). A Lock-Free O(1) Event Pool and Its Application to Share-Everything PDES Platforms. ??????? it.cilea.surplus.oa.citation.tipologie.CitationProceedings.prensentedAt ??????? IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications [10.1109/DS-RT.2016.33].
Marotta, R; Ianni, M; Pellegrini, A; Quaglia, F
File in questo prodotto:
File Dimensione Formato  
Mar16c.pdf

solo utenti autorizzati

Tipologia: Documento in Post-print
Licenza: Copyright dell'editore
Dimensione 179.04 kB
Formato Adobe PDF
179.04 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/238660
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 8
social impact