{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:39:34Z","timestamp":1742935174377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432637"},{"type":"electronic","value":"9783031432644"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43264-4_38","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:03:02Z","timestamp":1694041382000},"page":"500-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards the\u00a0Optimization of\u00a0Speculative PDES Platforms in\u00a0Shared-Memory Multi-core Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9875-6601","authenticated-orcid":false,"given":"Federica","family":"Montesano","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Andelfinger, P., K\u00f6ster, T., Uhrmacher, A.: Zero lookahead? Zero problem. The window racer algorithm. In: Proceedings of the 2023 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2023, pp. 1\u201311. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3573900.3591115","key":"38_CR1","DOI":"10.1145\/3573900.3591115"},{"doi-asserted-by":"publisher","unstructured":"Carn\u00e0, S., Ferracci, S., Santis, E.D., Pellegrini, A., Quaglia, F.: Hardware-assisted incremental checkpointing in speculative parallel discrete event simulation. In: 2019 Winter Simulation Conference, WSC 2019, National Harbor, MD, USA, 8\u201311 December 2019, pp. 2759\u20132770. IEEE (2019). https:\/\/doi.org\/10.1109\/WSC40007.2019.9004901","key":"38_CR2","DOI":"10.1109\/WSC40007.2019.9004901"},{"doi-asserted-by":"publisher","unstructured":"Cucuzzo, D., D\u2019Alessio, S., Quaglia, F., Romano, P.: A lightweight heuristic-based mechanism for collecting committed consistent global states in optimistic simulation. In: 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications, DS-RT 2007, pp. 227\u2013234. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/DS-RT.2007.18","key":"38_CR3","DOI":"10.1109\/DS-RT.2007.18"},{"doi-asserted-by":"publisher","unstructured":"Economo, S., Cingolani, D., Pellegrini, A., Quaglia, F.: Configurable and efficient memory access tracing via selective expression-based x86 binary instrumentation. In: 24th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2016, London, United Kingdom, 19\u201321 September 2016, pp. 261\u2013270. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/MASCOTS.2016.69","key":"38_CR4","DOI":"10.1109\/MASCOTS.2016.69"},{"issue":"10","key":"38_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/84537.84545","volume":"33","author":"RM Fujimoto","year":"1990","unstructured":"Fujimoto, R.M.: Parallel discrete event simulation. Commun. ACM 33(10), 30\u201353 (1990). https:\/\/doi.org\/10.1145\/84537.84545","journal-title":"Commun. ACM"},{"unstructured":"Fujimoto, R.M.: Performance of time warp under synthetic workloads. In: Proceedings of the Multiconference on Distributed Simulation, pp. 23\u201328. Society for Computer Simulation (1990)","key":"38_CR6"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1145\/268403.268404","volume":"4","author":"RM Fujimoto","year":"1997","unstructured":"Fujimoto, R.M., Hybinette, M.: Computing global virtual time in shared-memory multiprocessors. ACM Trans. Model. Comput. Simul. 4, 425\u2013446 (1997). https:\/\/doi.org\/10.1145\/268403.268404","journal-title":"ACM Trans. Model. Comput. Simul."},{"doi-asserted-by":"publisher","unstructured":"Ianni, M., Marotta, R., Cingolani, D., Pellegrini, A., Quaglia, F.: The ultimate share-everything PDES system. In: Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2018, pp. 73\u201384. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3200921.3200931","key":"38_CR8","DOI":"10.1145\/3200921.3200931"},{"doi-asserted-by":"publisher","unstructured":"Ianni, M., Marotta, R., Pellegrini, A., Quaglia, F.: Towards a fully non-blocking share-everything PDES platform. In: 21st IEEE\/ACM International Symposium on Distributed Simulation and Real Time Applications, DS-RT 2017, Rome, Italy, 18\u201320 October 2017, pp. 25\u201332. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/DISTRA.2017.8167663","key":"38_CR9","DOI":"10.1109\/DISTRA.2017.8167663"},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/3916.3988","volume":"7","author":"DR Jefferson","year":"1985","unstructured":"Jefferson, D.R.: Virtual time. ACM Trans. Program. Lang. Syst. 7(3), 404\u2013425 (1985). https:\/\/doi.org\/10.1145\/3916.3988","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"publisher","unstructured":"Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F.: A lock-free o(1) event pool and its application to share-everything PDES platforms. In: Proceedings of the 20th International Symposium on Distributed Simulation and Real-Time Applications, DS-RT 2016, pp. 53\u201360. IEEE Press (2016). https:\/\/doi.org\/10.1109\/DS-RT.2016.33","key":"38_CR11","DOI":"10.1109\/DS-RT.2016.33"},{"doi-asserted-by":"publisher","unstructured":"Marotta, R., Ianni, M., Pellegrini, A., Quaglia, F.: A conflict-resilient lock-free calendar queue for scalable share-everything PDES platforms. In: Proceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2017, pp. 15\u201326. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3064911.3064926","key":"38_CR12","DOI":"10.1145\/3064911.3064926"},{"doi-asserted-by":"publisher","unstructured":"Marotta, R., Montesano, F., Quaglia, F.: Effective access to the committed global state in speculative parallel discrete event simulation on multi-core machines. In: Proceedings of the 2023 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2023, Orlando, FL, USA, 21\u201323 June 2023, pp. 107\u2013117. ACM (2023). https:\/\/doi.org\/10.1145\/3573900.3591117","key":"38_CR13","DOI":"10.1145\/3573900.3591117"},{"doi-asserted-by":"publisher","unstructured":"Montesano, F., Marotta, R., Quaglia, F.: Spatial\/temporal locality-based load-sharing in speculative discrete event simulation on multi-core machines. In: SIGSIM-PADS 2022: SIGSIM Conference on Principles of Advanced Discrete Simulation, Atlanta, GA, USA, 8\u201310 June 2022, pp. 81\u201392. ACM (2022). https:\/\/doi.org\/10.1145\/3518997.3531026","key":"38_CR14","DOI":"10.1145\/3518997.3531026"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54420-0_49","volume-title":"Euro-Par 2013: Parallel Processing Workshops","author":"A Pellegrini","year":"2014","unstructured":"Pellegrini, A., Quaglia, F.: The ROme OpTimistic simulator: a tutorial. In: an Mey, D., et al. (eds.) Euro-Par 2013. LNCS, vol. 8374, pp. 501\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54420-0_49"},{"doi-asserted-by":"publisher","unstructured":"Pellegrini, A., Quaglia, F.: Wait-free global virtual time computation in shared memory timewarp systems. In: 26th IEEE International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2014, Paris, France, 22\u201324 October 2014, pp. 9\u201316. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/SBAC-PAD.2014.38","key":"38_CR16","DOI":"10.1109\/SBAC-PAD.2014.38"},{"doi-asserted-by":"publisher","unstructured":"Quaglia, F.: Event history based sparse state saving in time warp. In: Unger, B.W., Ferscha, A. (eds.) Proceedings of the 12th Workshop on Parallel and Distributed Simulation, PADS 1998, Banff, Alberta, Canada, 26\u201329 May 1998, pp. 72\u201379. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/PADS.1998.685272","key":"38_CR17","DOI":"10.1109\/PADS.1998.685272"},{"doi-asserted-by":"publisher","unstructured":"Quaglia, F.: Combining periodic and probabilistic checkpointing in optimistic simulation. In: Fujimoto, R.M., Turner, S.J. (eds.) Proceedings of the Thirteenth Workshop on Parallel and Distributed Simulation, PADS 1999, Atlanta, GA, USA, 1\u20134 May 1999, pp. 109\u2013116. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/PADS.1999.766167","key":"38_CR18","DOI":"10.1109\/PADS.1999.766167"},{"issue":"4","key":"38_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/71.920586","volume":"12","author":"F Quaglia","year":"2001","unstructured":"Quaglia, F.: A cost model for selecting checkpoint positions in time warp parallel simulation. IEEE Trans. Parallel Distrib. Syst. 12(4), 346\u2013362 (2001). https:\/\/doi.org\/10.1109\/71.920586","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"R\u00f6nngren, R., Liljenstam, M., Ayani, R., Montagnat, J.: Transparent incremental state saving in time warp parallel discrete event simulation. In: Proceedings of the Tenth Workshop on Parallel and Distributed Simulation, PADS 1996, pp. 70\u201377. IEEE Computer Society, USA (1996). https:\/\/doi.org\/10.1145\/238788.238818","key":"38_CR20","DOI":"10.1145\/238788.238818"},{"doi-asserted-by":"publisher","unstructured":"Silvestri, E., Milia, C., Marotta, R., Pellegrini, A., Quaglia, F.: Exploiting inter-processor-interrupts for virtual-time coordination in speculative parallel discrete event simulation. In: Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2020, pp. 49\u201359. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3384441.3395985","key":"38_CR21","DOI":"10.1145\/3384441.3395985"},{"key":"38_CR22","volume-title":"Operating Systems: Internals and Design Principles","author":"W Stallings","year":"2011","unstructured":"Stallings, W.: Operating Systems: Internals and Design Principles, 7th edn. Prentice Hall Press, USA (2011)","edition":"7"},{"doi-asserted-by":"publisher","unstructured":"Toccaceli, R., Quaglia, F.: DyMeLoR: dynamic memory logger and restorer library for optimistic simulation objects with generic memory layout. In: 2012 ACM\/IEEE\/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, pp. 163\u2013172. IEEE Computer Society, Los Alamitos (2008). https:\/\/doi.org\/10.1109\/PADS.2008.23","key":"38_CR23","DOI":"10.1109\/PADS.2008.23"},{"key":"38_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2425248.2425250","volume":"3","author":"R Vitali","year":"2012","unstructured":"Vitali, R., Pellegrini, A., Quaglia, F.: Load sharing for optimistic parallel simulations on multi core machines. ACM SIGMETRICS Perform. Eval. Rev. 3, 2\u201311 (2012). https:\/\/doi.org\/10.1145\/2425248.2425250","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43264-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:47:37Z","timestamp":1710330457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43264-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432637","9783031432644"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43264-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vadimmalvone.github.io\/eumas2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PhD - Short Papers (20 submissions; 16 short papers accepted for proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}