The complexity of updating multi-writer snapshot objects
Pages 318 - 319
Abstract
This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for partitioned implementations of m-component multi-writer snapshot objects from base objects of any type. These are implementations in which each base object is only modifed by processes performing UPDATE operations to one specific component. In particular, we show that any space-optimal implementation of a multi-writer snapshot object from historyless objects is partitioned. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.
References
[1]
Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. J.ACM, 40(4): 873--890, 1993.
[2]
James H. Anderson. Multi-writer composite registers. Distrib. Comput., 7(4): 175--195, 1994.
[3]
Hagit Attiya and Arie Fouren. Adaptive and efficient algorithms for lattice agreement and renaming, SIAM J. Comput., 31(2): 642--664, 2001.
[4]
Hagit Attiya and Ophir Rachman. Atomic snapshots in O(n log n) operations. SIAM J. Comput., 27(2): 319--340, 1998.
[5]
Panagiota Fatourou, Faith Ellen Fich, and Eric Ruppert. A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots. In Proceedings of the 35th ACM Symposium on Theory of Computing, 259--268, 2003; J. ACM, to appear.
[6]
Faith Fich, Maurice Herlihy, and Nir Shavit. On the Space Complexity of Randomized Synchronization. J. ACM, 45(5): 843--862, 1998.
[7]
Michiko Inoue, Wei Chen, Toshimitsu Masuzawa, and Nobuki Tokura. Linear time snapshots using multi-writer multi-reader registers. In Proceedings of the 8th International Workshop on Distributed Algorithms LNCS 857, 130--140, 1998.
[8]
A. Israeli, A. Shaham, and A. Shirazi. Linear-time snapshot implementations in unbalanced systems. Math. Systems Theory, 28(5): 469--486, 1995.
[9]
Amos Israeli and Assaf Shirazi. The time complexity of updating snapshot memories. Information Processing Letters, 65(1): 33--40, 1998.
[10]
Prasad Jayanti. f-Arrays: Implementation and Applications. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, 270--279, 2002.
[11]
Prasad Jayanti. An Optimal Multi-Writer Snapshot Algorithm. In Proceedings of the 37th ACM Symposium on Theory of Computing, 723--732, 2005.
[12]
Prasad Jayanti, King Tan, and Sam Toueg. Time and space lower bounds for nonblocking implementations. SIAM J. Comput., 30(2): 438--456, 2000.
Index Terms
- The complexity of updating multi-writer snapshot objects
Recommendations
Time lower bounds for implementations of multi-writer snapshots
A snapshot object is an abstraction of the problem of obtaining a consistent view of the contents of shared memory in a distributed system, despite concurrent changes to the memory. There are implementations of m-component snapshot objects shared by n ≥ ...
An optimal multi-writer snapshot algorithm
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computingAn m-component, n-process snapshot object is an abstraction of shared memory that consists of m words and allows up to n processes to concurrently execute the following two types of operations: write(i,v), which writes v into the ith word, and scan(), ...
Single-scanner multi-writer snapshot implementations are fast!
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computingSnapshot objects allow processes to obtain consistent global views of shared memory. A snapshot object consists of m components each capable of storing a value. The processes execute UPDATE operations to write new values in any of the components and ...
Comments
Information & Contributors
Information
Published In
August 2007
424 pages
ISBN:9781595936165
DOI:10.1145/1281100
- General Chair:
- Indranil Gupta,
- Program Chair:
- Rogert Wattenhofer
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 August 2007
Check for updates
Author Tags
Qualifiers
- Article
Conference
PODC07: ACM Symposium on Principles of Distributed Computing 2007
August 12 - 15, 2007
Oregon, Portland, USA
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 169Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in