(Enter summary)
Abstract: In this paper, we describe three novel analyses for eliminating unnecessary synchronization that remove over 70% of
dynamic synchronization operations on the majority of our 15 benchmarks and improve the bottom-line performance of three
by 37-53%. Our analyses attack three frequent forms of unnecessary synchronization: thread-local synchronization, reentrant
synchronization, and enclosed lock synchronization. We motivate the design of our analyses with a study of the kinds of
unnecessary... (Update)
Context of citations to this paper: More
.... from benchmarks, to characterize di erent types of redundant operations, and to develop compiler analyses that identify and remove them[1, 2]. This is the most comprehensive and most e ective work to date on synchronization analyses, eliminating 36 to 100 of all lock...
.... Compile time Monitor Optimizations There has also been significant work on elimination of synchronization via compiletime analysis [2, 3, 8, 21]. This work can in some cases be highly effective at reducing or (in the case of single threaded programs) eliminating...
Cited by: More
Safe Futures for Java - Welc, Jagannathan, Hosking
(Correct)
Type Systems for Distributed Data Sharing - Liblit, Aiken, Yelick (2001)
(Correct)
Space- and Time-Efficient Implementation of the Java Object.. - Bacon, Fink, Grove (2002)
(Correct)
Active bibliography (related documents): More All
0.8: Comprehensive Synchronization Elimination for Java - Aldrich, Sirer, Chambers..
(Correct)
0.3: Static Analyses for Eliminating Unnecessary.. - Aldrich, Chambers.. (1999)
(Correct)
0.2: Compositional Pointer and Escape Analysis for Multithreaded.. - Rinard, Whaley
(Correct)
Similar documents based on text: More All
0.2: Open Modules: Modular Reasoning in Aspect-Oriented Programming - Aldrich
(Correct)
0.2: Open Modules: Reconciling Extensibility and Information Hiding - Aldrich (2004)
(Correct)
0.2: An Access Control Language for Web Services - Sirer, Wang (2002)
(Correct)
Related documents from co-citation: More All
3: Removing Unnecessary Synchronization in Java
- Bogda, olzle - 1999
2: Eraser: A dynamic data race detector for multi-threaded programs
- Savage, Burrows et al. - 1997
2: Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
- Aldrich, Chambers et al. - 1999
BibTeX entry: (Update)
Jonathan Aldrich, Emin Gun Sirer, Craig Chambers, and Susan Eggers. Comprehensive Synchronization Elimination for Java. Submitted for review. http://citeseer.ist.psu.edu/article/aldrich00comprehensive.html More
@misc{ aldrich-comprehensive,
author = "J. Aldrich and E. un and S. Craig and C. Susan",
title = "Comprehensive Synchronization Elimination for Java",
text = "Jonathan Aldrich, Emin Gun Sirer, Craig Chambers, and Susan Eggers. Comprehensive
Synchronization Elimination for Java. Submitted for review.",
url = "citeseer.ist.psu.edu/article/aldrich00comprehensive.html" }
Citations (may not include all citations):
862
The Java Language Specification
- Gosling, Joy et al. - 1996
154
Escape Analysis for Java
- Choi, Gupta et al. - 1999
127
Control-Flow analysis in Scheme (context) - Shivers - 1988
90
Vortex: An Optimizing Compiler for ObjectOriented Languages
- Dean, DeFouw et al. - 1996
88
Experience with Processes and Monitors in Mesa
- Lampson, Redell - 1980
67
Escape Analysis for Object-Oriented Languages (context) - Blanchet - 1999
67
Call Graph Construction in Object-Oriented Languages
- Grove, DeFouw et al. - 1997
66
Fixing the Java Memory Model
- Pugh - 1999
63
Removing Unnecessary Synchronization in Java
- Bogda, Holzle - 1999
51
Pointer analysis for multithreaded programs
- Rugina, Rinard - 1999
51
Prentice Hall (context) - Harbison - 1992
49
Thin Locks: Featherweight Synchronization for Java
- Bacon, Konuru et al. - 1998
47
Marmot: an Optimizing Compiler for Java
- Fitzgerald, Knoblock et al. - 1998
44
Obtaining Sequential Efficiency for Concurrent Object-Orient..
- Plevyak, Zhang et al. - 1995
42
Static Analyses for Eliminating Unnecessary Synchronization ..
- Aldrich, Chambers et al. - 1999
40
Design and Implementation of a Distributed Virtual Machine f..
- Sirer, Grimm et al. - 1999
28
Optimization of Object-oriented and Concurrent Programs (context) - Plevyak - 1996
24
the Complexity Analysis of Static Analyses
- McAllester - 1999
21
Using Shape Analysis to Reduce Finite-State Models of Concur..
- Corbett - 1998
21
Monitors and Exceptions: How to implement Java efficiently
- Krall, Probst - 1998
21
Lock Coarsening: Eliminating Lock Overhead in Automatically ..
- Diniz, Rinard - 1998
21
An Efficient Meta-lock for Implementing Ubiquitous Synchroni..
- Agesen, Detlefs et al. - 1999
20
Performance Limitations of the Java Core Libraries
- Heydon, Najork - 1999
20
Effective Synchronization Removal for Java (context) - Ruf - 2000
12
A Study of Locking Objects with Bimodal Fields (context) - Onodera, Kawachiya - 1999
10
Compaq SRC Research Report (context) - Detlefs, Rustan et al. - 1998
Documents on the same site (http://www.cs.washington.edu/research/tr/tr-by-date.html): More
On Constraints on the Search Path of Policy Iteration - Madani (1999)
(Correct)
Efficient Evaluation of Regular Path Expressions on.. - Ives, Levy, Weld (2000)
(Correct)
Lecture Notes on Biological Sequence Analysis - Tompa (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC