Summary: [22] C. Dwork, M. Herlihy, and O. Waarts. Bounded round numbers. In Proceedings of the
12th Annual ACM Symposium on Principles of Distributed Computing, pages 53--64, 1993.
[23] A. Fouren. Exponential examples for two renaming algorithms. Available at
http://www.cs.technion.ac.il/¸hagit/pubs/expo.ps.gz, Aug. 1999.
[24] E. Gafni. Public communication. 17th Annual ACM Symp. on Principles of Distributed
Computing, July 1998.
[25] E. Gafni and E. Koutsoupias. On uniform protocols. Unpublished manuscript, Nov. 1998.
[26] M. Herlihy. Wait­free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124--149,
Jan. 1991.
[27] M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent
objects. ACM Trans. Prog. Lang. Syst., 12(3):463--492, July 1990.
[28] L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1--11,
Feb. 1987.
[29] M. Moir. Fast, long­lived renaming improved and simplified. Sci. Comput. Programming,
30(3):287--308, May 1998.
[30] M. Moir and J. H. Anderson. Wait­free algorithms for fast, long­lived renaming. Sci.
Comput. Programming, 25(1):1--39, Oct. 1995.
[31] M. Moir and J. A. Garay. Fast long­lived renaming improved and simplified. In Proceedings
of the 10th International Workshop on Distributed Algorithms, volume 1151 of Lecture
Notes in Computer Science, pages 287--303. Springer­Verlag, 1996.

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences