This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A Framework for Megascale Agent Based Model Simulations on Graphics Processing Units

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mikola Lysenko ()
Roshan M. D'Souza ()
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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://jasss.soc.surrey.ac.uk/11/4/10/10.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Article provided by Journal of Artificial Societies and Social Simulation in its journal Journal of Artificial Societies and Social Simulation.

Volume (Year): 11 (2008)
Issue (Month): ()
Pages:
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:jas:jasssj:2008-36-3

Contact details of provider:

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords: GPGPU; Agent Based Modeling; Data Parallel Algorithms; Stochastic Simulations;

Statistics
Access and download statistics

Did you know? RePEc data is maintained by each archive holder on its own website. Nothing is held centrally.

This page was last updated on 2009-12-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.