A class of systems with nearly zero distributed simulation overhead
From MaRDI portal
Publication:1194808
DOI10.1016/0020-0255(92)90085-MzbMath0753.68098OpenAlexW2082865973MaRDI QIDQ1194808
Publication date: 4 October 1992
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(92)90085-m
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A class of systems with nearly zero distributed simulation overhead ⋮ Efficient distributed simulation of acyclic systems
Cites Work
- Unnamed Item
- A class of systems with nearly zero distributed simulation overhead
- An axiomatic proof technique for parallel programs
- Pseudosimulation: an algorithm for distributed simulation with limited memory
- Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
- Derivation of a parallel algorithm for balancing binary trees
- A Proof System for Communicating Sequential Processes
- Distributed Termination
- Proofs of Networks of Processes
- Time, clocks, and the ordering of events in a distributed system
- Communicating sequential processes
- Distributed simulation of networks
This page was built for publication: A class of systems with nearly zero distributed simulation overhead
