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

Authors:
Li-li Chen;Jian-xin Huang;Jing Zhang
Affiliations:
-;-;-
Venue:
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
Year:
2012

Citing 2
Cited 1

Parallel and Distribution Simulation Systems

Parallel and Distribution Simulation Systems
Efficient simulation of agent-based models on multi-GPU and multi-core clusters

Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques

Coordinator-master-worker model for efficient large scale network simulation

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

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.