Understanding the Limitations of Causally and Totally Ordered Communication (1993)
Cached
Download Links
- [cs.ucsb.edu]
- [cs.ucsb.edu]
- [www.cs.utah.edu]
- [www.cs.rice.edu]
- [csalpha.ist.unomaha.edu]
- [cs.unomaha.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 14th ACM Symposium on Operating Systems Principles |
| Citations: | 139 - 1 self |
BibTeX
@INPROCEEDINGS{Cheriton93understandingthe,
author = {David R. Cheriton and Dale Skeen},
title = {Understanding the Limitations of Causally and Totally Ordered Communication},
booktitle = {In Proceedings of the 14th ACM Symposium on Operating Systems Principles},
year = {1993},
pages = {44--57}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Causally and totally ordered communication support (CATOCS) has been proposed as important to provide as part of the basic building blocks for constructing reliable distributed systems. In this paper, we identify four major limitations to CATOCS, investigate the applicability of CATOCS to several classes of distributed applications in light of these limitations, and the potential impact of these facilities on communication scalability and robustness. From this investigation, we find limited merit and several potential problems in using CATOCS. The fundamental difficulty with the CATOCS is that it attempts to solve state problems at the communication level in violation of the
