skip to main content
10.1145/2486092.2486106acmconferencesArticle/Chapter ViewAbstractPublication PagespadsConference Proceedingsconference-collections
research-article

Event pool structures for PDES on many-core Beowulf clusters

Published: 19 May 2013 Publication History

Abstract

Multi-core and many-core processing chips are becoming widespread and are now being widely integrated into Beowulf clusters. This poses a challenging problem for distributed simulation as it now becomes necessary to extend the algorithms to operate on a platform that includes both shared memory and distributed memory hardware. Furthermore, as the number of on-chip cores grows, the challenges for developing solutions without significant contention for shared data structures grows. This is especially true for the pending event list data structures where multiple execution threads attempt to schedule the next event for execution. This problem is especially aggravated in parallel simulation, where event executions are generally fine-grained leading quickly to non-trivial contention for the pending event list.
This manuscript explores the design of the software architecture and several data structures to manage the pending event sets for execution in a Time Warp synchronized parallel simulation engine. The experiments are especially targeting multi-core and many-core Beowulf clusters containing 8-core to 48-core processors. These studies include a two-level structure for holding the pending event sets using three different data structures, namely: splay trees, the STL multiset, and ladder queues. Performance comparisons of the three data structures using two architectures for the pending event sets are presented.

References

[1]
H. Avril and C. Tropper. Clustered time warp and logic simulation. In Proceedings of the Ninth Workshop on Parallel and Distributed Simulation (PADS'95), pages 112--119, June 1995.
[2]
P. D. R. Bayer. Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4):290--306, Dec. 1972.
[3]
R. Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM, 31(10):1220--1227, Oct. 1988.
[4]
R. Child and P. A. Wilsey. Using DVFS to optimize time warp simulations. In Proceedings of the 2012 Winter Simulation Conference, July 2012.
[5]
R. Fujimoto. Parallel discrete event simulation. Communications of the ACM, 33(10):30--53, Oct. 1990.
[6]
A. Ghuloum. Face the inevitable, embrace parallelism. Communications of the ACM, 52(9):36--38, Sept. 2009.
[7]
M. Hansen, H. Yalcin, and J. P. Hayes. Unveiling the iscas-85 benchmarks: A case study in reverse engineering. IEEE Design and Test, 16(3):72--80, July-Sept 1999. (benchmarks available online at: http://web.eecs.umich.edu/~jhayes/iscas.restore/).
[8]
Intel Press Release, Intel Corporation. Futuristic intel chip could reshape how computers are built, consumers interact with their pcs and personal devices. Technical report, Intel Press Release, Intel Corporation, Dec. 2009.
[9]
R. Kalla. Power7: Ibm's next generation power microprocessor. In Hot Chips 21, Aug. 2009.
[10]
D. E. Martin, T. J. McBrayer, and P. A. Wilsey. warped: A Time Warp simulation kernel for analysis and application development. In H. El-Rewini and B. D. Shriver, editors, 29th Hawaii International Conference on System Sciences (HICSS-29), volume Volume I, pages 383--386, Jan. 1996.
[11]
R. Miller. Optimistic parallel discrete event simulation on a beowulf cluster of multi-core machines. Master's thesis, University of Cincinnati, 2010.
[12]
K. Muthalagu. Threaded warped: An optimistic parallel discrete event simulator for clusters fo multi-core machines. Master's thesis, School of Electronic and Computing Systems, University of Cincinnati, Cincinnati, OH, Nov. 2012.
[13]
A. Palaniswamy and P. A. Wilsey. Parameterized Time Warp: An integrated adaptive solution to optimistic pdes. Journal of Parallel and Distributed Computing, 37(2):134--145, Sept. 1996.
[14]
S. K. Prasad, S. I. Sawant, and B. Naqib. Using parallel data structures in optimistic discrete event simulation of varying granularity on shared-memory computers. In IEEE First International Conference on Algorithms and Architectures for Parallel Processing, pages 365--374, Apr. 1995.
[15]
R. Radhakrishnan, L. Moore, and P. A. Wilsey. External adjustment of runtime parameters in Time Warp synchronized parallel simulators. In 11th International Parallel Processing Symposium, (IPPS'97). IEEE Computer Society Press, Apr. 1997.
[16]
R. Rajan and P. A. Wilsey. Dynamically switching between lazy and aggressive cancellation in a Time Warp parallel simulator. In Proc. of the 28th Annual Simulation Symposium, pages 22--30. IEEE Computer Society Press, Apr. 1995.
[17]
P. L. Reiher and D. Jefferson. Dynamic load management in the time warp operating system. Transactions of the Society for Computer Simulation, 7(2):91--120, 1990.
[18]
R. Ronngren, R. Ayani, R. M. Fujimoto, and S. R. Das. Efficient implementation of event sets in time warp. In Proceedings of the 1993 workshop on Parallel and distributed simulation, pages 101--108, May 1993.
[19]
R. Ronngren, J. Riboe, and R. Ayani. Lazy queue: An efficient implementation of the pending-event set. In Proc. of the 24th Annual Simulation Symposium, pages 194--204, Apr. 1991.
[20]
T. Santoro and F. Quaglia. A low-overhead constant-time ltf scheduler for optimistic simulation systems. In Proceedings of the The IEEE symposium on Computers and Communications, pages 948--953, June 2010.
[21]
D. Sleator and R. Tarjan. Self adjusting binary search trees. Journal of the ACM, 32(3):652--686, July 1985.
[22]
W. T. Tang, R. S. M. Goh, and I. L.-J. Thng. Ladder queue: An o(1) priority queue structure for large-scale discrete event simulation. ACM Transactions on Modeling and Computer Simulation, 15(3):175--204, July 2005.
[23]
R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6(2):306--318, Apr. 1985.
[24]
R. Vitali, A. Pellegrini, and F. Quaglia. Towards symmetric multi-threaded optimistic simulation kernels. In Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, pages 211--220, July 2012.

Cited By

View all
  • (2024)Spatial/Temporal Locality-Based Load-sharing in Speculative Discrete Event Simulation on Multi-core MachinesACM Transactions on Modeling and Computer Simulation10.1145/363970335:1(1-31)Online publication date: 25-Nov-2024
  • (2022)Spatial/Temporal Locality-based Load-sharing in Speculative Discrete Event Simulation on Multi-core MachinesProceedings of the 2022 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3518997.3531026(81-92)Online publication date: 8-Jun-2022
  • (2019)Managing Pending Events in Sequential and Parallel Simulations Using Three-tier Heap and Two-tier Ladder QueueACM Transactions on Modeling and Computer Simulation10.1145/326575029:2(1-28)Online publication date: 15-Mar-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGSIM PADS '13: Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
May 2013
426 pages
ISBN:9781450319201
DOI:10.1145/2486092
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. beowulf clusters
  2. multi-core
  3. pending event lists
  4. threads
  5. time warp

Qualifiers

  • Research-article

Conference

SIGSIM-PADS '13
Sponsor:

Acceptance Rates

SIGSIM PADS '13 Paper Acceptance Rate 29 of 75 submissions, 39%;
Overall Acceptance Rate 398 of 779 submissions, 51%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 02 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Spatial/Temporal Locality-Based Load-sharing in Speculative Discrete Event Simulation on Multi-core MachinesACM Transactions on Modeling and Computer Simulation10.1145/363970335:1(1-31)Online publication date: 25-Nov-2024
  • (2022)Spatial/Temporal Locality-based Load-sharing in Speculative Discrete Event Simulation on Multi-core MachinesProceedings of the 2022 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3518997.3531026(81-92)Online publication date: 8-Jun-2022
  • (2019)Managing Pending Events in Sequential and Parallel Simulations Using Three-tier Heap and Two-tier Ladder QueueACM Transactions on Modeling and Computer Simulation10.1145/326575029:2(1-28)Online publication date: 15-Mar-2019
  • (2019)Time Warp Simulation on Multi-Core Platforms2019 Winter Simulation Conference (WSC)10.1109/WSC40007.2019.9004880(1454-1468)Online publication date: Dec-2019
  • (2018)Performance comparison of Cross Memory Attach capable MPI vs. Multithreaded Optimistic Parallel SimulationsProceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3200921.3200935(37-48)Online publication date: 14-May-2018
  • (2017)Quantitative Driven Optimization of a Time Warp KernelProceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3064911.3064932(27-38)Online publication date: 16-May-2017
  • (2017)A Conflict-Resilient Lock-Free Calendar Queue for Scalable Share-Everything PDES PlatformsProceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3064911.3064926(15-26)Online publication date: 16-May-2017
  • (2017)Multi-tier Priority Queues and 2-tier Ladder Queue for Managing Pending Events in Sequential and Optimistic Parallel SimulationsProceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3064911.3064921(3-14)Online publication date: 16-May-2017
  • (2017)Performance Evaluation of Priority Queues for Fine-Grained Parallel Tasks on GPUs2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2017.15(1-11)Online publication date: Sep-2017
  • (2016)Programming agent-based demographic models with cross-state and message-exchange dependenciesProceedings of the 2016 Winter Simulation Conference10.5555/3042094.3042223(955-966)Online publication date: 11-Dec-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media