DBScholar

Back to papers

Optimal Termination Protocols for Network Partitioning

Summary: Formal model of termination protocols under network partitions using per-component states; introduces optimality metrics: waiting components and avg waiting sites. Gives protocols optimal for centralized/decentralized commits, proving quorum-based terminations excel and centralized commits win with a reliable coordinator. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
642
Venue
PODS
Year
1983
Pagerank
5.8378055e-05
Overall Rank
6,568 | 54.94%
DOI
10.1145/588058.588064

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chin_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Optimal Termination Protocols for Network Partitioning}},
        url = {https://dl.acm.org/doi/10.1145/588058.588064},
        doi = {10.1145/588058.588064},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chin, Francis and Ramarao, K. V. S.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,162 Increasing the Resilience of Atomic Commit, at No Additional Cost 1995 PODS 5.9533559e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
480 Nonblocking Commit Protocols 1981 SIGMOD 0.00017789222
4,338 Analysis of Distributed Commit Protocols 1982 SIGMOD 6.7554093e-05
Previous Page 1 / 1 Next

Semantically Similar Papers