Long-lived renaming made fast. (English) Zbl 1373.68080
Proceedings of the 14th annual ACM symposium on principles of distributed computing, PODC ’95, Ottawa, Canada, August 20–23, 1995. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-710-3). 194-203 (1995).
For the entire collection see [Zbl 1323.68007].
MSC:
| 68M14 | Distributed systems |
| 68M15 | Reliability, testing and fault tolerance of networks and computer systems |
References:
| [1] | ATTIYA, H., BAR-NOY, A., DOLEV, D., PELEG, D., AND REISCHUK, R. Renaming in an asynchronous environment. Journal of the A CM 37, 3 (1990), 524-548. 10.1145/79147.79158 · Zbl 0699.68034 |
| [2] | ANDERSON, j. H., AND MOIR, M. Using k-exclusion to implement resilient, scalable shared objects, in 13th Ann. Symp. on Principles of Distributed Computing (Los Angeles, CA, USA, 1994), pp. 141-150. 10.1145/197917.198073 · Zbl 1373.68069 |
| [3] | BOROWSKY, E., AND GAFNI, E. Immediate atomic snapshots and fast renaming. In 12th Ann. Syrup. on Principles of Distributed Computing (Ithaca, N.Y., USA, 1993), pp. 41-51. 10.1145/164051.164056 · Zbl 1373.68078 |
| [4] | H. BUHRMAN, L. LONGPRfi, AND E. SPAAN. Sparse reduces conjunctively to tally. In 8th Ann. Conf. Structure in Complexity Theory, (San Diego, CA, USA, 1993), pp. 208-214. To appear in SIAM journal on Computing 1995. 10.1137/0224044 |
| [5] | BAR-No’f, A., AND DOLBV, D. Shared memory versus message-passing in an asynchronous distributed environment. In 8th Ann. Syrup. on Principles of Distributed Computing (Edmonton, Alberta, Canada, 1989), pp. 307-318. 10.1145/72981.73003 |
| [6] | BAR-NoY, A., DoLgv, D., KOLLEa, D., AND PELEG, D. Fault-tolerant critical section management in asynchronous environments. Information and Computation 95, 1 (1991), 1-20. 10.1016/0890-5401(91)90014-S · Zbl 0738.68001 |
| [7] | CHEBYSHEV, L. M moire sur les nombres premiers. Journal de Math. 17 (1852), 366-390. |
| [8] | COHN, P. M. Algebra Volume 1. John Wiley & Sons, 1974. |
| [9] | ERDSS, P., FaANKL, P., AND F/JaEDI, Z. Families of finite sets in which no set is covered by the union of r others. Israel Journal o/Mathematics 51, 1-2 (1985), 79-89. · Zbl 0587.05021 |
| [10] | HERLIHY, M., AND SHAWT, N. The asynchronous computability theorem for tresilient tasks. In 25th Ann. Syrup. on Theory of Computing (San Diego, CA, USA, 1993), pp. 111-120. 10.1145/167088.167125 · Zbl 1310.68079 |
| [11] | MoIa, M., AND ANDERSON, J. H. Fast, long-lived renaming. In 8th Int. Workshop on Distributed Algorithms (Terschelling, The Netherlands, 1994), pp. 141-155. To appear in Science of Computer Programming. |
| [12] | PBTERSON, G. L., AND FISCHEa, M. J. Economical solutions for the critical section problem in a distributed system. In 9th Ann. Syrup. on Theory of Computing (Boulder, Colorado, USA, 1977). 10.1145/800105.803398 |
| [13] | PANCONESI, A., PAPATRIANTArILOU, M., TSIGAS, P., AND VITiNYI, P. M. B. Randomized wait-free distributed naming. In 5th Int. Syrup. on Algorithms and Computation (Beijing, China, 1994), pp. 83-91. · Zbl 0953.68573 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
