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

A Lock-Free O(1) Event Pool and its Application to Share-Everything PDES Platforms. Marotta, R., Ianni, M., Pellegrini, A., & Quaglia, F. In Proceedings of the 20th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, of DS-RT, September, 2016. IEEE Computer Society. Winner of the Best Paper Award
doi abstract bibtex

The large diffusion of highly-parallel shared-memory 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 share-everything PDES paradigm.

@InProceedings{Mar16c,
  author    = {Marotta, Romolo and Ianni, Mauro and Pellegrini, Alessandro and Quaglia, Francesco},
  booktitle = {Proceedings of the 20th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications},
  title     = {A Lock-Free O(1) Event Pool and its Application to Share-Everything PDES Platforms},
  year      = {2016},
  month     = sep,
  note      = {Winner of the Best Paper Award},
  publisher = {IEEE Computer Society},
  series    = {DS-RT},
  abstract  = {The large diffusion of highly-parallel shared-memory 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 share-everything PDES paradigm.},
  doi       = {10.1109/DS-RT.2016.33},
  location  = {London, UK},
}

Downloads: 0

{"_id":"hRL329A5FZzshb7nR","bibbaseid":"marotta-ianni-pellegrini-quaglia-alockfreeo1eventpoolanditsapplicationtoshareeverythingpdesplatforms-2016","authorIDs":[],"author_short":["Marotta, R.","Ianni, M.","Pellegrini, A.","Quaglia, F."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Marotta"],"firstnames":["Romolo"],"suffixes":[]},{"propositions":[],"lastnames":["Ianni"],"firstnames":["Mauro"],"suffixes":[]},{"propositions":[],"lastnames":["Pellegrini"],"firstnames":["Alessandro"],"suffixes":[]},{"propositions":[],"lastnames":["Quaglia"],"firstnames":["Francesco"],"suffixes":[]}],"booktitle":"Proceedings of the 20th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","title":"A Lock-Free O(1) Event Pool and its Application to Share-Everything PDES Platforms","year":"2016","month":"September","note":"Winner of the Best Paper Award","publisher":"IEEE Computer Society","series":"DS-RT","abstract":"The large diffusion of highly-parallel shared-memory 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 share-everything PDES paradigm.","doi":"10.1109/DS-RT.2016.33","location":"London, UK","bibtex":"@InProceedings{Mar16c,\n author = {Marotta, Romolo and Ianni, Mauro and Pellegrini, Alessandro and Quaglia, Francesco},\n booktitle = {Proceedings of the 20th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications},\n title = {A Lock-Free O(1) Event Pool and its Application to Share-Everything PDES Platforms},\n year = {2016},\n month = sep,\n note = {Winner of the Best Paper Award},\n publisher = {IEEE Computer Society},\n series = {DS-RT},\n abstract = {The large diffusion of highly-parallel shared-memory 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 share-everything PDES paradigm.},\n doi = {10.1109/DS-RT.2016.33},\n location = {London, UK},\n}\n\n","author_short":["Marotta, R.","Ianni, M.","Pellegrini, A.","Quaglia, F."],"key":"Mar16c","id":"Mar16c","bibbaseid":"marotta-ianni-pellegrini-quaglia-alockfreeo1eventpoolanditsapplicationtoshareeverythingpdesplatforms-2016","role":"author","urls":{},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/alessandropellegrini/alessandropellegrini.github.io/master/pubs.bib","creationDate":"2021-02-05T20:44:08.013Z","downloads":0,"keywords":[],"search_terms":["lock","free","event","pool","application","share","everything","pdes","platforms","marotta","ianni","pellegrini","quaglia"],"title":"A Lock-Free O(1) Event Pool and its Application to Share-Everything PDES Platforms","year":2016,"dataSources":["PcuRWp2nBdXHxwj7e"]}