Wed 28 Oct 2015 18:00 - 21:00 at Admiral and Reflections - Posters Chair(s): Sam Guyer, Patrick Lam

Critical sections’ atomicity is enforced through locks or transactional memory (TM). Non-transactional programs have weak semantics in presence of data races under commonly used memory models like DRF0. Strong memory models like sequential consistency (SC), incur high implementation overhead and yet prove to me insufficient in eliminating concurrency bugs. TM programs have critical sections as atomic blocks. TM programs suffer from weak semantic behaviors especially in the interaction of transactional and non-transactional code. Guaranteeing strong semantics is expensive and the state of the art notion of strong semantics for TM programs still suffers from weak guarantees on relaxed memory models. Moreover, lock based programs often use TM for certain critical sections employing lock-elision. Furthermore, to enforce a strong memory model for a TM program with atomic blocks or non-transactional programs with locks, potentially different runtimes are required for each. Without a unified runtime, adding new atomic blocks to lock-based code is difficult prohibiting incremental deployment. Generally, enforcing strong semantics incurs high overhead. In this work, we propose a memory model that enforces stronger semantics than the state of the art and develop a single runtime to support TM and non-transactional programs. Our design and insights are aimed at efficiently enforcing this strong memory model for all programs by leveraging lightweight forms of atomicity that can be provided to critical sections and code regions of varying nature.

Wed 28 Oct

Displayed time zone: Eastern Time (US & Canada) change

18:00 - 21:00
PostersStudent Research Competition at Admiral and Reflections
Chair(s): Sam Guyer Tufts University, Patrick Lam University of Waterloo, Canada
18:00
3h
Talk
Efficient Support for Strong Semantics in Transactional and Non-transactional Programs
Student Research Competition
Aritra Sengupta Ohio State University
18:00
3h
Talk
Automatic Array Property Detection Via Static Analysis
Student Research Competition
18:00
3h
Talk
KinEdit: A Tool to Help Developers Refactor Manually
Student Research Competition
Josh Terrell California Polytechnic University
18:00
3h
Talk
Finding Bugs in Spreadsheets Using Reference Counting
Student Research Competition
Nima Joharizadeh University of California, Davis
18:00
3h
Talk
Viser: Providing Serializability in Hardware With Simplified Cache Coherence
Student Research Competition
Swarnendu Biswas Ohio State University, USA
18:00
3h
Talk
Concurrency Control for Multithreaded Reactive Programming
Student Research Competition
Ragnar Mogk Technische Universität Darmstadt
18:00
3h
Talk
Gradual Mode Types for Energy-Aware Programming
Student Research Competition
Anthony Canino SUNY Binghamton
18:00
3h
Talk
Race-driven UI-level Test Generation for JavaScript-based Web Applications
Student Research Competition
18:00
3h
Talk
Contributions of the Under-Appreciated: Gender Bias in an Open-Source Ecology
Student Research Competition
Andrew Kofink North Carolina State University
18:00
3h
Talk
Safely Evolving Configurable Systems
Student Research Competition
Flavio Medeiros Federal University of Campina Grande
18:00
3h
Talk
SIRe: An Efficient Snapshot Isolation-based Memory Model for Detecting and Tolerating Region Conflicts
Student Research Competition
Minjia Zhang Ohio State University, USA
18:00
3h
Talk
The Oprop Verification Tool: Object Propositions in Action
Student Research Competition
Nistor Ligia Carnegie Mellon University