Automatic fine-grain locking using shape properties

ACM SIGPLAN Notices

Volumn 46, Issue 10, 2011, Pages 225-241

  Golan Gueta, Guy ^a   Bronson, Nathan ^b   Aiken, Alex ^b   Ramalingam, G ^c   Sagiv, Mooly ^a   Yahav, Eran ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b STANFORD UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Atomicity; Concurrency; Locking Protocol; Reduction; Serializability; Synthesis

Indexed keywords

ATOMICITY; AUTOMATIC TECHNIQUE; CONCURRENCY; LOCKING PROTOCOLS; OBJECT ORIENTED SOFTWARE; SERIALIZABILITY; SHAPE PROPERTY;

DATA STRUCTURES; FORESTRY; REDUCTION; SYNTHESIS (CHEMICAL);

CONCURRENCY CONTROL;

ALGORITHMS; DATA BASES; FORESTRY; REDUCTION; SYNTHESIS;

EID: 84858331404     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2076021.2048086     Document Type: Conference Paper

References (40)

1. AGRAWAL, R., MANNILA, H., SRIKANT, R., TOIVONEN, H., AND VERKAMO, I. Advances in knowledge discovery and data mining. American Association for Artificial Intelligence, Menlo Park, CA, USA, 1996, ch. Fast discovery of association rules, pp. 307-328.
2. AHO, A. V., LAM, M. S., SETHI, R., AND ULLMAN, J. D. Compilers: Principles, Techniques, and Tools (2nd Edition). Addison Wesley, 2006.
3. ARAGON, C., AND SEIDEL, R. Randomized search trees. Foundations of Computer Science, Annual IEEE Symposium on 0 (1989), 540-545.
4. ATTIYA, H., RAMALINGAM, G., AND RINETZKY, N. Sequential verification of serializability. In POPL '10: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (New York, NY, USA, 2010), ACM, pp. 31-42.
5. BARNES, J., AND HUT, P. A hierarchical O(N log N) forcecalculation algorithm. Nature 324 (Dec. 1986), 446-449.
6. BAYER, R., AND SCHKOLNICK, M. Concurrency of operations on B-Trees. Acta Informatica 9 (1977), 1-21.
7. BOYAPATI, C., LEE, R., AND RINARD, M. Ownership types for safe programming: preventing data races and deadlocks. In Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (New York, NY, USA, 2002), OOPSLA '02, ACM, pp. 211-230.
8. BRASS, P. Advanced Data Structures. Cambridge University Press, New York, NY, USA, 2008.
9. BRONSON, N. G., CASPER, J., CHAFI, H., AND OLUKOTUN, K. A practical concurrent binary search tree. In PPOPP (2010), pp. 257-268.
10. CHAUDHRI, V. K., AND HADZILACOS, V. Safe locking policies for dynamic databases. In PODS '95: Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (New York, NY, USA, 1995), ACM, pp. 233-244.
11. CHEREM, S., CHILIMBI, T., AND GULWANI, S. Inferring locks for atomic sections. In PLDI (2008), pp. 304-315.
12. CUNNINGHAM, D., GUDKA, K., AND EISENBACH, S. Keep off the grass: Locking the right path for atomicity. In Compiler Construction, vol. 4959 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2008, pp. 276-290.
13. DEUTSCH, L. P., AND BOBROW, D. G. An efficient, incremental, automatic garbage collector. Commun. ACM 19, 9 (1976), 522-526.
14. DICE, D., SHALEV, O., AND SHAVIT, N. Transactional locking ii. In DISC (2006), pp. 194-208. (Pubitemid 44849711)
15. EMMI, M., FISCHER, J. S., JHALA, R., AND MAJUMDAR, R. Lock allocation. In POPL (2007), pp. 291-296.
16. ESWARAN, K. P., GRAY, J. N., LORIE, R. A., AND TRAIGER, I. L. The notions of consistency and predicate locks in a database system. Commun. ACM 19 (November 1976), 624-633.
17. GUDKA, K., EISENBACH, S., AND HARRIS, T. Lock Inference in the Presence of Large Libraries. Tech. rep., November 2010.
18. GUIBAS, L. J., AND SEDGEWICK, R. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science (Washington, DC, USA, 1978), IEEE Computer Society, pp. 8-21.
19. HARRIS, T., LARUS, J., AND RAJWAR, R. Transactional memory, 2nd edition. Synthesis Lectures on Computer Architecture 5, 1 (2010), 1-263.
20. HERLIHY, M., LEV, Y., LUCHANGCO, V., AND SHAVIT, N. A provably correct scalable concurrent skip list. In OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems (December 2006).
21. HERLIHY, M., LUCHANGCO, V., MOIR, M., AND III, W. N. S. Software transactional memory for dynamic-sized data structures. In PODC (2003), pp. 92-101.
22. HERLIHY, M., AND MOSS, J. E. B. Transactional memory: Architectural support for lock-free data structures. In ISCA (1993), pp. 289-300. (Pubitemid 23675551)
23. HERLIHY, M. P., AND WING, J. M. Linearizability: a correctness condition for concurrent objects. Proc. of ACM TOPLAS 12, 3 (1990), 463-492.
24. HICKS, M., FOSTER, J. S., AND PRATTIKAKIS, P. Lock inference for atomic sections. In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006).
25. KEDEM, Z. M., AND SILBERSCHATZ, A. A characterization of database graphs admitting a simple locking protocol. Acta Inf. 16 (1981), 1-13. (Pubitemid 12520186)
26. LANIN, V., AND SHASHA, D. Tree locking on changing trees. Tech. rep., 1990.
27. LEV-AMI, T., AND SAGIV, M. TVLA: A framework for Kleene based static analysis. In Saskatchewan (2000), vol. 1824 of Lecture Notes in Computer Science, Springer- Verlag, pp. 280-301.
28. LEVANONI, Y., AND PETRANK, E. An on-the-fly referencecounting garbage collector for Java. ACM Trans. Program. Lang. Syst. 28, 1 (2006), 1-69.
29. MCCLOSKEY, B., ZHOU, F., GAY, D., AND BREWER, E. Autolocker: synchronization inference for atomic sections. In POPL '06: Conference record of the 33rd ACM SIGPLANSIGACT symposium on Principles of programming languages (New York, NY, USA, 2006), ACM, pp. 346-358.
30. MOSS, J. E. B. Open Nested Transactions: Semantics and Support. In Poster at the 4th Workshop on Memory Performance Issues (WMPI-2006). February 2006.
31. NARAYANAN, R., ÖZIS. IKYILMAZ, B., ZAMBRENO, J., MEMIK, G., AND CHOUDHARY, A. Minebench: A benchmark suite for data mining workloads. In 2006 IEEE International Symposium on Workload Characterization (2006), pp. 182-188.
32. NURMI, O., AND SOISALON-SOININEN, E. Uncoupling updating and rebalancing in chromatic binary search trees. In Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (New York, NY, USA, 1991), PODS '91, ACM, pp. 192-198.
33. PAPADIMITRIOU, C. H. The serializability of concurrent database updates. J. ACM 26, 4 (1979), 631-653.
34. SAGIV, M., REPS, T., AND WILHELM, R. Parametric Shape Analysis via 3-valued Logic. ACM Trans. on Prog. Lang. and Systems (TOPLAS) 24, 3 (2002), 217-298.
35. SILBERSCHATZ, A., AND KEDAM, Z. A family of locking protocols for database systems that are modeled by directed graphs. Software Engineering, IEEE Transactions on SE-8, 6 (Nov. 1982), 558-562. (Pubitemid 13462563)
36. SLEATOR, D. D., AND TARJAN, R. E. Self adjusting heaps. SIAM J. Comput. 15 (February 1986), 52-69.
37. WANG, Y., LAFORTUNE, S., KELLY, T., KUDLUR, M., AND MAHLKE, S. A. The theory of deadlock avoidance via discrete control. In POPL (2009), pp. 252-263.
38. WEIKUM, G., AND VOSSEN, G. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001.
39. WELC, A., SAHA, B., AND ADL-TABATABAI, A.-R. Irrevocable transactions and their applications. In SPAA (2008), pp. 285-296.
40. YANG, H., LEE, O., BERDINE, J., CALCAGNO, C., COOK, B., AND DISTEFANO, D. Scalable shape analysis for systems code. In In CAV (2008).