Speedup of a sparse system simulation

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 characterised 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