For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Kent

Return to search Previous output Next output
Output 0 of 0 in the submission
Output title

A Black-box Approach to Understanding Concurrency in DaCapo

Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA)
Volume number
-
Issue number
-
First page of article
335
ISSN of proceedings
-
Year of publication
2012
Number of additional authors
3
Additional information

<07> Systems research is driven by benchmarks: these “accelerate, retard or misdirect energy and innovation” (Blackburn et al OOPSLA'06). The importance of this work lies in its platform-independent analysis of the extent to which Java benchmarks really use concurrency mechanisms (e.g. accessing shared memory). We find that the DaCapo benchmarks (Blackburn et al), widely used in concurrency research, do not stress the mechanisms they supposedly exercise. Our conclusions guide VM and garbage collection researchers designing and optimising many-core, shared memory systems, by helping them understand the concurrency-related characteristics of these benchmarks. This work arose from our EPSRC Mirror-GC project, EP/H026975/1.

Interdisciplinary
-
Cross-referral requested
-
Research group
P - Programming Languages and Systems Group
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-