Write a Blog >>
PLDI 2021
Sun 20 - Sat 26 June 2021 PLDI

Recent work in networking, storage and multi-threading has demonstrated improved performance and scalability by replacing kernel-mode interrupts with high-rate user-space polling. Typically, such polling is performed by a dedicated core. Compiler Interrupts (CIs) instead enable efficient, automatic high-rate polling on a shared thread, which performs other work between polls. CIs are instrumentation-based and light-weight, allowing frequent interrupts with little performance impact. For example, when targeting a 5,000 cycle interval, the median overhead of our fastest CI design is 5% vs. 800% for hardware interrupts, across programs in the SPLASH-2, Phoenix and Parsec benchmark suites running with 32 threads. We evaluate CIs on three systems-level applications: (a) kernel bypass networking with mTCP, (b) joint kernel bypass networking and CPU scheduling with Shenango, and (c) delegation, a message-passing alternative to locking, with FFWD. For each application, we find that CIs offer compelling qualitative and quantitative improvements over the current state of the art. For example, CI-based mTCP achieves ≈2× stock mTCP throughput on a sample HTTP application.

Thu 24 Jun

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

13:30 - 14:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B +12h
13:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal Friedman Technion, Erez Petrank Technion, Pedro Ramalhete Cisco Systems
DOI
13:35
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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 Jun

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

01:30 - 02:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B
01:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal Friedman Technion, Erez Petrank Technion, Pedro Ramalhete Cisco Systems
DOI
01:35
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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
5m
Talk
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