Name
Abstract | ||
|---|---|---|
It is sometimes necessary in the course of a distributed computation to arrange that a certain set of operations is carried out in the correct order and the correct number of times (typically once). If several sets of operations are performed on different machines on the network there is no obvious mechanism for enforcing such ordering constraints in a fully distributed way. This lack basically stems from the difficulty of preventing copying and repetition of messages by machines and from the impossibility of constraining externally the actions of machines in response to messages that come into their hands. This paper presents a possible method for ensuring the integrity of sequences of operations on different machines. The technique may be thought of as a means of enabling machines to ensure that requests made of them are valid and timely, not as means of centralized control of services. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1145/800216.806592 | SOSP |
Keywords | Field | DocType |
computation step,obvious mechanism,centralized control,constraining externally,possible method,certain set,different machine,enabling machine,correct number,correct order,server,distributed computing,optical disk,memory management | Computer science,Copying,Impossibility,Real-time computing,Memory management,Optical disc,Computation,Stable storage,Distributed computing | Conference |
Volume | Issue | ISSN |
15 | 5 | 0163-5980 |
ISBN | Citations | PageRank |
0-89791-062-1 | 1 | 1.48 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. J. Herbert | 1 | 87 | 49.76 |
| Roger M. Needham | 2 | 4648 | 2075.99 |