2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2012)
July 15, 2012 to July 19, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PADS.2012.20
This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication and synchronization cost for shared-memory multiprocessor multicore machines and for distributed-memory machines. The paper describes a performance model for the hierarchical composite algorithm and proposes a method for predicting the runtime empirically using linear regression. Experiment results show that the model can predict the overall performance of the hierarchical composite algorithm. A significant performance improvement has been observed over different combinations of the traditional asynchronous and synchronous approaches used separately for distributed-memory machines and on shared-memory multiprocessor multicore machines.
Synchronization, Partitioning algorithms, Computational modeling, Clocks, Multicore processing, Prediction algorithms, Topology, hierarchical algorithm, Parallel discrete-event simulation, conservative synchronization protocol, composite synchronization
J. Liu and R. Rong, "Hierarchical Composite Synchronization," 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation(PADS), Zhangjiajie China, 2012, pp. 3-12.