DBScholar

Back to papers

A Framework for Understanding Distributed (Deadlock Detection) Algorithms

Summary: Framework defines complexity levels for distributed decision algorithms, modeling algorithm state as a database with views and transaction atomicity to simplify specification and correctness obligations. Applied to distributed deadlock detection to systematically prove correctness of existing algorithms and synthesize new hybrids combining their best features. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
657
Venue
PODS
Year
1983
Pagerank
-
Overall Rank
14,502 | 0.51%
DOI
10.1145/588058.588082

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{korth_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{A Framework for Understanding Distributed (Deadlock Detection) Algorithms}},
        url = {https://dl.acm.org/doi/10.1145/588058.588082},
        doi = {10.1145/588058.588082},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Korth, Henry F. and Krishnamurthy, Ravi and Nigam, Anil and Robinson, John T.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,151 Replication and Consistency: Being Lazy Helps Sometimes 1997 PODS 5.9578457e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers