학술논문

Transparent and adaptive computation-block caching for agent-based simulation on a PDES core
Document Type
Conference
Source
2008 Winter Simulation Conference Simulation Conference, 2008. WSC 2008. Winter. :854-862 Dec, 2008
Subject
Computing and Processing
Computational modeling
Tiles
Discrete event simulation
Costs
Path planning
Computer simulation
Scalability
State-space methods
Application software
Computer science
Language
ISSN
0891-7736
1558-4305
Abstract
We present adaptive computation-block caching that supports improved performance and is suited for agent-based simulations. The approach is illustrated in SASSY (Scalable Agents Simulation System). SASSY leverages a Parallel Discrete Event Simulation for performance, but provides an agent-based API to the developer. Agent-based simulation is suited to computation-block caching because relevant calculations completed at each event may be relatively heavyweight and may be repeated. The potential savings of avoiding a computation entirely may offset the overhead cost of caching. The approach is refined through the use of statistical methods for choosing which computation blocks should be cached or not. If the relevant computation is trivial, caching is not worth the cost. In other cases caching provides a substantial speedup. Our mechanism tracks these costs online and adjusts accordingly. It requires no additional coding but is automatically integrated into applications. We assess the performance of the approach in a benchmark-application.