School of Computing

A black-box approach to understanding concurrency in DaCapo

Tomas Kalibera, Matthew Mole, Richard Jones, and Jan Vitek

In Matthew Dwyer and Gary Leavens, editors, Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), Tucson, AZ, USA, October 2012. ACM.

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.

Download publication 272 kbytes (PDF)

Bibtex Record

@inproceedings{3246,
author = {Tomas Kalibera and Matthew Mole and Richard Jones and Jan Vitek},
title = {A Black-box Approach to Understanding Concurrency in {D}a{C}apo},
month = {October},
year = {2012},
pages = {},
keywords = {Benchmarks, DaCapo, concurrency, scalability},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2012/3246},
    publication_type = {inproceedings},
    submission_id = {24647_1344428080},
    booktitle = {Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA)},
    editor = {Matthew Dwyer and Gary Leavens},
    address = {Tucson, AZ, USA},
    publisher = {ACM},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014