Speedup of a sparse system simulation

Authors:
James Nutaro;Hessam Sarjoughian
Affiliations:
Arizona Center for Integrative Modeling and Simulation, University of Arizona;Arizona Center for Integrative Modeling and Simulation, University of Arizona
Venue:
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Year:
2001

Citing 6
Cited 1

Breathing Time Warp

PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Exploiting temporal uncertainty in parallel and distributed simulations

PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
On the selection of the state saving strategy in time warp parallel simulations

Transactions of the Society for Computer Simulation International - Special issue on parallel and distributed simulation
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
STL for C++ Programmers

STL for C++ Programmers
Theory of Modeling and Simulation

Theory of Modeling and Simulation

Design of Distributed Simulation Environments: A Unified System-Theoretic and Logical Processes Approach

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.