A basic unit of computation in distributed systems
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors define basic units of computation in distributed systems, whether communicating synchronously or asynchronously, as comprising indivisible logical units of computation that take the system from one ground state to another. It is explained how a computation can be viewed as a partial order over the basic units of the computation. The problem of detecting the basic units is considered. One algorithm for creating ground states during a computation in an asynchronously communicating system with FIFO channels is given, and an existing algorithm that implicitly creates ground states in a synchronously communicating system is referenced. The significance of the basic unit is explained, and its applications are given.Keywords
This publication has 13 references indexed in Scilit:
- Breakpoints and halting in distributed programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Recovery in distributed systems using optimistic message logging and checkpointingJournal of Algorithms, 1990
- Concurrent common knowledge: a new definition of agreement for asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1988
- Algorithms for distributed termination detectionDistributed Computing, 1987
- How processes learnDistributed Computing, 1986
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Global States of a Distributed SystemIEEE Transactions on Software Engineering, 1982
- Communicating sequential processesCommunications of the ACM, 1978
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- System structure for software fault toleranceIEEE Transactions on Software Engineering, 1975