[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Universal Constructions for Large Objects

Published: 01 December 1999 Publication History

Abstract

We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers to explicitly fragment large objects into smaller, more manageable pieces, paying particular attention to how such pieces are copied. In contrast, our constructions are designed to largely shield programmers from this fragmentation. Furthermore, for many objects, our constructions result in lower copying overhead than previous ones. Fragmentation is achieved in our constructions through the use of load-linked, store-conditional, and validate operations on a large multiword shared variable. Before presenting our constructions, we show how these operations can be efficiently implemented from similar one-word primitives.

References

[1]
Y. Afek D. Dauber and D. Touitou, “Wait-free Made Fast,” Proc. 27th Annual ACM Symp. Theory of Computing, pp. 538-547, 1995.
[2]
J. Anderson and M. Moir, “Universal Constructions for Multi-Object Operations,” Proc. 14th Ann. ACM Symp. Principles of Distributed Computing, pp.184-194, 1995.
[3]
J. Anderson and M. Moir, “Universal Constructions for Large Objects,” Proc. Ninth Int'l Workshop on Distributed Algorithms, pp. 168-182, 1995.
[4]
G. Barnes, “A Method for Implementing Lock-Free Shared Data Structures,” Proc. Fifth Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 261-270, 1993.
[5]
C. Filachek, Evaluation and Optimization of Lock-Free and Wait-Free Universal Constructions for Large Objects, master's thesis, Department of Computer Science, Univ. Pittsburgh, 1997.
[6]
M. Herlihy and J. Wing, “Linearizability: A Correctness Condition for Concurrent Objects,” ACM Trans. Programming Languages and Systems, vol. 12, no. 3, pp. 463-492, 1990.
[7]
M. Herlihy, “Wait-Free Synchronization,” ACM Trans. Programming Languages and Systems, vol. 13, no. 1, pp. 124-149, 1991.
[8]
M. Herlihy, “A Methodology for Implementing Highly Concurrent Data Objects,” ACM Trans. Programming Languages and Systems, vol. 15, no. 5, pp. 745-770, 1993.
[9]
A. Israeli and L. Rappoport, “Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives,” Proc. 13th Ann. ACM Symp. Principles of Distributed Computing, ACM, New York, pp. 151-160, Aug. 1994.
[10]
M. Moir, Efficient Object Sharing in Shared-Memory Multiprocessors, Ph. D. thesis, Univ. North Carolina at Chapel Hill, 1996.
[11]
M. Moir, “Practical Implementations of Synchronization Primitives,” Proc. 16th Ann. ACM Symp. Principles of Distributed Computing, pp. 219-228, 1997.
[12]
M. Moir, “Transparent Support for Wait-Free Transactions,” Proc. 11th Ann. Int'l Workshop on Distributed Algorithms, pp. 305-319, 1997.
[13]
N. Shavit and D. Touitou, “Software Transactional Memory,” Proc. 14th Ann. ACM Symp. Principles of Distributed Computing, pp. 204-213, 1995.

Cited By

View all
  • (2020)A wait-free universal construction for large objectsProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374523(102-116)Online publication date: 19-Feb-2020
  • (2020)The RedBlue family of universal constructionsDistributed Computing10.1007/s00446-020-00370-733:6(485-513)Online publication date: 1-Dec-2020
  • (2017)Black-box Concurrent Data Structures for NUMA ArchitecturesACM SIGARCH Computer Architecture News10.1145/3093337.303772145:1(207-221)Online publication date: 4-Apr-2017
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems  Volume 10, Issue 12
December 1999
152 pages
ISSN:1045-9219
Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 December 1999

Author Tags

  1. Concurrency
  2. lock-free
  3. nonblocking synchronization
  4. shared objects
  5. wait-free.

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2020)A wait-free universal construction for large objectsProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374523(102-116)Online publication date: 19-Feb-2020
  • (2020)The RedBlue family of universal constructionsDistributed Computing10.1007/s00446-020-00370-733:6(485-513)Online publication date: 1-Dec-2020
  • (2017)Black-box Concurrent Data Structures for NUMA ArchitecturesACM SIGARCH Computer Architecture News10.1145/3093337.303772145:1(207-221)Online publication date: 4-Apr-2017
  • (2017)Black-box Concurrent Data Structures for NUMA ArchitecturesACM SIGPLAN Notices10.1145/3093336.303772152:4(207-221)Online publication date: 4-Apr-2017
  • (2017)Black-box Concurrent Data Structures for NUMA ArchitecturesProceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3037697.3037721(207-221)Online publication date: 4-Apr-2017
  • (2016)Distributed UniversalityAlgorithmica10.1007/s00453-015-0053-376:2(502-535)Online publication date: 1-Oct-2016
  • (2016)Universal constructions that ensure disjoint-access parallelism and wait-freedomDistributed Computing10.1007/s00446-015-0261-829:4(251-277)Online publication date: 1-Aug-2016
  • (2015)STM-HRTACM Transactions on Embedded Computing Systems10.1145/278697914:4(1-25)Online publication date: 9-Sep-2015
  • (2014)A practical wait-free simulation for lock-free data structuresACM SIGPLAN Notices10.1145/2692916.255526149:8(357-368)Online publication date: 6-Feb-2014
  • (2014)Brief announcementProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611503(206-208)Online publication date: 15-Jul-2014
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media