Test&set, adaptive renaming and set agreement: A guided visit to asynchronous computability

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2007, Pages 93-102

  Gafni, Eli ^a   Raynal, Michel ^b   Travers, Corentin ^b  

^a Department of Civil and Environmental Engineering   (United States)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Adaptive renaming; Asynchronous system; Atomic register; Atomic snapshot; Process crash; Reduction; Set agreement; Shared memory; t resilience; Test set; Wait free algorithm

Indexed keywords

TECHNICAL PRESENTATIONS;

ARBITRARY NUMBERS; ASYNCHRONOUS COMPUTING; CONSENSUS PROBLEMS; FAULT-TOLERANT; INTERNATIONAL SYMPOSIUM; NECESSARY AND SUFFICIENT CONDITIONS; PAPER ADDRESSES; RELIABLE DISTRIBUTED SYSTEMS; RENAMING PROBLEM; SIDE EFFECTS;

TESTING;

EID: 47249127211     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2007.4365687     Document Type: Conference Paper

References (20)

1. Afek Y., Attiya H., Dolev D., Gafni E., Merritt M. and Shavit N., Atomic Snapshots of Shared Memory. Journal of the ACM, 40(4):873-890, 1993.
2. Afek Y. and Merritt M., Fast, Wait-Free (2k - 1)-Renaming. Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC'99), ACM Press, pp. 105-112. 1999.
3. Attiya H., Bar-Noy A., Dolev D., Peleg D. and Reischuk R., Renaming in an Asynchronous Environment. Journal of the ACM, 37(3):524-548, 1990.
4. Attiya H. and Fouren A., Polynomial and Adaptive Longlived (2k - 1)-Renaming. Proc. 14th Symposium on Distributed Computing (DISC'00), LNCS #1914, pp. 149-163. 2000.
5. Attiya H. and Rachman O., Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing, 27(2):319-340, 1998.
6. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, (2d Edition), Wiley-Interscience. 414 pages, 2004.
7. Borowsky E. and Gafni E., Immediate Atomic Snapshots and Fast Renaming. Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC93), pp. 41-51, 1993.
8. Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM Symposium on Theory of Distributed Computing (STOC93), ACM Press, pp. 91-100, 1993.
9. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
10. Gafni E., Read-Write Reductions. Proc. 8th Int'l Conference on Distributed Computing and Networking (ICDCN'06), Springer Verlag LNCS #4308, pp. 349-354, 2006.
11. Gafni E., Renaming with k-set Consensus: an Optimal Algorithm in n + k - 1 Slots. Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06), Springer Verlag LNCS #4305, pp. 36-44, 2006.
12. Gafni E., Rajsbaum S. and Herlihy M.. Subconsensus Tasks: Renaming is Weaker than Set Agreement. Proc. 20th Int'l Symposium on Distributed Computing (DISC06), Springer-Verlag #4167, pp.329-338, 2006.
13. Herlihy M.P., Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems, 13(1): 124-149, 1991.
14. Herlihy M.P. and Rajsbaum S., Algebraic Spans. Mathematical Structures in Computer Science, 10(4): 549-573, 2000.
15. Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923., 1999.
16. Herlihy M.P. and Wing J.M., Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
17. Lamport. L., On Interprocess Communication. Part II: Algorithms. Distributed Computing, 1(2):86-101, 1986.
18. k to wait-free adaptive (2p - ⌈p/k⌉)-renaming via k-set agreement. Proc. 20th Symposium on Distributed Computing (DISC'06), Springer Verlag LNCS #4167, pp. 1-15, 2006.
19. Mostéfaoui A., Raynal M. and Travers C., From Renaming to Set Agreement. 14th Colloquium on Structural Information and Communication Complexity (SIROCCO'07), Springer Verlag LNCS #4474, pp. 62-76, 2007.
20. Saks M. and Zaharoglou F., Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing. 29(5): 1449-1483, 2000.