Yehuda Afek
ABSTRACT
Long-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 collect and snapshot algorithms were adaptive only when the number of local primitive operations that a process performs are ignored, i.e., not counted. The number of primitive local steps (operations that do not access the shared memory) in the collect and snapshot operations presented in [2] is O(Nk3) and O(Nk4) respectively where N is the total number of processes in the system and k is the encountered contention. Here we developed new techniques that enabled us to achieve fully adaptive implementations in which the step complexity (combined local and shared) of any operation is bounded by a function of the number of processes that are concurrent with the operation, in particular, O(k4) for the snapshot implementation.
- 1.Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive shared memory implementations. ftp://ftp.math.tau.ac.il/pub/afek/llshmimp.ps.gz.Google Scholar
- 2.Y. Afek, G. Stupp, and D. Touitou. Long lived adaptive collect with applications. In Proc. of the 4Oth IEEE Ann. Symp. on Foundation of Computer Science, pages 262-272, October 1999. Google ScholarDigital Library
- 3.H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th Annual A CM Syrup. on Principles of Distributed Computing, pages 277-286, June 1998. Extended version available as Technion Computer Science Department Technical Report #0931, April 1998. Google ScholarDigital Library
- 4.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/-~hagit/pubs/tr0956, ps. gz.Google Scholar
- 5.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
- 6.Y. Afek, H. Attiya, A. Fouren, 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.g 1999.Google Scholar
- 7.M. Choy and A. K. Singh. Adaptive solutions to the mutual exclusion problem. In Proc. 12th ACM Symp. on Principles of Distributed Computing, pages 183-194, August 1993. Google ScholarDigital Library
- 8.Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. Journal of the A CM, 40(4):873-890, September 1993. Google ScholarDigital Library
- 9.M. Herlihy. Wait-free synchronization. ACM Trans. on Programming Languages and Systems, 13(1):124-149, January 1991. Google ScholarDigital Library
- 10.E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proc. 12th A CM Syrup. on Principles of Distributed Computing, pages 41-51, August 1993. Google ScholarDigital Library
- 11.J. R. Gilbert, C. B. Moler, and R. Schreiber. Sparse matrices in MATLAB : Design and implementation. SIAM J. Matrix Anal. and Appl., 13(1):333-356, 1992. Google ScholarDigital Library
- 12.E. Gafni and E. Koutsoupias. On uniform protocols. Extended Abstract, November 1998.Google Scholar
- 13.Hagit Attiya and Arie Fouren. An adaptive collect algorithm with applications. Unpublished manuscript, 1999.Google Scholar
- 14.Yehuda Afek and Eytan Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68-105, January 1999. Google ScholarDigital Library
- 15.Elizabeth Borowsky. Capturing the Power of Resiliancy and Set Consensus in Distributed Systems. PhD thesis, University of California, Los Angeles, 1995. Google ScholarDigital Library
Index Terms
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Recommendations
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
PODC '00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computingIn 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 ...
A critique of snapshot isolation
EuroSys '12: Proceedings of the 7th ACM european conference on Computer SystemsThe support for transactions is an essential part of a database management system (DBMS). Without this support, the developers are burdened with ensuring atomic execution of a transaction despite failures as well as concurrent accesses to the database ...
A read-only transaction anomaly under snapshot isolation
Snapshot Isolation (SI), is a multi-version concurrency control algorithm introduced in [BBGMOO95] and later implemented by Oracle. SI avoids many concurrency errors, and it never delays read-only transactions. However it does not guarantee ...
Comments