Write a Blog >>
PPoPP 2021
Sat 27 February - Wed 3 March 2021
Mon 1 Mar 2021 10:00 - 10:15 - Session 1. Concurrency Chair(s): Konstantinos (Kostis) Sagonas

Durable techniques coupled with transactional semantics provide to application developers the guarantee that data is saved consistently in persistent memory (PM), even in the event of a non-corrupting failure. Persistence fences and flush instructions are known to have a significant impact on the throughput of persistent transactions.

In this paper we explore different trade-offs in terms of memory usage vs. number of fences and flushes. We present two new algorithms, named Trinity and Quadra, for durable transactions on PM and implement each of them in the form of a user-level library persistent transactional memory (PTM). Quadra achieves the lower bound with respect to the number of persistence fences and executes one flush instruction per modified cache line. Trinity can be easily combined with concurrency control techniques based on fine grain locking, and we have integrated it with our TL2 adaptation, with eager locking and write-through update strategy. Moreover, the combination of Trinity and TL2 into a PTM provides good scalability for data structures and workloads with a disjoint access pattern. We used this disjoint PTM to implement a key-value (KV) store with durable linearizable transactions.When compared with previous work, our TL2 KV store provides better throughput in nearly all experiments.

Watch on Youtube

Conference Day
Mon 1 Mar

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

10:00 - 11:00
Session 1. ConcurrencyMain Conference
Chair(s): Konstantinos (Kostis) SagonasUppsala University and National Technical University of Athens
10:00
15m
Talk
Efficient Algorithms for Persistent Transactional Memory
Main Conference
Pedro RamalheteCisco Systems, Andreia CorreiaUniversity of Neuchatel, Switzerland, Pascal FelberUniversity of Neuchâtel
Link to publication
10:15
15m
Talk
Investigating the Semantics of Futures in Transactional Memory Systems
Main Conference
Jingna ZengKTH Royal Institute of Technology, Sweden / IST, ULisboa, Shady IssaINESC-ID, Paolo RomanoINESC-ID / IST, ULisboa, Luis RodriguesINESC-ID, IST, ULisboa, Seif HaridiKTH Royal Institute of Technology, Sweden
Link to publication
10:30
15m
Talk
Constant-Time Snapshots with Applications to Concurrent Data Structures
Main Conference
Yuanhao WeiCarnegie Mellon University, Naama Ben-DavidVMware Research, Guy E. BlellochCarnegie Mellon University, Panagiota FatourouFORTH ICS and University of Crete, Greece, Eric RuppertYork University, Canada, Yihan SunUniversity of California, Riverside
Link to publication
10:45
15m
Talk
Reasoning About Recursive Tree Traversals
Main Conference
Yanjun WangPurdue University, Jinwei LiuBeijing Jiaotong University, Dalin ZhangBeijing Jiaotong University, Xiaokang QiuPurdue University
Link to publication