Name
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/375658.375819 | Workshop on Principles of Advanced and Distributed Simulation |
Keywords | Field | DocType |
sparse system simulation,simulation program,sparse system,output generating state,optimistic technique,certain type,conservative simulation algorithm,speedup result,representative sparse simulation,computational physics,discrete event simulation,heart,concrete,metropolis algorithm,world wide web | Optimistic simulation,Metropolis–Hastings algorithm,Computer science,Parallel computing,Real-time computing,Conjecture,Speedup,Discrete event simulation,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-1104-X | 2 | 0.41 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James J. Nutaro | 1 | 43 | 10.11 |
| Hessam S. Sarjoughian | 2 | 253 | 43.42 |