A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment

Author

Chen, Li-li ; Huang, Jian-xin ; Zhang, Jing

Author_Institution

Sci. & Technol. on Complex Syst. Simulation Lab., Beijing, China

fYear

2012

fDate

15-19 July 2012

Firstpage

187

Lastpage

189

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.

Keywords

digital simulation; multi-agent systems; multiprocessing systems; parallel processing; ABMS; B+2R algorithm; CPU cluster; communication latency hiding algorithm; distributed computing environment; large scale agent-based model simulations; parallel computing environment; parallel processing; Algorithm design and analysis; Analytical models; Clustering algorithms; Computational modeling; Computer architecture; Delay; Graphics processing unit; Agent-based simulation; Cluster; Communication latencyhiding; Multi-core; Parallel processing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Zhangjiajie

ISSN

1087-4097

Print_ISBN

978-1-4673-1797-9

Type

conf

DOI

10.1109/PADS.2012.2

Filename

6305909