Lock reservation for Java reconsidered

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3086, Issue , 2004, Pages 559-583

  Onoder, Tamiya ^a   Kawachiya, Kikyokuni ^a   Koseki, Akira ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; OBJECT ORIENTED PROGRAMMING;

JIT COMPILER; PERFORMANCE PENALTIES; SCIENTIFIC PROGRAMS; SPIN LOCK; VIRTUAL MACHINES;

LOCKS (FASTENERS);

EID: 84936951651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (33)

1. S. V. Adve and K. Gharachorloo: Shared Memory Consistency Models: A Tutorial. IEEE Computer, 29(12), 66–76, 1996.
2. T. E. Anderson: The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1), 6–16, 1990.
3. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White: An Efficient Meta-lock for Implementing Ubiquitous Synchronization. Proceedings of ACM OOPSLA’99, 207–222, 1999.
4. J. Aldrich, C. Chambers, E. G. Sirer, and S. Eggers: Static Analyses for Eliminating Unnecessary Synchronization from Java Programs. Proceedings of the 6th Int’l Static Analysis Symposium (SAS’99), 19–38, 1999.
5. D. F. Bacon: Fast and Effective Optimization of Statically Typed Object-Oriented Languages. Ph.D. Thesis UCB/CSD-98-1017, University of California, 1997.
6. D. F. Bacon, R. Konuru, C. Murthy, and M. Serrano: Thin Locks: Featherweight Synchronization for Java. Proceedings of ACM PLDI’98, 258–268, 1998.
7. B. Blanchet: Escape Analysis for Object-Oriented Languages: Application to Java. Proceedings of ACM OOPSLA’99, 20–34, 1999.
8. J. Bogda and U. Hölzle: Removing Unnecessary Synchronization in Java. Proceedings of ACM OOPSLA’99, 35–46, 1999.
9. J.-D. Choi, M. Gupta, M. Serrano, V. C. Sreedhar, and S. Midkiff: Escape Analysis for Java. Proceedings of ACM OOPSLA’99, 1–19, 1999.
10. D. E. Culler and J. P. Singh with A. Gupta: Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, 681–700, 1999.
11. E. W. Dijkstra: Solution of a Problem in Concurrent Programming and Control. Communications of the ACM, 8(9), 569, 1965.
12. E. W. Dijkstra: Cooperating Sequential Processes, 43–112. Academic Press, New York, 1968.
13. E. M. Gagnon and L. J. Hendren: SableVM: A Research Framework for the Efficient Execution of Java Bytecode. Proceedings of USENIX JVM’01, 27–39, 2001.
14. B. A. Gomes, L. Bak, and D. P. Stoutamire: Method and Apparatus for Speculatively Locking Objects in an Object-Based System. United States Patent, US 6,487,652 B1, 2002.
15. J. Gosling, B. Joy, and G. Steele: The Java Language Specification. AddisonWesley, 1996.
16. M. Greenwald and D. Cheriton: The Synergy Between Non-blocking Synchronization and Operating System Structure. Proceedings of USENIX OSDI’96, 123–136, 1996.
17. C. A. R. Hoare: Monitors: An Operating System Structuring Concept. Communications of the ACM, 17(10), 549–557, 1974
18. IBM developerWorks Java Technology Zone. http://www.ibm.com/developerworks/java/.
19. Intel Corporation. IA-32 Intel Architecture Software Developer’s Manual Volume 3: System Programming Guide, Order Number 245472-010, 2002
20. A. R. Karlin, K. Li, M. S. Manasse, and S. Owicki: Empirical Studies of Competitive Spinning for A Shared-Memory Multiprocessor. Proceedings of ACM SOSP’91, 41–55, 1991.
21. K. Kawachiya, A. Koseki, and T. Onodera: Lock Reservation: Java Locks Can Mostly Do Without Atomic Operations. Proceedings of ACM OOPSLA 2002, 131–141, 2002.
22. L. Lamport: A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems, 5(1), 1–11, 1987.
23. J. M. Mellor-Crummey and M. L. Scott: Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 9(1), 21–65, 1991.
24. G. Muller, B. Moura, F. Bellard, and C. Consel: Harissa: A Flexible and Efficient Java Environment Mixing Bytecode and Compiled Code. Proceedings of the 3rd USENIX Conference on Object Oriented Technologies and Systems (COOTS’97), 1–20, 1997.
25. T. Onodera and K. Kawachiya: A Study of Locking Objects with Bimodal Fields. Proceedings of ACM OOPSLA’99, 223–237, 1999.
26. J. K. Ousterhout: Scheduling Techniques for Concurrent Systems. Proceedings of the 3rd International Conference on Distributed Computing Systems, 22–30, 1982.
27. Y. G. Park and B. Goldberg: Escape Analysis on Lists. Proceedings of ACM PLDI’92, 116–127, 1992.
28. G. L. Peterson: Myths about the Mutual Exclusion Problem. Information Processing Letters, 12(3), 115–116, 1981.
29. E. Ruf: Effective Synchronization Removal for Java. Proceedings of ACM PLDI’00, 208–218, 2000.
30. A. Salcianu and M. Rinard: Pointer and Escape Analysis for Multithreaded Programs. Proceedings of ACM PPoPP’01, 12–23, 2001.
31. Standard Performance Evaluation Corporation: SPEC JVM98 Benchmarks. http://www.spec.org/osg/jvm98/.
32. J. Whaley and M. Rinard: Compositional Pointer and Escape Analysis for Java Programs. Proceedings of ACM OOPSLA’99, 187–206, 1999.
33. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta: The SPLASH-2 Programs: Characterization and Methodological Considerations. Proceedings of ACM ISCA’95, 12–23, 1995.