skip to main content
research-article

Managing Pending Events in Sequential and Parallel Simulations Using Three-tier Heap and Two-tier Ladder Queue

Published:15 March 2019Publication History
Skip Abstract Section

Abstract

Performance of sequential and parallel Discrete Event Simulations (DES) is strongly influenced by the data structure used for managing and processing pending events. Accordingly, we propose and evaluate the effectiveness of our multi-tiered (two- and three-tier) data structures and our Two-tier Ladder Queue, for both sequential and optimistic parallel simulations on distributed memory platforms. Our experiments compare the performance of our data structures against a performance-tuned version of the Ladder Queue, which has been shown to outperform many other data structures for DES. The core simulation-based empirical assessments are in C++ and are based on 2,500 configurations of well-established PHOLD and PCS benchmarks. In addition, we use an Avian Influenza Epidemic Model (AIM) for experimental analyses. We have conducted experiments on two computing clusters with different hardware to ensure our results are reproducible. Moreover, to fully establish the robustness of our analysis and data structures, we have also implemented pertinent queues in Java and verified consistent, reproducible performance characteristics. Collectively, our analyses show that our three-tier heap and two-tier ladder queue outperform the Ladder Queue by 60× in some simulations, particularly those with higher concurrency per Logical Process (LP), in both sequential and Time Warp synchronized parallel simulations.

Skip Supplemental Material Section

Supplemental Material

References

  1. C. D. Carothers, R. M. Fujimoto, Y. B. Lin, and P. England. 1994. Distributed simulation of large-scale PCS networks. In Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. Durham, NC, 2--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Christopher D. Carothers and Kalyan S. Perumalla. 2010. On deciding between conservative and optimistic approaches on massively parallel platforms. In Proceedings of the Winter Simulation Conference (WSC’10). IEEE, Baltimore, MD, 678--687. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Jörgen Dahl, Malolan Chetlur, and Philip A. Wilsey. 2001. Event list management in distributed simulation. In Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing (Euro-Par’01). Springer-Verlag, Berlin, 466--475. Retrieved from http://dl.acm.org/citation.cfm?id=646666.699734. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Tom Dickman, Sounak Gupta, and Philip A. Wilsey. 2013. Event pool structures for PDES on many-core Beowulf clusters. In Proceedings of ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’13). ACM, New York, NY, 103--114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Romain Franceschini, Paul-Antoine Bisgambiglia, and Paul Bisgambiglia. 2015. A comparative study of pending event set implementations for PDEVS simulation. In Proceedings of the DEVS Integrative M8S Symposium. SCS, San Diego, CA, 77--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sounak Gupta and Philip A. Wilsey. 2014. Lock-free pending event set management in time warp. In Proceedings of the ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’14). ACM, New York, NY, 15--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Basak Guven and Alan Howard. 2007. Identifying the critical parameters of a cyanobacterial growth and movement model by using generalised sensitivity analysis. Ecol. Model. 207, 1 (2007), 11--21.Google ScholarGoogle ScholarCross RefCross Ref
  8. Joshua Hay and Philip A. Wilsey. 2015. Experiments with hardware-based transactional memory in parallel simulation. In Proceedings of the 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’15). ACM, New York, NY, 75--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Julius Higiro, Meseret Gebre, and Dhananjai M. Rao. 2017. Multi-tier priority queues and 2-tier ladder queue for managing pending events in sequential and optimistic parallel simulations. In Proceedings of the ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’17). ACM, New York, NY, 3--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Shafagh Jafer, Qi Liu, and Gabriel Wainer. 2013. Synchronization methods in parallel and distributed discrete-event simulation. Simul. Model. Pract. Theory 30 (2013), 54--73.Google ScholarGoogle ScholarCross RefCross Ref
  11. Romolo Marotta, Mauro Ianni, Alessandro Pellegrini, and Francesco Quaglia. 2016. 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’16). IEEE Press, Piscataway, NJ, 53--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Romolo Marotta, Mauro Ianni, Alessandro Pellegrini, and Francesco Quaglia. 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’16). ACM, ICST, Brussels, Belgium, 46--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Romolo Marotta, Mauro Ianni, Alessandro Pellegrini, and Francesco Quaglia. 2017. A conflict-resilient lock-free calendar queue for scalable share-everything PDES platforms. In Proceedings of the ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’17). ACM, New York, NY, 15--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Francesco Quaglia. 2015. A low-overhead constant-time lowest-timestamp-first CPU scheduler for high-performance optimistic simulation platforms. Simul. Model. Pract. Theory 53 (2015), 103--122.Google ScholarGoogle ScholarCross RefCross Ref
  15. Dhananjai M. Rao. 2014. Accelerating parallel agent-based epidemiological simulations. In Proceedings of the 2nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’14). ACM, New York, NY, 127--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Dhananjai M. Rao. 2016. Efficient parallel simulation of spatially explicit agent-based epidemiological models. J. Parallel Distrib. Comput. 93-94 (2016), 102--119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Dhananjai M. Rao and Alexander Chernyakhovsky. 2008. Parallel simulation of the global epidemiology of avian influenza. In Proceedings of the 40th Conference on Winter Simulation (WSC’08). Winter Simulation Conference, 1583--1591. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Wai Teng Tang, Rick Siow Mong Goh, and Ian Li-Jin Thng. 2005. Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation. ACM Trans. Model. Comput. Simul. 15, 3 (July 2005), 175--204. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Philip A. Wilsey. 2016. Some properties of events executed in discrete-event simulation models. In Proceedings of the Annual ACM Conference on SIGSIM Principles of Advanced Discrete Simulation (SIGSIM-PADS’16). ACM, New York, NY, 165--176. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Managing Pending Events in Sequential and Parallel Simulations Using Three-tier Heap and Two-tier Ladder Queue

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Modeling and Computer Simulation
          ACM Transactions on Modeling and Computer Simulation  Volume 29, Issue 2
          Special Issue on PADS 2017
          April 2019
          105 pages
          ISSN:1049-3301
          EISSN:1558-1195
          DOI:10.1145/3320014
          Issue’s Table of Contents

          Copyright © 2019 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 15 March 2019
          • Accepted: 1 August 2018
          • Revised: 1 May 2018
          • Received: 1 November 2017
          Published in tomacs Volume 29, Issue 2

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format