Yehuda Afek
ABSTRACT
In this paper we prove: For any constant d there is a large enough n such that there is no long-lived adaptive implementation of collect or renaming in the read write model with n processes that uses d or less MWMR registers.
In other words, there is no implementation of a long-lived and adaptive renaming or collect object in the atomic read/write model that uses O(1) multi-writer-multi-reader registers and any number of single-writer-multi-reader registers. In 1980 Burns and Lynch [1] proved that at least n multi-writer-multi-reader (MWMR) registers are necessary in any mutual exclusion algorithm that uses only MWMR registers (i.e., atomic registers). It is also relatively easy to see that any adaptive non-trivial algorithm uses at least one multi-writer-multi-reader (MWMR) register even when there are n single-writer-multi-reader (SWMR) registers. Here we extend the techniques of Burns and Lynch and prove that adaptive algorithms that use both SWMR and MWMR registers such as, collect and renaming, need in addition to the Ω(n) SWMR registers a non-constant, F(n) number of MWMR registers.
- 1.James E. Burns and Nancy A. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993. Google Scholar
Digital Library
- 2.H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report 0956, Faculty of Computer Science, Technion, Haifa, 1999. http://www, cs. t echnion, ac. il/,~ h agit/pubs/ tr0956.ps.gz.Google Scholar
- 3.Y. Afek, G. Stupp, and D. Touitou. Long lived adaptive collect with applications. In Proc. of the 4Oth IEEE Ann. Syrup. on Foundation of Computer Science, pages 262-272, October 1999. Google ScholarDigital Library
- 4.Y. Afek, H. Attiya, G. Stupp, and D. Touitou. Adaptive long-lived renaming using bounded memory. Submitted to DISC99. ftp://ftp.math.tau.ac.il/pub/stupp/PAPERS/ name99.ps.gz, 1999.Google Scholar
- 5.James H. Anderson and Jae-Heon Yang. Time/contention trade-offs for multiprocessor synchronization. Information and Computation, 124(1):68-84, 10 January 1996. Also in STOC94, 224-233. Google ScholarDigital Library
- 6.Y. Afek, E. Gafni, and M. Merritt. Adaptive algorithms utilyzing adaptive collect and snapshot. Submitted for publication, ftp://ftp.math.tau.ac.il/pub/afek/lshotRn.ps, 1999.Google Scholar
- 7.Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived & adaptive objects. Draft of full paper, ftp://ftp.math.tau.ac.il/ pub/afek/abt.ps.Google Scholar
- 8.H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Extended Abstract, November 1998.Google Scholar
- 9.Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proc. 18th Annual A CM Syrup. on Principles of Distributed Computing, pages 91-103, May 1999. Google ScholarDigital Library
- 10.L. Lamport. A fast mutual exclusion algorithms. A CM Trans. on Computer Systems, 5(1):1-11, February 1987. Google ScholarDigital Library
- 11.M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1):1-39, October 1995. Also in Proc. 8th Int. Workshop on Distributed Algorithms, September 1994, 141-155. Google ScholarDigital Library
Index Terms
- Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
Recommendations
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
PODC '00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computingLong-lived and adaptive to point contention implementations of snapshot and immediate snapshot objects in the read/write shared-memory model are presented. In [2] we presented adaptive algorithms for mutual exclusion, collect and snapshot. However, the ...
Long-Lived Adaptive Collect with Applications
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer ScienceA distributed algorithm is adaptive if the worst case step complexity of its operations is bounded by a function of the number of processes that are concurrently active during the operation (rather than a function of N, the total number of processes, ...
Comments