A Black-box Approach to Understanding Concurrency in DaCapo

Kalibera, Tomas and Mole, Matthew and Jones, Richard E. and Vitek, Jan (2012) A Black-box Approach to Understanding Concurrency in DaCapo. In: Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


Increasing levels of hardware parallelism are one of the main challenges for programmers and implementers of managed runtimes. Any concurrency or scalability improvements must be evaluated experimentally. However, application benchmarks available today may not reflect the highly concurrent applications we anticipate in the future. They may also behave in ways that VM developers do not expect. We provide a set of platform independent concurrency-related metrics and an in-depth observational study of current state of the art benchmarks, discovering how concurrent they really are, how they scale the work and how they synchronise and communicate via shared memory.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: Benchmarks, DaCapo, concurrency, scalability
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Richard Jones
Date Deposited: 21 Sep 2012 09:49
Last Modified: 04 Nov 2014 11:53
Resource URI: https://kar.kent.ac.uk/id/eprint/30784 (The current URI for this page, for reference purposes)
  • Depositors only (login required):