Sciweavers

ANSS
1991
IEEE
13 years 8 months ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
ANSS
1991
IEEE
13 years 8 months ago
Supercritical speedup
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
David R. Jefferson, Peter L. Reiher