Removing unnecessary synchronization in Java
Authors:
Open Access
- 1 October 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 34 (10) , 35-46
Abstract
Java programs perform many synchronization operations on data structures. Some of these synchronization are unnecessary; in particular, if an object is reachable only by a single thread, concurrent access is impossible and no synchronization is needed. We describe an interprocedural, flow- and context-insensitive dataflow analysis that finds such situations. A global optimizing transformation then eliminates synchronizations on these objects. For every program in our suite of ten Java benchmarks consisting of SPECjvm98 and others, our system optimizes over 90% of the alias sets containing at least one synchronized object. As a result, the dynamic frequency of synchronizations is reduced by up to 99%. For two benchmarks that perform synchronizations very frequently, this optimization leads to speedups of 36% and 20%.Keywords
This publication has 15 references indexed in Scilit:
- An efficient meta-lock for implementing ubiquitous synchronization1999
- Performance limitations of the Java core libraries1999
- An evaluation of automatic object inline allocation techniques1998
- Reducing garbage in JavaACM SIGPLAN Notices, 1998
- Thin locks1998
- Lock Coarsening: Eliminating Lock Overhead in Automatically Parallelized Object-Based ProgramsJournal of Parallel and Distributed Computing, 1998
- Automatic inline allocation of objects1997
- Solving shape-analysis problems in languages with destructive updating1996
- Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C1996
- Lifetime analysis of dynamically allocated objects1988