A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment
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 pre...
Uložené v:
| Vydané v: | 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation s. 187 - 189 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.07.2012
|
| Predmet: | |
| ISBN: | 9781467317979, 1467317977 |
| ISSN: | 1087-4097 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| ISBN: | 9781467317979 1467317977 |
| ISSN: | 1087-4097 |
| DOI: | 10.1109/PADS.2012.2 |

