Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Parallel discrete-event simulation of FCFS stochastic queueing networks
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
SGTNE: semi-global time of the next event algorithm
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Parallel simulation of billiard balls using shared variables
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We describe, in this paper, a synchronization/deadlock resolution mechanism for a network of communicating finite state machines implemented on a parallel machine. As it is message-based, it is appropriate for distributed memory machines.The technique was inspired by a project at the Jet Propulsion laboratories whose goal is the specification and verification of the software used to control the interplanetary spacecraft operated by the laboratory.The network of communicating finite state machines makes use of write messages to alter the value of the variables describing the finite state machines and read messages to determine the state of the variables. Since a blocking protocol is employed, it is possible for deadlocks to occur. Consequently, we describe deadlock resolution algorithms.Our algorithms were implemented on an iPSC/2 hypercube, demonstrating good performance on a queueing network model.