Nir Shavit
Dan Touitou
- 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. Google Scholar
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. Google ScholarDigital 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. Google ScholarDigital 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. Google ScholarDigital 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. Google ScholarDigital 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. Google ScholarDigital Library
- 7.B.N Bershad. Practical consideration for lock-free concurrent objects. Technical Report, CMU-CS-91-183, Carnegie Mellon University. September 1991.Google Scholar
- 8.E.A. Brewer C.N. Dellarocas, A. Colbrook, and W. E. Weihl. Proteus: A High-Performance Parallel- Architecture Simulator. MITJLCSJTR-516. September 1989. Google ScholarDigital Library
- 9.E.A. Brewer C.N. Dellarocas. Proteus. User Documentation.Google Scholar
- 10.K. Chandy and J. Misra. The Drinking Philosophers Problem. InA CM Transaction on Programming Languages and Systems, 6(4):632-646, October 1984. Google ScholarDigital Library
- 11.T.H. Cormen, C.E. Leiser-Qon and R.L. Rivest. Introduction to algorithms. MIT Press. Google ScholarDigital Library
- 12.DEC. Alpha system reference manual.Google Scholar
- 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. Google Scholar
- 14.M. Herlihy. Wait-Free Synchronization. In A CM Transaction on Programming Languages and Systems, 13(1), pages 124-149, January 1991. Google Scholar
- 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. Google ScholarDigital 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. Google ScholarDigital Library
- 17.IBM. Power PC. Reference manual.Google Scholar
- 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. Google Scholar
- 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. Google ScholarDigital 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. Google ScholarDigital 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. Google ScholarDigital Library
- 22.H. Massalin and C. Pu. A lock-free multiproeessor OS kernel. Technical Report CUCS-005-91. Columbia University. Mars 1991.Google Scholar
- 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. Google ScholarDigital 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. Google ScholarDigital Library
- 25.N. Shavit and A. Zemaeh. Diffracting Trees. In Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA), June 1994. Google ScholarDigital 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. Google ScholarDigital Library
- 27.D. Touitou. Lock-Free Programming: A Thesis Proposal. Tel Aviv University April 1993.Google Scholar
Index Terms
- Software transactional memory
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 programmingTransactional 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 engineeringMulti-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