Determining the Last Process to Fail (Extended Abstract)
Summary: Derives necessary and sufficient conditions for computing LAST (the final failing process or concurrently failing group) from locally stored failure records accessible when their sites are up. Designs low-overhead, fault-tolerant logging that minimizes recovered sites under incomplete info and dynamic membership. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dale Skeen
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,442 | A Recovery Algorithm for a Distributed Database System | 1983 | PODS | 8.8099248e-05 |
| 13,037 | Simplifying Distributed Database Systems Design by Using a Broadcast Network | 1984 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,442 | A Recovery Algorithm for a Distributed Database System | 1983 | PODS | 8.8099248e-05 |
Previous
Page 1 / 1
Next