Concurrent programming without locks

ACM Transactions on Computer Systems

Volumn 25, Issue 2, 2007, Pages

  Fraser, Keir ^a   Harris, Tim ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Concurrency; Lock free systems; Transactional memory

Indexed keywords

LOCK FREE SYSTEMS; MEMORY LOCATIONS; NONBLOCKING SYSTEMS; OBJECT-BASED SOFTWARE TRANSACTIONAL MEMORY (OSTM); TRANSACTIONAL MEMORY;

COMPUTER SYSTEM RECOVERY; CONCURRENCY CONTROL; CONCURRENT ENGINEERING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS);

COMPUTER PROGRAMMING;

EID: 34249721556     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/1233307.1233309     Document Type: Article

References (54)

1. ANANIAN, C. S., ASANOVIĆ, K., KUSZMAUL, B. C., LEISERSON, C. E., AND LIE, S. 2005. Unbounded transactional memory. In Proceedings of the 11th International Symposium on High-Performance Computer Architecture (HPCA). (San Franscisco, CA). 316-327.
2. ANDERSON, J. H. AND MOIR, M. 1995. Universal constructions for multi-object operations. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC). 184-193.
3. ANDERSON, J. H., RAMAMURTHY, S., AND JAIN, R. 1997. Implementing wait-free objects on priority-based systems. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC). 229-238.
4. BARNES, G. 1993. A method for implementing lock-free data structures. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures. 261-270.
5. DICE, D., SHALEV, O., AND SHAVIT, N. 2006. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing (DISC).
6. FICH, F., LUCHANGCO, V., MOIR, M., AND SHAVIT, N. 2005. Obstruction-Free algorithms can be practically wait-free, In Distributed Algorithms, P. Fraigniaud, Ed. Lecture Notes in Computer Science, vol. 3724. Springer Verlag, Berlin. 78-92.
7. FRASER, K. 2003. Practical lock freedom. Ph.D. thesis, Computer Laboratory, University of Cambridge. Also available as Tech. Rep. UCAM-CL-TR-639, Cambridge University.
8. GREENWALD, M. 1999. Non-Blocking synchronization and system design. Ph.D. thesis, Stanford University. Also available as Technical Rep. STAN-CS-TR-99-1624, Stanford University, Computer Science Department.
9. GREENWALD, M. 2002. Two-Handed emulation: How to build non-blocking implementations of complex data structures using DCAS. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC). 260-269.
10. HAMMOND, L., CARLSTROM, B. D., WONG, V., HERTZBERG, B., CHEN, M., KOZYRAKIS, C., AND OLUKOTUN, K. 2004. Programming with transactional coherence and consistency (TCC). In Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM Press, New York. 1-13.
11. HANKE, S. 1999. The performance of concurrent red-black tree algorithms. In Proceedings of the 3rd Workshop on Algorithm Engineering. Lecture Notes in Computer Science, vol. 1668. Springer Verlag, Berlin. 287-301.
12. HANKE, S., OTTMANN, T., AND SOISALON-SOININEN, E. 1997. Relaxed balanced red-black trees. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 1203. Springer Verlag, Berlin. 193-204.
13. HARRIS, T. 2001. A pragmatic implementation of non-blocking linked lists. In Proceedings of the 15th International Symposium on Distributed Computing (DISC), Springer Verlag, Berlin. 300-314.
14. HARRIS, T. 2004. Exceptions and side-effects in atomic blocks. In Proceedings of the PODC Workshop on Synchronization in Java Programs. 46-53. Proceedings published as Memorial University of Newfoundland CS Tech. Rep. 2004-01.
15. HARRIS, T. AND FRASER, K. 2003. Language support for lightweight transactions. In Proceedings of the 18th Annual ACM-SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). 388-402.
16. HARRIS, T. AND FRASER, K. 2005. Revocable locks for non-blocking programming. In Proceedings of the 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). ACM Press, New York. USA, 72-82.
17. HARRIS, T., MARLOW, S., PEYTON-JONES, S., AND HERLIHY, M. 2005. Composable memory transactions. In Proceedings of the 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). ACM Press, New York. 48-60.
18. HELLER, S., HERLIHY, M., LUCHANGCO, V., MOIR, M., SCHERER, B., AND SHAVIT, N. 2005. A lazy concurrent list-based set algorithm. In 9th International Conference on Principles of Distributed Systems (OPODIS).
19. HENNESSY, J. L. AND PATTERSON, D. A. 2003. Computer Architecture - A Quantitative Approach, 3rd ed. Morgan Kaufmann, San Francisco, CA.
20. HERLIHY, M. 1993. A methodology for implementing highly concurrent data objects. ACM Trans. Program. Lang. Syst. 15, 5 (Nov.), 745-770.
21. HEHLIHY, M. 2005. SXM1.1: Software transactional memory package for C#. Tech. Rep., Brown University and Microsoft Research. May.
22. HERLIHY, M., LUCHANGCO, V., MARTIN, P., AND MOIR, M. 2005. Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23, 2, 146-196.
23. HERLIHY, M., LUCHANGCO, V., AND MOIR, M. 2003. Obstruction-Free synchronization: Double-Ended queues as an example. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, Los Alamitos, CA. 522-529.
24. HERLIHY, M., LUCHANGCO, V., MOIR, M., AND SCHERER, W. 2003b. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC). 92-101.
25. HERLIHY, M. AND MOSS, J. E. B. 1993. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture (ISCA). ACM Press, New York. 289-301.
26. HERLIHY, M. AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (Jul.), 463-492.
27. HOARE, C. A. R. 1972. Towards a theory of parallel programming. In Operating Systems Techniques. A.P.I.C. Studies in Data Processing, vol. 9. Academic Press, 61-71.
28. ISRAELI, A. AND RAPPOPORT, L. 1994. Disjoint-Access-Parallel implementations of strong shared memory primitives. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC). 151-160.
29. JAYANTI, P. AND PETROVIC, S. 2003. Efficient and practical constructions of LL/SC variables. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, ACM Press, 285-294.
30. JONES, R. AND LINS, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons.
31. RUNG, H. T. AND LEHMAN, P. L. 1980. Concurrent manipulation of binary search trees. ACM Trans. Database Syst. 5, 3 (Sept.), 354-382.
32. KUNG, H. T. AND ROBINSON, J. T. 1981. On optimistic methods for concurrency control. ACM Trans. Database Syst. 6, 2, 213-226.
33. MARATHE, V. J., SCHERER III, W. N., AND SCOTT, M. L. 2004. Design tradeoffs in modem software transactional memory systems. In Proceedings of the 7th Workshop on Languages, Compilers, and Run-Time Support for Scalable Systems.
34. MCDONALD, A., CHUNG, J., CHAFI, H., CAO MINH, C., CARLSTROM, B. D., HAMMOND, L., KOZYRAKIS, C., AND OLUKOTUN, K. 2005. Characterization of TCC on chip-multiprocessors. In Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques.
35. MELLOR-CRUMMEY, J. AND SCOTT, M. 1991a. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9, 1, 21-65.
36. MELLOR-CRUMMEY, J. AND SCOTT, M. 1991b. Scalable reader-writer synchronization for shared-memory multiprocessors. In Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 106-113.
37. MICHAEL, M. M. 2002. 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 (PODC).
38. MICHAEL, M. M. AND SCOTT, M. 1995. Correction of a memory management method for lock-free data structures. Tech. Rep. TR599, University of Rochester, Computer Science Department. December.
39. MOM, M. 1997. Transparent support for wait-free transactions, In Distributed Algorithms, 11th International Workshop. Lecture Notes in Computer Science, vol. 1820. Springer Verlag, Berlin. 305-319.
40. MOIR, M. 2002. Personal communication.
41. MOORE, K. E., HILL, M. D., AND WOOD, D. A. 2005. Thread-Level transactional memory. Tech. Rep.: CS-TR-2005-1524, Deptartment of Computer Sciences, University of Wisconsin, Motorola Inc., Phoenix, AZ. 1-11.
42. MOTOROLA. 1985. MC68020 32-Bit Microprocessor User's Manual.
43. PUGH, W. 1990. Concurrent maintenance of skip lists. Tech. Rep. CS-TR-2222, Department of Computer Science, University of Maryland. June.
44. RAJWAR, R. AND GOODMAN, J. R. 2002. Transactional lock-free execution of lock-based programs. ACM SIGPLAN Not. 37, 10 (Oct.), 5-17.
45. RAJWAR, R., HERLIHY, M., AND LAI, K. 2005. Virtualizing transactional memory. In Proceedings of the 32nd Annual International Symposium on Computer Architecture. IEEE Computer Society, Los Alamotos, CA. 494-505.
46. RIEGEL, T., FELBER, P., AND FETZER, C. 2006. A lazy snapshot algorithm with eager validation. In Proceedings of the 20th International Symposium on Distributed Computing (DISC),
47. RINGENBURG, M. F. AND GROSSMAN, D. 2005. AtomCaml: First-Class atomicity via rollback. In Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming (ICFP). ACM Press, New York. 92-104.
48. SCHERER III, W. N. AND SCOTT, M. L. 2005. Advanced contention management for dynamic software transactional memory. In Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. ACM Press, New York. 240-248.
49. SHALEV, O. AND SHAVIT, N. 2003. Split-ordered lists: Lock-Free extensible hash tables. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC). 102-111.
50. SHAVIT, N. AND TOUITOU, D. 1995. Software transactional memory. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC). 204-213.
51. SUNDELL, H. AND TSIGAS, P. 2004. Scalable and lock-free concurrent dictionaries. In Proceedings of the ACM Symposium on Applied Computing. ACM Press, New York, NY. 1438-1445.
52. TUREK, J., SHASHA, D., AND PRAKASH, S. 1992. Locking without blocking: Making lock-based concurrent data structure algorithms nonblocking. In Proceedings of the 11th ACM Symposium on Principles of Database Systems. 212-222.
53. WELC, A., JAGANNATHAN, S., AND HOSKING, T. 2004. Transactional monitors for concurrent objects. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP). 519-542.
54. WING, J. M. AND GONG, C. 1993. Testing and verifying concurrent objects. J. Parallel Distrib. Comput. 17, 1 (Jan.), 164-182.