Language support for lightweight transactions

ACM SIGPLAN Notices

Volumn 38, Issue 11, 2003, Pages 388-402

  Harris, Tim ^a   Fraser, Keir ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Concurrency; Conditional critical regions; Non blocking systems; Transactions

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SOFTWARE; COMPUTER SYSTEM RECOVERY; INFORMATION RETRIEVAL SYSTEMS; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

CONDITIONAL CRITICAL REGIONS; LIGHTWEIGHT TRANSACTIONS; NONBLOCKING SYSTEMS; SOFTWARE TRANSACTIONAL MEMORY;

CONCURRENCY CONTROL;

EID: 1442263994     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/949343.949340     Document Type: Conference Paper

References (27)

1. Adve, S. V., and Gharachorloo, K. Shared memory consistency models: a tutorial. IEEE Computer 29, 12 (Dec. 1996), 66-76.
2. Agesen, O., Detlefs, D., Garthwaite, A., Knippel, R., Ramakrishna, Y. S., and White, D. An efficient meta-lock for implementing ubiquitous synchronization. In Proceedings of Object-Oriented Programming, Systems, Languages & Applications (Nov. 1999), vol. 34(10) of ACM SIGPLAN Notices, pp. 207-222.
3. Andrews, G. R. Concurrent Programming: Principles and Practice. Benjamin/Cummings Publishing Company, Inc., 1991.
4. Bacon, J., and Harris, T. L. Operating Systems: Concurrent and Distributed Software Design, 3rd ed. Addison Wesley, 2003.
5. Brinch Hansen, P. Distributed processes: A concurrent programming concept. Communications of the ACM 21, 11 (Nov. 1978), 934-941.
6. Brinch Hansen, P. Edison - a multiprocessor language. Software - Practice and Experience 11, 4 (Apr. 1981), 325-361.
7. Flanagan, C., and Qadeer, S. Types for atomicity. In Proceedings of the Workshop on Types on Language Design and Implementation (Mar. 2003), vol. 38(3) of ACM SIGPLAN Notices, pp. 1-12.
8. Harris, T. L., Fraser, K., and Pratt, I. A. A practical multi-word compare-and-swap operation. In Proceedings of the 16th International Symposium on Distributed Computing (Oct. 2002), pp. 265-279.
9. Harris, T. L. Design choices for language-based transactions. University of Cambridge Computer Laboratory Tech. Rep., Aug. 2003.
10. Hennessy, J. L., and Patterson, D. A. Computer Architecture - A Quantitative Approach, 3rd ed. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2003.
11. Herlihy, M., Luchangco, V., Moir, M., and Scherer, W. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (July 2003), pp. 92-101.
12. Herlihy, M., Luchangco, V., and Moir, M. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems (2003).
13. Herlihy, M., Luchangco, V., and Moir, M. The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures. In Proceedings of the 16th International Symposium on Distributed Computing (Oct. 2002), pp. 339-353.
14. Herlihy, M., and Moss, J. E. B. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture (May 1993), IEEE Computer Society Press, pp. 289-301.
15. Hoare, C. A. R. Towards a theory of parallel programming. In Operating Systems Techniques (1972), vol. 9 of A.P.I.C. Studies in Data Processing, Academic Press pp. 61-71.
16. Liang, S., and Bracha, G. Dynamic class loading in the Java Virtual Machine. In Proceedings of Object-Oriented Programming, Systems, Languages & Applications (Oct. 1998), vol. 33(10) of ACM SIGPLAN Notices, pp. 36-44.
17. Lindholm, T., and Yellin, F. The Java Virtual Machine Specification, 2nd ed. Addison-Wesley, Reading, MA, USA, 1999.
18. Liskov, B., and Scheifler, R. Guardians and actions: linguistic support for robust, distributed programs. ACM Transactions on Programming Languages and Systems 5, 3 (July 1983), 381-404.
19. Lomet, D. B. Process structuring, synchronization and recovery using atomic actions Proceedings of an ACM Conference on Language Design for Reliable Software (Mar. 1977), 128-137.
20. Manson, J., and Pugh, W. Semantics of multithreaded Java. Tech. Rep. UCMP-CS-4215, Department of Computer Science, University of Maryland, College Park, Jan. 2002.
21. Michael, M. M. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (July 2002), ACM Press, pp. 21-30.
22. Michael, M. M., and Scott, M. L. Correction of a memory management method for lock-free data structures. Tech. Rep. TR599, University of Rochester, Computer Science Department, Dec. 1995.
23. Moir, M. Transparent support for wait-free transactions. In Proceedings of the 11th International Workshop on Distributed Algorithms (Sept. 1997), vol. 1320 of Lecture Notes in Computer Science, Springer-Verlag, pp. 305-319.
24. Platt, D. S. Introducing Microsoft .NET, 2nd ed. Microsoft Press, 2002.
25. Schmid, H. A. On the efficient implementation of conditional critical regions and the construction of monitors. Acta Informatica 6, 3 (Aug. 1976), 227-249.
26. Scott, M. L. Language support for loosely coupled distributed programs. IEEE Transactions on Software Engineering SE-13, 1 (Jan. 1987), 88-103.
27. Shavit, N., and Touitou, D. Software transactional memory. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (Aug. 1995), ACM Press, pp. 204-213.