Welcome to the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI '22) submissions site. For conference information, . This post is for recording some notes from a few OSDI'21 papers that I got fun. We develop MAGE, an execution engine for SC that efficiently runs SC computations that do not fit in memory. The wire-to-wire RPC response time through the nanoPU is just 69ns, an order of magnitude quicker than the best-of-breed, low latency, commercial NICs. SC is being increasingly adopted by industry for a variety of applications. We propose a new framework for computing the embeddings of large-scale graphs on a single machine. Fan Lai, Xiangfeng Zhu, Harsha V. Madhyastha, and Mosharaf Chowdhury, University of Michigan. Despite their extensive use for debugging and vulnerability discovery, sanitizer checks often induce a high runtime cost. We also welcome work that explores the interface to related areas such as computer architecture, networking, programming languages, analytics, and databases. To remedy this, we introduce DeSearch, the first decentralized search engine that guarantees the integrity and privacy of search results for decentralized services and blockchain apps. The main contribution of this paper is GoJournal, a verified, concurrent journaling system that provides atomicity for storage applications, together with Perennial 2.0, a framework for formally specifying and verifying concurrent crash-safe systems. Kernel code requires manual memory management and type-unsafe code and must efficiently handle complex, asynchronous events. She has been recognized with many industry honors including induction into the National Academy of Engineering, the Inventor Hall of Fame, The Internet Hall of Fame, Washington State Academy of Science, and lifetime achievement awards from USENIX and SIGCOMM. We present NrOS, a new OS kernel with a safer approach to synchronization that runs many POSIX programs. Commonly used log archival and compression tools like Gzip provide high compression ratio, yet searching archived logs is a slow and painful process as it first requires decompressing the logs. The experimental results show that Penglai can support 1,000s enclave instances running concurrently and scale up to 512GB secure memory with both encryption and integrity protection. We introduce a hybrid cryptographic protocol for privacy-adhering transformations of encrypted data. Pollux promotes fairness among DL jobs competing for resources based on a more meaningful measure of useful job progress, and reveals a new opportunity for reducing DL cost in cloud environments. The novel aspect of the nanoPU is the design of a fast path between the network and applications---bypassing the cache and memory hierarchy, and placing arriving messages directly into the CPU register file. Academic and industrial participants present research and experience papers that cover the full range of theory . Kyuhwa Han, Sungkyunkwan University and Samsung Electronics; Hyunho Gwak and Dongkun Shin, Sungkyunkwan University; Jooyoung Hwang, Samsung Electronics. ), Program Co-Chairs: Angela Demke Brown, University of Toronto, and Jay Lorch, Microsoft Research. The papers will be available online to everyone beginning on the first day of the conference, July 14, 2021. Professor Veloso earned a Bachelor and Master of Science degrees in Electrical and Computer Engineering from Instituto Superior Tecnico in Lisbon, Portugal, a Master of Arts in Computer Science from Boston University, and Master of Science and PhD in Computer Science from Carnegie Mellon University. OSDI '21 - HotCRP.com If you have any questions about conflicts, please contact the program co-chairs. The program co-chairs will use this information at their discretion to preserve the anonymity of the review process without jeopardizing the outcome of the current OSDI submission. Existing algorithms are designed to work well for certain workloads. VLDB 2021 - 47th International Conference on Very Large Data Bases Only two types of supplementary material are permitted: source code described in the paper and formal proofs sketched in the paper. This paper presents Zeph, a system that enables users to set privacy preferences on how their data can be shared and processed. A graph neural network (GNN) enables deep learning on structured graph data. Distributed Trust: Is Blockchain the answer? If your accepted paper should not be published prior to the event, please notify production@usenix.org. All papers will be available online to registered attendees before the conference. Currently, for large graphs, CPU servers offer the best performance-per-dollar over GPU servers. Perennial 2.0 makes this possible by introducing several techniques to formalize GoJournals specification and to manage the complexity in the proof of GoJournals implementation. Authors are required to register abstracts by 3:00 p.m. PST on December 3, 2020, and to submit full papers by 3:00 p.m. PST on December 10, 2020. Grand Rapids, Michigan, United States . USENIX ATC '21 - HotCRP.com Password In addition, increasing CPU core counts further complicate kernel development. Our further evaluation on 38 CVEs from 10 commonly-used programs shows that SanRazor reduced checks suffice to detect at least 33 out of the 38 CVEs. Evaluations show that Vegito can perform 1.9 million TPC-C NewOrder transactions and 24 TPC-H-equivalent queries per second simultaneously, which retain the excellent performance of specialized OLTP and OLAP counterparts (e.g., DrTM+H and MonetDB). It then feeds those invariants and the desired safety properties to an SMT solver to check if the conjunction of the invariants and the safety properties is inductive. Last year, 70% of accepted OSDI papers participated in the . See the USENIX Conference Submissions Policy for details. Just using Lambdas on top of CPU servers offers up to 2.75 more performance-per-dollar than training only with CPU servers. Academic and industrial participants present research and experience papers that cover the full range of theory and practice of computer . will work with the steering committee to ensure that the symposium program will accommodate presentations for all accepted papers. For general conference information, see https://www . He joined Intel Research at Berkeley in April 2002 as a principal architect of PlanetLab, an open, shared platform for developing and deploying planetary-scale services. Professor Veloso is the Past President of AAAI (the Association for the Advancement of Artificial Intelligence), and the co-founder, Trustee, and Past President of RoboCup. OSDI brings together professionals from academic and industrial backgrounds in what has become a premier forum for discussing the design, implementation, and implications of systems software. This paper demonstrates that it is possible to achieve s-scale latency using Linux kernel storage stack, even when tens of latency-sensitive applications compete for host resources with throughput-bound applications that perform read/write operations at throughput close to hardware capacity. This paper describes the design, implementation, and evaluation of Addra, the first system for voice communication that hides metadata over fully untrusted infrastructure and scales to tens of thousands of users. Radia Perlman is a Fellow at Dell Technologies. (Jan 2019) Our REPT paper won a best paper at OSDI'18 (Oct 2018) I will serve in the SOSP'19 PC. Papers must be in PDF format and must be submitted via the submission form. Authors may submit a response to those reviews until Friday, March 5, 2021. Our evaluation shows that, compared to existing participant selection mechanisms, Oort improves time-to-accuracy performance by 1.2X-14.1X and final model accuracy by 1.3%-9.8%, while efficiently enforcing developer-specified model testing criteria at the scale of millions of clients. We identify that current systems for learning the embeddings of large-scale graphs are bottlenecked by data movement, which results in poor resource utilization and inefficient training. 64 papers accepted out of 341 submitted. PDF Why Has Personality Psychology Played an Outsized Role in the There are two major GNN training obstacles: 1) it relies on high-end servers with many GPUs which are expensive to purchase and maintain, and 2) limited memory on GPUs cannot scale to today's billion-edge graphs. Starting with small invariant formulas and strongest possible invariants avoids large SMT queries, improving SMT solver performance. See the Preview Session page for an overview of the topics covered in the program. Accepted paper for Luo Mai at OSDI 22 | InfWeb She has a PhD in computer science from MIT. Pollux simultaneously considers both aspects. We conclude with a discussion of additional techniques for improving the allocator development process and potential optimization strategies for future memory allocators. NrOS replicates kernel state on each NUMA node and uses operation logs to maintain strong consistency between replicas. Authors are also encouraged to contact the program co-chairs, osdi21chairs@usenix.org, if needed to relate their OSDI submissions to relevant submissions of their own that are simultaneously under review or awaiting publication at other venues. Pollux is implemented and publicly available as part of an open-source project at https://github.com/petuum/adaptdl. We implement a variant of a log-structured merge tree in the storage device that not only indexes file objects, but also supports transactions and manages physical storage space. Lukas Burkhalter, Nicolas Kchler, Alexander Viand, Hossein Shafagh, and Anwar Hithnawi, ETH Zrich. Based on this observation, P3 proposes a new approach for distributed GNN training. However, the existing one-size-fits-all GNN implementations are insufficient to catch up with the evolving GNN architectures, the ever-increasing graph size, and the diverse node embedding dimensionality. 23 artifacts received the Artifacts Functional badge (88%). USENIX, like other scientific and technical conferences and journals, prohibits these practices and may, on the recommendation of a program chair, take action against authors who have committed them. We present the results of a 1% experiment at fleet scale as well as the longitudinal rollout in Googles warehouse scale computers. Zeph enforces privacy policies cryptographically and ensures that data available to third-party applications complies with users' privacy policies. Call for Papers. Contact your program co-chairs, osdi21chairs@usenix.org, or the USENIX office, submissionspolicy@usenix.org. There is no explicit limit to the response, but authors are strongly encouraged to keep it under 500 words; reviewers are neither required nor expected to read excessively long responses. Research Impact Score 9.24. . Professor Veloso is on leave from Carnegie Mellon University as the Herbert A. Simon University Professor in the School of Computer Science, and the past Head of the Machine Learning Department. Four months after we reported the bugs to Geth developers, one of the bugs was triggered on the mainnet, and caused nodes using a stale version of Geth to hard fork the Ethereum blockchain. Based on the observation that real-world workloads always feature skewed access patterns, Nap introduces a NUMA-aware layer (NAL) on the top of existing concurrent PM indexes, and steers accesses to hot items to this layer. For more details on the submission process, and for templates to use with LaTeX, Word, etc., authors should consult the detailed submission requirements. Welcome to the 15th USENIX Symposium on Operating Systems Design and Implementation (OSDI '21) submissions site. Session Chairs: Dushyanth Narayanan, Microsoft Research, and Gala Yadgar, TechnionIsrael Institute of Technology, Jinhyung Koo, Junsu Im, Jooyoung Song, and Juhyung Park, DGIST; Eunji Lee, Soongsil University; Bryan S. Kim, Syracuse University; Sungjin Lee, DGIST. HotNets provides a venue for discussing innovative ideas and for debating future research agendas in networking. This budget is a scarce resource that must be carefully managed to maximize the number of successfully trained models. SanRazor adopts a novel hybrid approach it captures both dynamic code coverage and static data dependencies of checks, and uses the extracted information to perform a redundant check analysis. KEVIN combines a fast, lightweight, and POSIX compliant file system with a key-value storage device that performs in-storage indexing. Weak Links in Authentication Chains: A Large-scale Analysis of Email Sender Spoofing Attacks An evaluation of Addra on a cluster of 80 machines on AWS demonstrates that it can serve 32K users with a 99-th percentile message latency of 726 msa 7 improvement over a prior system for text messaging in the same threat model. Fortunately, we observe that the backups for high availability in modern distributed OLTP systems can be retrofitted to bridge the analytical queries and transactions in HTAP workloads. NrOS is primarily constructed as a simple, sequential kernel with no concurrency, making it easier to develop and reason about its correctness. Our evaluation shows that DistAI successfully verifies 13 common distributed protocols automatically and outperforms alternative methods both in the number of protocols it verifies and the speed at which it does so, in some cases by more than two orders of magnitude. A.H. Hunter, Jane Street Capital; Chris Kennelly, Paul Turner, Darryl Gove, Tipp Moseley, and Parthasarathy Ranganathan, Google. Authors must limit their responses to (a) correcting factual errors in the reviews or (b) directly addressing questions posed by reviewers. We implement and evaluate a suite of applications, including MICA, Raft and Set Algebra for document retrieval; and we demonstrate that the nanoPU can be used as a high performance, programmable alternative for one-sided RDMA operations. Timothy Roscoe is a Full Professor in the Systems Group of the Computer Science Department at ETH Zurich, where he works on operating systems, networks, and distributed systems, and is currently head of department. The hybrid segment recycling chooses a proper block reclaiming policy between segment compaction and threaded logging based on their costs. To adapt to different workloads, prior works mix or switch between a few known algorithms using manual insights or simple heuristics. We have made Fluffy publicly available at https://github.com/snuspl/fluffy to contribute to the security of Ethereum. This paper presents the design and implementation of CLP, a tool capable of losslessly compressing unstructured text logs while enabling fast searches directly on the compressed data. Under different configurations of TPC-C and TPC-E, Polyjuice can achieve throughput numbers higher than the best of existing algorithms by 15% to 56%. To evaluate the security guarantees of Storm, we build a formally verified reference implementation using the Labeled IO (LIO) IFC framework. Papers accompanied by nondisclosure agreement forms will not be considered. OSDI brings together professionals from academic and industrial backgrounds in a premier forum for discussing the design, implementation, and implications of systems software. She developed the technology for making network routing self-stabilizing, largely self-managing, and scalable. These are hard deadlines, and no extensions will be given. However, Addra improves message latency in this architecture, which is a key performance metric for voice calls. Session Chairs: Sebastian Angel, University of Pennsylvania, and Malte Schwarzkopf, Brown University, Ishtiyaque Ahmad, Yuntian Yang, Divyakant Agrawal, Amr El Abbadi, and Trinabh Gupta, University of California Santa Barbara. SOSP 2021 - Symposium on Operating Systems Principles Kirk Rodrigues, Yu Luo, and Ding Yuan, University of Toronto and YScope Inc. Our evaluation shows that NrOS scales to 96 cores with performance that nearly always dominates Linux at scale, in some cases by orders of magnitude, while retaining much of the simplicity of a sequential kernel. Camera-ready submission (all accepted papers): 2 April 2021; Main conference program: 27-28 April 2021; All deadline times are . For example, talks may be shorter than in prior years, or some parts of the conference may be multi-tracked. Consensus bugs are bugs that make Ethereum clients transition to incorrect blockchain states and fail to reach consensus with other clients. Nico Lehmann and Rose Kunkel, UC San Diego; Jordan Brown, Independent; Jean Yang, Akita Software; Niki Vazou, IMDEA Software Institute; Nadia Polikarpova, Deian Stefan, and Ranjit Jhala, UC San Diego. Based on the observation that invariants are often concise in practice, DistAI starts with small invariant formulas and enumerates all strongest possible invariants that hold for all samples. We present Nap, a black-box approach that converts concurrent persistent memory (PM) indexes into NUMA-aware counterparts. Author Response Period We demonstrate that Marius achieves the same level of accuracy but is up to one order of magnitude faster. The key to our solution, Horcrux, is to account for the non-determinism intrinsic to web page loads and the constraints placed by the browsers API for parallelism. Accepted papers will be allowed 14 pages in the proceedings, plus references. While compiler-based techniques have been proposed to improve data locality, they depend on heuristics, which can sometimes hurt performance. However, a plethora of recent data breaches show that even widely trusted service providers can be compromised. However, with the increasingly speedy transactions and queries thanks to large memory and fast interconnect, commodity HTAP systems have to make a tradeoff between data freshness and performance degradation. We built a functional NFSv3 server, called GoNFS, to use GoJournal. Secure Computation (SC) is a family of cryptographic primitives for computing on encrypted data in single-party and multi-party settings. Here, we focus on hugepage coverage. We present the nanoPU, a new NIC-CPU co-design to accelerate an increasingly pervasive class of datacenter applications: those that utilize many small Remote Procedure Calls (RPCs) with very short (s-scale) processing times. For any further information, please contact the PC chairs: pc-chairs-2022@eurosys.org. Marius is open-sourced at www.marius-project.org. Her specialties include network routing protocols and network security. Leveraging these information, Pollux dynamically (re-)assigns resources to improve cluster-wide goodput, while respecting fairness and continually optimizing each DL job to better utilize those resources. The chairs will review paper conflicts to ensure the integrity of the reviewing process, adding or removing conflicts if necessary. Authors should email the program co-chairs, osdi21chairs@usenix.org, a copy of the related workshop paper and a short explanation of the new material in the conference paper beyond that published in the workshop version. Furthermore, to enable automatic runtime optimization, GNNAdvisor incorporates a lightweight analytical model for an effective design parameter search. Software Systems Laboratory Wins Best Paper Awards at the OSDI and Her robot soccer teams have been RoboCup world champions several times, and the CoBot mobile robots have autonomously navigated for more than 1,000km in university buildings. We implement DeSearch for two existing decentralized services that handle over 80 million records and 240 GBs of data, and show that DeSearch can scale horizontally with the number of workers and can process 128 million search queries per day. Furthermore, by combining SanRazor with an existing sanitizer reduction tool ASAP, we show synergistic effect by reducing the runtime cost to only 7.0% with a reasonable tradeoff of security. The overhead of GPT is 5% for memory-intensive workloads (e.g., Redis) and negligible for CPU-intensive workloads (e.g., RV8 and Coremarks). Typically, monolithic kernels share state across cores and rely on one-off synchronization patterns that are specialized for each kernel structure or subsystem. Academic and industrial participants present research and experience papers that cover the full range of theory and practice of computer . Evaluation on a four-node machine with Optane DC Persistent Memory shows that Nap can improve the throughput by up to 2.3 and 1.56 under write-intensive and read-intensive workloads, respectively. We present selective profiling, a technique that locates data locality problems with low-enough overhead that is suitable for production use. Forgot your password? In this talk, I'll speculate on how we came to this unfortunate state of affairs, and what might be done to fix it. Computation separation makes it possible to construct a deep, bounded-asynchronous pipeline where graph and tensor parallel tasks can fully overlap, effectively hiding the network latency incurred by Lambdas. Hence, kernel developers are constantly refining synchronization within OS kernels to improve scalability at the risk of introducing subtle bugs. Session Chairs: Deniz Altinbken, Google, and Rashmi Vinayak, Carnegie Mellon University, Tanvir Ahmed Khan and Ian Neal, University of Michigan; Gilles Pokam, Intel Corporation; Barzan Mozafari and Baris Kasikci, University of Michigan. This yielded 6% fewer TLB miss stalls, and 26% reduction in memory wasted due to fragmentation. First, GNNAdvisor explores and identifies several performance-relevant features from both the GNN model and the input graph, and use them as a new driving force for GNN acceleration. (Visa applications can take at least 30 working days to process.) Distributed systems are notoriously hard to implement correctly due to non-determinism. Mothy joined the Computer Science Department ETH Zurich in January 2007 and was named Fellow of the ACM in 2013 for contributions to operating systems and networking research. Dorylus is up to 3.8 faster and 10.7 cheaper compared to existing sampling-based systems.