Bounds and approximations for self-initiating distributed simulation without lookahead

DOI10.1145/130611.130615zbMATH Open0842.68102OpenAlexW2067470455MaRDI QIDQ4876097FDOQ4876097

Authors: Robert E. Felderman, Leonard Kleinrock 

Publication date: 13 August 1996

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/tomacs/

Recommendations

• Performance bounds on parallel self-initiating discrete-event simulations
• Performance limitations of parallel simulations
• The distributed simulation of clustered processes
• Instability and performance limits of distributed simulators of feedforward queueing networks
• Deriving global virtual time algorithms from conservative simulation protocols

zbMATH Keywords

distributed simulationglobal virutal time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (2)

• Parallel simulation today
• Pseudosimulation: an algorithm for distributed simulation with limited memory

This page was built for publication: Bounds and approximations for self-initiating distributed simulation without lookahead

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