Lazy Algorithms in Parallel Discrete Event Simulation (1998)
BibTeX
@MISC{Pasquini98lazyalgorithms,
author = {Reuben Pasquini and Vernon Rego},
title = {Lazy Algorithms in Parallel Discrete Event Simulation},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Optimistic parallel discrete event simulation (PDES) systems rely upon the time warp synchronization algorithm, or some variant, to enforce causality. In a parallel simulation, causality is violated when one processor sends another processor a straggler event which is scheduled to execute at a virtual time (v.t.) in the latter's past. When a processor receives a straggler event, the processor rolls its local state back to a state saved at a v.t. preceding the straggler's scheduled v.t. We address the overhead of a processor's roll back from its current time to a past time. We propose new lazy techniques for saving state, calendar management, and gvt scheduling, to enhance system performance. We present our results in the context of the ParaSol system. 1 Introduction The problem of rapidly simulating large, complex systems promises to be one of the major challenges of the next decade. For example, the next generation of computer chips will have in excess of one billion transistors mak...
Keyphrases
lazy algorithm parallel discrete event simulation straggler event calendar management new lazy technique parallel simulation next generation current time time warp synchronization algorithm parasol system next decade gvt scheduling local state past time complex system virtual time system performance optimistic parallel discrete event simulation computer chip major challenge
