Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pseudosimulation: an algorithm for distributed simulation with limited memory

From MaRDI portal
Publication:1822491
Jump to:navigation, search

DOI10.1007/BF01414465zbMath0618.68028MaRDI QIDQ1822491

Bojan Grošelj, Carl Tropper

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)


zbMATH Keywords

synchronizationconcurrent processesterminationCorrectnessdeadlock detection and recoveryblocking algorithmdeadlock- breaking algorithmfully distributed processesmessage communicating processesnetwork of processes which exchange event messages


Mathematics Subject Classification ID

Theory of operating systems (68N25)


Related Items (3)

A class of systems with nearly zero distributed simulation overhead ⋮ Efficient distributed simulation of acyclic systems ⋮ The distributed simulation of clustered processes




Cites Work

  • Termination detection for diffusing computations




This page was built for publication: Pseudosimulation: an algorithm for distributed simulation with limited memory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1822491&oldid=14185372"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki