Article

Free access

Software transactional memory

Authors:

Dan TouitouAuthors Info & Claims

PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

Pages 204 - 213

https://doi.org/10.1145/224964.224987

Published: 20 August 1995 Publication History

First page of PDF

References

[1]

A. Agarwal et al. The MIT Alewife Machine: A Large- Scale DistributedoMemory Multiprocessor. In Proceedings of Workshop on Scalable Shared Memory Multiprocessors. Kluwer Academic Publishers, 1991. An extended version of this paper has been submitted for publication, and appears as MiT/LCS Memo TM-454, 1991.

Digital Library

[2]

R. J. Anderson. Primitives for Asynchronous List Compression. Proceeding of the dth A CM Symposium on Parallel Algorithms and Architectures, pages 199-208, 1992.

Digital Library

[3]

T.E. Anderson. The performance of spin lock alternatives for shared memory multiprocessors. In IEEE Transaction on Parallel and Distributed Systems, 1(1):6-16, January 1990.

Digital Library

[4]

J. Alemany, E.W. Felten Performance issues in Non- Blocking Synchronization on Shared-Memory Multiprocessors. In Proceedings o/11th A CM Symposium on Principles of Distributed Computation, Pages 1~5-13~ August 1992.

Digital Library

[5]

J. Aspnes, M.P. I-Ierlihy, and N. Shavit. Counting Networks. Journal o/the A CM, Vol. 41, No. 5 (September 1994), pp. 1020-1048.

Digital Library

[6]

G. Barnes A Method for Implementing Lock-Free Shared Data Structures In Proceedings o/the 5th A CM Symposium on Parallel Algorithms and Architectures 1993.

Digital Library

[7]

B.N Bershad. Practical consideration for lock-free concurrent objects. Technical Report, CMU-CS-91-183, Carnegie Mellon University. September 1991.

[8]

E.A. Brewer C.N. Dellarocas, A. Colbrook, and W. E. Weihl. Proteus: A High-Performance Parallel- Architecture Simulator. MITJLCSJTR-516. September 1989.

Digital Library

[9]

E.A. Brewer C.N. Dellarocas. Proteus. User Documentation.

[10]

K. Chandy and J. Misra. The Drinking Philosophers Problem. InA CM Transaction on Programming Languages and Systems, 6(4):632-646, October 1984.

Digital Library

[11]

T.H. Cormen, C.E. Leiser-Qon and R.L. Rivest. Introduction to algorithms. MIT Press.

Digital Library

[12]

DEC. Alpha system reference manual.

[13]

M. Herlihy and J,M. Wing. Linearizability: A correctness condition for concurrent objects. In A CM Transaction on Programming Languages and Systems, 12(3), pages 463-492, July 1990.

[14]

M. Herlihy. Wait-Free Synchronization. In A CM Transaction on Programming Languages and Systems, 13(1), pages 124-149, January 1991.

[15]

M. Herlihy. A methodology for implementing highly concurrent data objects. A CM Transactions on Programming Languages and Systems, 15(9): 745-770, November 1993.

Digital Library

[16]

M. Herlihy and J.E B. Moss. Transactional Memory: Architectural Support for Lock-Free Data Structures. in ~Oth Annual Symposium on Computer Architecture, pages 289-300, May 1993.

Digital Library

[17]

IBM. Power PC. Reference manual.

[18]

A. Israeli and L. Rappoport. Efficient Wait Free Implementation of a Concurrent Priority Queue. In WDA G 1993. Lecture Notes in Computer Science 7~5, Springer Verlag, pages 1-17.

[19]

A. Israeli and L. Rappoport. Disjoint-Access-Parallel Implementations of Strong Shared Memory Proc. of the 13th ACM Symposium on Principles of Distributed Computing pages 151-160.

Digital Library

[20]

A. LaMarca. A Performance Evaluation of Lock-Free Synchronization Protocols. Proc. of the 13th A CM Symposium on Principles of Distributed Computing, pages 130-140.

Digital Library

[21]

N. Lynch and M. Tuttle. Hierachical Correctness Proofs for Distributed Algorithm. In Proceedings of 6th A CM Symposium on Principles of Distributed Computation, Pages 187-151 August 1987.

Digital Library

[22]

H. Massalin and C. Pu. A lock-free multiproeessor OS kernel. Technical Report CUCS-005-91. Columbia University. Mars 1991.

[23]

J.M. Mellor-Crummey and M.L. Scott Synchronization without Contention. In Proceedings of the dth International Conference on Architecture Support for Programming Languages and Operating Systems, April 1991.

Digital Library

[24]

L. Rudolph, M. Slivkin, and E. Upfal. A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. In Proceedings of the 3rd A CM Symposium on Parallel Algorithms and Architectures, pages 237-245, July 1991.

Digital Library

[25]

N. Shavit and A. Zemaeh. Diffracting Trees. In Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA), June 1994.

Digital Library

[26]

J. Turek D. Shasha and S. Prakash. Locking without blocking: Making Lock Based Concurrent Data Structure Algorithms Non-blocking. In Proceedings of the 1992 Principle of Database Systems pages 212-222.

Digital Library

[27]

D. Touitou. Lock-Free Programming: A Thesis Proposal. Tel Aviv University April 1993.

Cited By

Bencivenga DGiakkoupis GWoelfel PKuznetsov PGelles ROlivetti D(2024)Faster Randomized Repeated Choice and DCASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662828(454-464)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662828
Naderi-Semiromi FWoelfel PKuznetsov PGelles ROlivetti D(2024)Strongly Linearizable LL/SC from CASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662800(443-453)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662800
Khalaji MBrown TDaudjee KAksenov VLee IChabbi MSteuwer M(2024)Practical Hardware Transactional vEB TreesProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638504(215-228)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638504
Show More Cited By

Recommendations

Time-Based Software Transactional Memory

Software transactional memory (STM) is a concurrency control mechanism that is widely considered to be easier to use by programmers than other mechanisms such as locking. The first generations of STMs have either relied on visible read designs, which ...
Open nesting in software transactional memory
PPoPP '07: Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming

Transactional memory (TM) promises to simplify concurrent programming while providing scalability competitive to fine-grained locking. Language-based constructs allow programmers to denote atomic regions declaratively and to rely on the underlying ...
Transactional memory: from semantics to silicon
IWMSE '08: Proceedings of the 1st international workshop on Multicore software engineering

Multi-core architectures bring parallel programming into the mainstream. Parallel programming poses many new challenges to the developer, one of which is synchronizing concurrent access to shared memory by multiple threads. Programmers have ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

August 1995

284 pages

ISBN:0897917103

DOI:10.1145/224964

Chairman:
James Anderson
Univ. of North Carolina at Chapel Hill

Copyright © 1995 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: 20 August 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC95

Sponsor:

PODC95: 14th Annual ACM Symposium on Principles of Distributed Computing

August 20 - 23, 1995

Ontario, Ottowa, Canada

Acceptance Rates

PODC '95 Paper Acceptance Rate 49 of 132 submissions, 37%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

866
Total Citations
View Citations
10,797
Total Downloads

Downloads (Last 12 months)421
Downloads (Last 6 weeks)76

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bencivenga DGiakkoupis GWoelfel PKuznetsov PGelles ROlivetti D(2024)Faster Randomized Repeated Choice and DCASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662828(454-464)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662828
Naderi-Semiromi FWoelfel PKuznetsov PGelles ROlivetti D(2024)Strongly Linearizable LL/SC from CASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662800(443-453)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662800
Khalaji MBrown TDaudjee KAksenov VLee IChabbi MSteuwer M(2024)Practical Hardware Transactional vEB TreesProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638504(215-228)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638504
Abdi JPosluns GZhang GWang BJeffrey MAgrawal KPetrank E(2024)When Is Parallelism Fearless and Zero-Cost with Rust?Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659966(27-40)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659966
Quislant RGutierrez EPlata O(2024)Exploring Multiprocessor Approaches to Time Series AnalysisJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.104855(104855)Online publication date: Feb-2024
https://doi.org/10.1016/j.jpdc.2024.104855
Li TChandramouli BMadden S(2024)Performant almost-latch-free data structures using epoch protection in more depthThe VLDB Journal10.1007/s00778-024-00859-833:6(1793-1812)Online publication date: 17-Jun-2024
https://doi.org/10.1007/s00778-024-00859-8
Popovic MPopovic MKordic BZhu H(2023)Complete formal verification of the PSTM transaction SchedulerComputer Science and Information Systems10.2298/CSIS210908058P20:1(307-327)Online publication date: 2023
https://doi.org/10.2298/CSIS210908058P
Paulino HAlmeida Matos ACederquist JGiunti MMatos JRavara A(2023)AtomiS: Data-Centric Synchronization Made PracticalProceedings of the ACM on Programming Languages10.1145/36228017:OOPSLA2(116-145)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622801
Elsman MHenriksen T(2023)Parallelism in a Region Inference ContextProceedings of the ACM on Programming Languages10.1145/35912567:PLDI(884-906)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591256
Gonnord LHenrio LMorel LRadanne G(2023)A Survey on Parallelism and DeterminismACM Computing Surveys10.1145/356452955:10(1-28)Online publication date: 2-Feb-2023
https://dl.acm.org/doi/10.1145/3564529
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents