A class of systems with nearly zero distributed simulation overhead

DOI10.1016/0020-0255(92)90085-MMaRDI QIDQ1194808zbMATH OpenOpenAlexFDO

Authors Devendra Kumar

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

zbMATH Keywords

distributed simulation algorithmdistributed simulator

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Efficient distributed simulation of acyclic systems
• Pseudosimulation: an algorithm for distributed simulation with limited memory
• Empirical measurements of overheads in conservative asynchronous simulations
• The distributed simulation of clustered processes
• Reducing null messages overhead through load balancing in conservative distributed simulation systems

Cites work

• A class of systems with nearly zero distributed simulation overhead
• A Proof System for Communicating Sequential Processes
• An axiomatic proof technique for parallel programs
• Communicating sequential processes
• Derivation of a parallel algorithm for balancing binary trees
• Distributed simulation of networks
• Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
• Distributed Termination
• scientific article; zbMATH DE number 4068287 (Why is no real title available?)
• Proofs of Networks of Processes
• Pseudosimulation: an algorithm for distributed simulation with limited memory
• Time, clocks, and the ordering of events in a distributed system

Cited in

(3)

• A class of systems with nearly zero distributed simulation overhead
• Efficient distributed simulation of acyclic systems
• Pseudosimulation: an algorithm for distributed simulation with limited memory

This page was built for publication: A class of systems with nearly zero distributed simulation overhead

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