Speedup of a sparse system simulation

J. Nutaro, H. Sarjoughian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the Workshop on Parallel and Distributed Simulation, PADS
Pages193-199
Number of pages7
StatePublished - 2001
Event15th Workshop on Parallel and Distributed Simulation (PADS 2001) - Lake Arrowhead, CA, United States
Duration: May 15 2001May 18 2001

Other

Other15th Workshop on Parallel and Distributed Simulation (PADS 2001)
CountryUnited States
CityLake Arrowhead, CA
Period5/15/015/18/01

ASJC Scopus subject areas

  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Speedup of a sparse system simulation'. Together they form a unique fingerprint.

Cite this