Skip to main content

A Black-box Approach to Understanding Concurrency in DaCapo

Kalibera, Tomas, Mole, Matthew, Jones, Richard E., Vitek, Jan (2012) A Black-box Approach to Understanding Concurrency in DaCapo. In: Dwyer, Matthew and Leavens, Gary T., eds. Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). . ACM, Tucson, AZ, USA (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) (KAR id:30784)

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.
Official URL
http://www.cs.kent.ac.uk/pubs/2012/3246

Abstract

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Richard Jones
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30784 (The current URI for this page, for reference purposes)
Jones, Richard E.: https://orcid.org/0000-0002-8159-0297
  • Depositors only (login required):