2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2012)

Zhangjiajie China

July 15, 2012 to July 19, 2012

ISSN: 1087-4097

ISBN: 978-1-4673-1797-9

pp: 187-189

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PADS.2012.2

ABSTRACT

A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical analysis and experimental result show that the algorithm proposed in this paper has the following advantages when running on CPU cluster: 1) it can hide more communication latency, 2) a smaller R can satisfy the best communication latency hiding.

INDEX TERMS

Computational modeling, Algorithm design and analysis, Clustering algorithms, Analytical models, Graphics processing unit, Computer architecture, Delay, Cluster, Agent-based simulation, Communication latencyhiding, Parallel processing, Multi-core

CITATION

L. Chen, J. Huang and J. Zhang, "A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment,"

*2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation(PADS)*, Zhangjiajie China, 2012, pp. 187-189.

doi:10.1109/PADS.2012.2

CITATIONS