Polynominal and Adaptive Long-Lived (2k-1)-Renaming
暂无分享,去创建一个
[1] Hagit Attiya,et al. Renaming in an asynchronous environment , 1990, JACM.
[2] Hagit Attiya,et al. An adaptive collect algorithm with applications , 2002, Distributed Computing.
[3] Hagit Attiya,et al. Adaptive Long-Lived Renaming with Read and Write Operations , 1999 .
[4] Mark Moir,et al. Fast, Long-Lived Renaming Improved and Simplified , 1996, WDAG.
[5] Maurice Herlihy,et al. A simple constructive computability theorem for wait-free computation , 1994, STOC '94.
[6] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.
[7] Leslie Lamport,et al. A fast mutual exclusion algorithm , 1987, TOCS.
[8] Yehuda Afek,et al. Fast, wait-free (2k-1)-renaming , 1999, PODC '99.
[9] Gary L. Peterson,et al. The ambiguity of choosing , 1989, PODC '89.
[10] Eli Gafni,et al. Immediate atomic snapshots and fast renaming , 1993, PODC '93.
[11] Hagit Attiya,et al. Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) , 1998, PODC '98.
[12] Nancy A. Lynch,et al. The BG distributed simulation algorithm , 2001, Distributed Computing.
[13] Yehuda Afek,et al. Long-lived adaptive collect with applications , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[14] Mark Moir,et al. Fast, long-lived renaming improved and simplified , 1996, PODC '96.
[15] Mark Moir,et al. Long-lived renaming made fast , 1995, PODC '95.
[16] Mark Moir,et al. Wait-Free Algorithms for Fast, Long-Lived Renaming , 1995, Sci. Comput. Program..
[17] Hagit Attiya,et al. Adaptive long-lived renaming using bounded memory , 1999 .
[18] Yehuda Afek,et al. Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract) , 2000, PODC '00.
[19] Hagit Attiya,et al. Long-lived renaming made adaptive , 1999, PODC '99.