Fri 25 Jun 2021 01:30 - 01:35 at PLDI-B - Talks 4B: Concurrency, Compilation, and Debugging
With the recent launch of the Intel Optane memory platform, non-volatile main memory in the form of fast, dense, byte-addressable non-volatile memory has now become available. Nevertheless, designing crash-resilient algorithms and data structures is complex and error-prone as caches and machine registers are still volatile and the data residing in memory after a crash might not reflect a consistent view of the program state. This complex setting has often led to durable data structures being inefficient or incorrect, especially in the concurrent setting.
In this paper, we present Mirror – a simple, general automatic transformation that adds durability to lock-free data structures, with a low performance overhead. Moreover, in the current non-volatile main memory configuration, where non-volatile memory operates side-by-side with a standard fast DRAM, our mechanism exploits the hybrid system to substantially improve performance. Evaluation shows a significant performance advantage over NVTraverse, which is the state-of-the-art general transformation technique, and over Intel's concurrent lock-based key-value datastore. Unlike some previous transformations, Mirror does not require any restriction on the lock-free data structure format.
Thu 24 JunDisplayed time zone: Eastern Time (US & Canada) change
13:30 - 14:05 | |||
13:30 5mTalk | Mirror: Making Lock-Free Data Structures Persistent PLDI DOI | ||
13:35 5mTalk | Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation PLDI Huaipan Jiang Pennsylvania State University, Haibo Zhang Pennsylvania State University, Xulong Tang University of Pittsburgh, Vineetha Govindaraj Pennsylvania State University, Jack Sampson Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Danfeng Zhang Pennsylvania State University DOI | ||
13:40 5mTalk | Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts PLDI Nilanjana Basu University of Illinois at Chicago, Claudio Montanari University of Illinois at Chicago, Jakob Eriksson University of Illinois at Chicago DOI | ||
13:45 5mTalk | Alive2: Bounded Translation Validation for LLVM PLDI Nuno P. Lopes Microsoft Research, Juneyoung Lee Seoul National University, Chung-Kil Hur Seoul National University, Zhengyang Liu University of Utah, John Regehr University of Utah DOI Pre-print | ||
13:50 5mTalk | Incremental Whole-Program Analysis in Datalog with Lattices PLDI Tamás Szabó JGU Mainz; Workday, Sebastian Erdweg JGU Mainz, Gábor Bergmann Budapest University of Technology and Economics; IncQuery Labs DOI | ||
13:55 5mTalk | Logical Bytecode Reduction PLDI Christian Gram Kalhauge University of California at Los Angeles; Technical University of Denmark, Jens Palsberg University of California at Los Angeles DOI | ||
14:00 5mTalk | RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types PLDI Michael Sammler MPI-SWS, Rodolphe Lepigre MPI-SWS, Robbert Krebbers Radboud University Nijmegen, Kayvan Memarian University of Cambridge, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS DOI |
Fri 25 JunDisplayed time zone: Eastern Time (US & Canada) change
01:30 - 02:05 | |||
01:30 5mTalk | Mirror: Making Lock-Free Data Structures Persistent PLDI DOI | ||
01:35 5mTalk | Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation PLDI Huaipan Jiang Pennsylvania State University, Haibo Zhang Pennsylvania State University, Xulong Tang University of Pittsburgh, Vineetha Govindaraj Pennsylvania State University, Jack Sampson Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Danfeng Zhang Pennsylvania State University DOI | ||
01:40 5mTalk | Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts PLDI Nilanjana Basu University of Illinois at Chicago, Claudio Montanari University of Illinois at Chicago, Jakob Eriksson University of Illinois at Chicago DOI | ||
01:45 5mTalk | Alive2: Bounded Translation Validation for LLVM PLDI Nuno P. Lopes Microsoft Research, Juneyoung Lee Seoul National University, Chung-Kil Hur Seoul National University, Zhengyang Liu University of Utah, John Regehr University of Utah DOI Pre-print | ||
01:50 5mTalk | Incremental Whole-Program Analysis in Datalog with Lattices PLDI Tamás Szabó JGU Mainz; Workday, Sebastian Erdweg JGU Mainz, Gábor Bergmann Budapest University of Technology and Economics; IncQuery Labs DOI | ||
01:55 5mTalk | Logical Bytecode Reduction PLDI Christian Gram Kalhauge University of California at Los Angeles; Technical University of Denmark, Jens Palsberg University of California at Los Angeles DOI | ||
02:00 5mTalk | RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types PLDI Michael Sammler MPI-SWS, Rodolphe Lepigre MPI-SWS, Robbert Krebbers Radboud University Nijmegen, Kayvan Memarian University of Cambridge, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS DOI |