Deriving global virtual time algorithms from conservative simulation protocols

DOI10.1016/0020-0190(95)00004-VMaRDI QIDQ673478zbMATH OpenFDO

Authors George Varghese, Roger Chamberlain, William E. Weihl

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00004-V

zbMATH Keywords

ConcurrencyDesign of algorithmsDiscrete event simulationDistributed computingParallel computing

Mathematics Subject Classification ID

Recommendations

• Computing global virtual time in shared-memory multiprocessors
• scientific article; zbMATH DE number 1795989
• Time and space bounds for reversible simulation
• scientific article; zbMATH DE number 1418466
• Quantitative Temporal Simulation and Refinement Distances for Timed Systems
• scientific article; zbMATH DE number 1754652

Cites work

• Determining the global progress of parallel simulation with FIFO communication property
• Flush primitives for asynchronous distributed systems

Cited in

(8)

• Determining the global progress of parallel simulation with FIFO communication property
• Virtually timed ambients: a calculus of nested virtualization
• On parallel time in population protocols
• Computing global virtual time in shared-memory multiprocessors
• Bounds and approximations for self-initiating distributed simulation without lookahead
• Virtual time III. I: Unified virtual time synchronization for parallel discrete event simulation
• Virtual time III. II: Combining conservative and optimistic synchronization
• Virtual time III. III: Throttling and message cancellation

This page was built for publication: Deriving global virtual time algorithms from conservative simulation protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673478)