A standard form of citation of this article is:
Lysenko, Mikola and D'Souza, Roshan M. (2008). 'A Framework for Megascale Agent Based Model Simulations on Graphics Processing Units'. Journal of Artificial Societies and Social Simulation 11(4)10 <https://www.jasss.org/11/4/10.html>.
The following can be copied and pasted into a Bibtex bibliography file, for use with the LaTeX text processor:
@article{lysenko2008,
title = {A Framework for Megascale Agent Based Model Simulations on Graphics Processing Units},
author = {Lysenko, Mikola and D'Souza, Roshan M.},
journal = {Journal of Artificial Societies and Social Simulation},
ISSN = {1460-7425},
volume = {11},
number = {4},
pages = {10},
year = {2008},
URL = {https://www.jasss.org/11/4/10.html},
keywords = {GPGPU, Agent Based Modeling, Data Parallel Algorithms, Stochastic},
abstract = {Agent-based modeling is a technique for modeling dynamic systems from the bottom up. Individual elements of the system are represented computationally as agents. The system-level behaviors emerge from the micro-level interactions of the agents. Contemporary state-of-the-art agent-based modeling toolkits are essentially discrete-event simulators designed to execute serially on the Central Processing Unit (CPU). They simulate Agent-Based Models (ABMs) by executing agent actions one at a time. In addition to imposing an un-natural execution order, these toolkits have limited scalability. In this article, we investigate data-parallel computer architectures such as Graphics Processing Units (GPUs) to simulate large scale ABMs. We have developed a series of efficient, data parallel algorithms for handling environment updates, various agent interactions, agent death and replication, and gathering statistics. We present three fundamental innovations that provide unprecedented scalability. The first is a novel stochastic memory allocator which enables parallel agent replication in O(1) average time. The second is a technique for resolving precedence constraints for agent actions in parallel. The third is a method that uses specialized graphics hardware, to gather and process statistical measures. These techniques have been implemented on a modern day GPU resulting in a substantial performance increase. We believe that our system is the first ever completely GPU based agent simulation framework. Although GPUs are the focus of our current implementations, our techniques can easily be adapted to other data-parallel architectures. We have benchmarked our framework against contemporary toolkits using two popular ABMs, namely, SugarScape and StupidModel.},
}The following can be copied and pasted into a text file, which can then be imported into a reference database that supports imports using the RIS format, such as Reference Manager and EndNote.
TY - JOUR
TI - A Framework for Megascale Agent Based Model Simulations on Graphics Processing Units
AU - Lysenko, Mikola
AU - D'Souza, Roshan M.
Y1 - 2008/10/31
JO - Journal of Artificial Societies and Social Simulation
SN - 1460-7425
VL - 11
IS - 4
SP - 10
UR - https://www.jasss.org/11/4/10.html
KW - GPGPU
KW - Agent Based Modeling
KW - Data Parallel Algorithms
KW - Stochastic
N2 - Agent-based modeling is a technique for modeling dynamic systems from the bottom up. Individual elements of the system are represented computationally as agents. The system-level behaviors emerge from the micro-level interactions of the agents. Contemporary state-of-the-art agent-based modeling toolkits are essentially discrete-event simulators designed to execute serially on the Central Processing Unit (CPU). They simulate Agent-Based Models (ABMs) by executing agent actions one at a time. In addition to imposing an un-natural execution order, these toolkits have limited scalability. In this article, we investigate data-parallel computer architectures such as Graphics Processing Units (GPUs) to simulate large scale ABMs. We have developed a series of efficient, data parallel algorithms for handling environment updates, various agent interactions, agent death and replication, and gathering statistics. We present three fundamental innovations that provide unprecedented scalability. The first is a novel stochastic memory allocator which enables parallel agent replication in O(1) average time. The second is a technique for resolving precedence constraints for agent actions in parallel. The third is a method that uses specialized graphics hardware, to gather and process statistical measures. These techniques have been implemented on a modern day GPU resulting in a substantial performance increase. We believe that our system is the first ever completely GPU based agent simulation framework. Although GPUs are the focus of our current implementations, our techniques can easily be adapted to other data-parallel architectures. We have benchmarked our framework against contemporary toolkits using two popular ABMs, namely, SugarScape and StupidModel.
ER -