PPoPP 2019
Sat 16 - Wed 20 February 2019 Washington, DC, United States
Mon 18 Feb 2019 15:15 - 15:40 at Salon 12/13 - Session 3: Transactional Memory Chair(s): Milind Chabbi

In this paper we provide a high performance solution to the problem of committing transactions while enforcing a predefined order. We provide the design and implementation of three algorithms, which deploy a specialized cooperative transaction execution model. This model permits the propagation of written values along the chain of ordered transactions. We show that, even in the presence of data conflicts, the proposed algorithms outperform single threaded execution, and other baseline and specialized state-of-the-art competitors (e.g., STMLite). The maximum speedup achieved in micro benchmarks, STAMP, PARSEC and SPEC200 applications is in the range of 4.3x - 16.5x.

Mon 18 Feb (GMT-05:00) Guadalajara, Mexico City, Monterrey change

14:00 - 15:40: Main Conference - Session 3: Transactional Memory at Salon 12/13
Chair(s): Milind ChabbiUber Technologies
PPoPP-2019-papers14:00 - 14:25
Brijesh DongolUniversity of Surrey, Radha JagadeesanDePaul University, James RielyDePaul University
PPoPP-2019-papers14:25 - 14:50
Ryan Yates, Michael ScottUniversity of Rochester
DOI Authorizer link File Attached
PPoPP-2019-papers14:50 - 15:15
Ricardo Jorge Duarte Filipe, Shady IssaINESC-ID, João BarretoINESC-ID, Paolo RomanoUniversity of Lisbon, Portugal
PPoPP-2019-papers15:15 - 15:40
Mohamed M. SaadVirginia Tech, Masoomeh Javidi KishiLehigh University, Shihao JingLehigh University, Sandeep HansIBM India Research Lab, Roberto PalmieriLehigh University