sponsors
usenix conference policies
…And Region Serializability for All
Error message
You are not authorized to post comments.Jessica Ouyang, Peter M. Chen, Jason Flinn, and Satish Narayanasamy, University of Michigan
A desirable concurrency semantics to provide for programs is region serializability. This strong semantics guarantees that all program regions between synchronization operations appear to execute in some global and serial order consistent with program order. Unfortunately, this guarantee is currently provided only to programs that are free of data races. For programs with data races, system designers currently face a difficult trade-off between losing all semantic guarantees and hurting performance. In this paper, we argue that region serializability should be guaranteed for all programs, including those with data races. This allows programmers, compilers, and other tools to reason about a program execution as an interleaving of code regions rather than memory instructions. We show one way to provide this guarantee with an execution style called uniparallelism and simple compiler support. The cost of the system is a 100% increase in utilization. However, if there are sufficient spare cores on the computer, the system adds a median overhead of only 15% for 4 threads.
Open Access Media
USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.
author = {Jessica Ouyang and Peter M. Chen and Jason Flinn and Satish Narayanasamy},
title = {{{\textellipsis}And} Region Serializability for All},
booktitle = {5th USENIX Workshop on Hot Topics in Parallelism (HotPar 13)},
year = {2013},
address = {San Jose, CA},
url = {https://www.usenix.org/conference/hotpar13/workshop-program/presentation/ouyang},
publisher = {USENIX Association},
month = jun
}
connect with us