Abstract
A formalism for comparing the average execution time of distributed protocols is provided. The comparisons are made independently of the properties of the network on which the protocols are executed. The formalism takes into account computation time, the time to transfer information, the time spent by a site waiting to synchronize with other sites, and the overlap among them. A framework in which the information transfer and synchronization requirements of a protocol are separately and explicitly specified is developed. A knowledge formalism is used to specify the protocol's specification requirements. Transformations on protocols which may change the synchronization structure, the information transferred, or the amount of local computation are defined. It is shown that, if a sequence of such transformations can be applied to a protocol to obtain another protocol, the final protocol runs at least as fast as the initial. Two notions of comparison, containment and reducibility, are given, and their properties are explored. Several protocols, including those for atomic commitment and snapshot recording, are analyzed to illustrate the technique.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
| Publisher | IEEE Computer Society |
| Pages | 80-87 |
| Number of pages | 8 |
| State | Published - 1990 |
| Externally published | Yes |
| Event | Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10 - Paris, Fr Duration: May 28 1990 → Jun 1 1990 |
Other
| Other | Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10 |
|---|---|
| City | Paris, Fr |
| Period | 5/28/90 → 6/1/90 |
ASJC Scopus subject areas
- Hardware and Architecture