A class of systems with nearly zero distributed simulation overhead
type: Item
instance of: scholarly article
title: A class of systems with nearly zero distributed simulation overhead
zbMATH Open document ID: 0753.68098
DOI: 10.1016/0020-0255(92)90085-M
author: Devendra Kumar
published in: Information Sciences
publication date: 1992-10-04T00:00:00Z
Mathematics Subject Classification ID: 68U20
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 68662
zbMATH Keywords: distributed simulator
zbMATH Keywords: distributed simulation algorithm
MaRDI profile type: Publication
cites work: A Proof System for Communicating Sequential Processes
cites work: Distributed simulation of networks
cites work: Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
cites work: Distributed Termination
cites work: Pseudosimulation: an algorithm for distributed simulation with limited memory
cites work: Communicating sequential processes
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Q3801075
cites work: Proofs of Networks of Processes
cites work: Derivation of a parallel algorithm for balancing binary trees
cites work: An axiomatic proof technique for parallel programs
full work available at URL: 0020-0255(92)90085-m
OpenAlex ID: W2082865973
description: scientific article; zbMATH DE number 68662