osdi 2021 accepted papers osdi 2021 accepted papers

We particularly encourage contributions containing highly original ideas, new approaches, and/or groundbreaking results. We prove that DistAI is guaranteed to find the -free inductive invariant that proves the desired safety properties in finite time, if one exists. Session Chairs: Ryan Huang, Johns Hopkins University, and Manos Kapritsos, University of Michigan, Jianan Yao, Runzhou Tao, Ronghui Gu, Jason Nieh, Suman Jana, and Gabriel Ryan, Columbia University. Jason Mohoney and Roger Waleffe, University of WisconsinMadison; Henry Xu, University of Maryland, College Park; Theodoros Rekatsinas and Shivaram Venkataraman, University of WisconsinMadison. Call for Papers. 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). Such centralized engines are in a perfect position to censor content and violate users privacy, undermining some of the key tenets behind decentralization. We describe Fluffy, a multi-transaction differential fuzzer for finding consensus bugs in Ethereum. will work with the steering committee to ensure that the symposium program will accommodate presentations for all accepted papers. 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. We present TEMERAIRE, a hugepage-aware enhancement of TCMALLOC to reduce CPU overheads in the applications code. To resolve the problem, we propose a new LFS-aware ZNS interface, called ZNS+, and its implementation, where the host can offload data copy operations to the SSD to accelerate segment compaction. 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. Table of Contents | She developed the technology for making network routing self-stabilizing, largely self-managing, and scalable. Calibrated interrupts increase throughput by up to 35%, reduce CPU consumption by as much as 30%, and achieve up to 37% lower latency when interrupts are coalesced. Researchers from the Software Systems Laboratory bagged a Best Paper Award at the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2021). 2019 - Present. Reviews will be available for response on Wednesday, March 3, 2021. Federated Learning (FL) is an emerging direction in distributed machine learning (ML) that enables in-situ model training and testing on edge data. 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. Simultaneous submission of the same work to multiple venues, submission of previously published work, or plagiarism constitutes dishonesty or fraud. We also verified a simple NFS server using GoJournals specs, which confirms that they are helpful for application verification: a significant part of the proof doesnt have to consider concurrency and crashes. USENIX new Date().getFullYear()>document.write(new Date().getFullYear()); Grants for Black Computer Science Students Application, Propose an interesting, compelling solution, Demonstrate the practicality and benefits of the solution, Clearly describe the paper's contributions, Clearly articulate the advances beyond previous work. A.H. Hunter, Jane Street Capital; Chris Kennelly, Paul Turner, Darryl Gove, Tipp Moseley, and Parthasarathy Ranganathan, Google. 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. However, Addra improves message latency in this architecture, which is a key performance metric for voice calls. A graph neural network (GNN) enables deep learning on structured graph data. 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. Academic and industrial participants present research and experience papers that cover the full range of theory and practice of computer . (Visa applications can take at least 30 working days to process.) All the times listed below are in Pacific Daylight Time (PDT). We propose PET, the first DNN framework that optimizes tensor programs with partially equivalent transformations and automated corrections. And yet, they continue to rely on centralized search engines and indexers to help users access the content they seek and navigate the apps. However, a plethora of recent data breaches show that even widely trusted service providers can be compromised. Authors may upload supplementary material in files separate from their submissions. Even the little publishable OS work that is not based on Linux still assumes the same simplistic hardware model (essentially a multiprocessor VAX) that bears little resemblance to modern reality. Proceedings Cover | The paper review process is double-blind. A significant obstacle to using SC for practical applications is the memory overhead of the underlying cryptography. Existing decentralized systems like Steemit, OpenBazaar, and the growing number of blockchain apps provide alternatives to existing services. Pollux improves scheduling performance in deep learning (DL) clusters by adaptively co-optimizing inter-dependent factors both at the per-job level and at the cluster-wide level. If you are uncertain about how to anonymize your submission, please contact the program co-chairs, osdi21chairs@usenix.org, well in advance of the submission deadline. 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. At a high level, Addra follows a template in which callers and callees deposit and retrieve messages from private mailboxes hosted at an untrusted server. KEVIN combines a fast, lightweight, and POSIX compliant file system with a key-value storage device that performs in-storage indexing. The 15th USENIX Symposium on Operating Systems Design and Implementation seeks to present innovative, exciting research in computer systems. Camera-ready submission (all accepted papers): 15 Mars 2022. We introduce a hybrid cryptographic protocol for privacy-adhering transformations of encrypted data. Performance experiments show that GoNFS provides similar performance (e.g., at least 90% throughput across several benchmarks on an NVMe disk) to Linuxs NFS server exporting an ext4 file system, suggesting that GoJournal is a competitive journaling system. As a result, data characteristics and device capabilities vary widely across clients. OSDI brings together professionals from academic and industrial backgrounds in a premier forum for discussing the design, implementation, and implications of systems software. 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. We propose Marius, a system for efficient training of graph embeddings that leverages partition caching and buffer-aware data orderings to minimize disk access and interleaves data movement with computation to maximize utilization. OSDI will provide an opportunity for authors to respond to reviews prior to final consideration of the papers at the program committee meeting. 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. The conference papers and full proceedings are available to registered attendees now and will be available to everyone beginning Wednesday, July 14, 2021. 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. blk-switch evaluation over a variety of scenarios shows that it consistently achieves s-scale average and tail latency (at both 99th and 99.9th percentiles), while allowing applications to near-perfectly utilize the hardware capacity. Metadata from voice calls, such as the knowledge of who is communicating with whom, contains rich information about peoples lives. Our evaluation on the SPEC benchmarks shows that SanRazor can reduce the overhead of sanitizers significantly, from 73.8% to 28.062.0% for AddressSanitizer, and from 160.1% to 36.6124.4% for UndefinedBehaviorSanitizer (depending on the applied reduction scheme). A glance at this year's OSDI program shows that Operating Systems are a small niche topic for this conference, not even meriting their own full session. 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. In this talk, I'll speculate on how we came to this unfortunate state of affairs, and what might be done to fix it. Distributed systems are notoriously hard to implement correctly due to non-determinism. OSDI '21 Technical Sessions All the times listed below are in Pacific Daylight Time (PDT). sosp ACM Symposium on Operating Systems Principles. Mothy received a PhD in 1995 from the Computer Laboratory of the University of Cambridge, where he was a principal designer and builder of the Nemesis OS. If the conference registration fee will pose a hardship for the presenter of the accepted paper, please contact conference@usenix.org. Radia Perlman is a Fellow at Dell Technologies. The file system performance of the proposed ZNS+ storage system was 1.33--2.91 times better than that of the normal ZNS-based storage system. While verifying GoJournal, we found one serious concurrency bug, even though GoJournal has many unit tests. We will look at various problems and approaches, and for each, see if blockchain would help. 1 Acknowledgements: Paper prepared for the post-conference workshop on Food for Thought: Economic Analysis in Anticipation of the Next Farm Bill at the Agricultural and Applied Economics Association annual meeting, Austin, TX . Only two types of supplementary material are permitted: source code described in the paper and formal proofs sketched in the paper. Author Response Period The NAL eliminates remote PM accesses to hot items without inducing extra local PM accesses. This kernel is scaled across NUMA nodes using node replication, a scheme inspired by state machine replication in distributed systems. 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. To enable FL developers to interpret their results in model testing, Oort enforces their requirements on the distribution of participant data while improving the duration of federated testing by cherry-picking clients. P3 exposes a simple API that captures many different classes of GNN architectures for generality. You must not improperly identify a PC member as a conflict if none of these three circumstances applies, even if for some other reason you want to avoid them reviewing your paper. Consensus bugs are extremely rare but can be exploited for network split and theft, which cause reliability and security-critical issues in the Ethereum ecosystem. Manuela M. Veloso is the Head of J.P. Morgan AI Research, which pursues fundamental research in areas of core relevance to financial services, including data mining and cryptography, machine learning, explainability, and human-AI interaction. Because DistAI starts with the strongest possible invariants, if the SMT solver fails, DistAI does not need to discard failed invariants, but knows to monotonically weaken them and try again with the solver, repeating the process until it eventually succeeds. These limitations require state-of-the-art systems to distribute training across multiple machines. We convert five state-of-the-art PM indexes using Nap. 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. Jiang Zhang, University of Southern California; Shuai Wang, HKUST; Manuel Rigger, Pinjia He, and Zhendong Su, ETH Zurich. Accepted papers will be allowed 14 pages in the proceedings, plus references. Furthermore, to enable automatic runtime optimization, GNNAdvisor incorporates a lightweight analytical model for an effective design parameter search. Consensus bugs are bugs that make Ethereum clients transition to incorrect blockchain states and fail to reach consensus with other clients. The device then "calibrates" its interrupts to completions of latency-sensitive requests. We propose a learning-based framework that instead explicitly optimizes concurrency control via offline training to maximize performance. We compare Marius against two state-of-the-art industrial systems on a diverse array of benchmarks. Authors must make a good faith effort to anonymize their submissions, and they should not identify themselves or their institutions either explicitly or by implication (e.g., through the references or acknowledgments). Second, it innovates on the underlying cryptographic machinery and constructs a new private information retrieval scheme, FastPIR, that reduces the time to process oblivious access requests for mailboxes. DMon speeds up PostgreSQL, one of the most popular database systems, by 6.64% on average (up to 17.48%). Submission of a response is optional. J.P. Morgan AI Research partners with applied data analytics teams across the firm as well as with leading academic institutions globally. Sat, Aug 7, 2021 3 min read researches review. Copyright to the individual works is retained by the author[s]. (Oct 2018) Awarded an Intel Faculty Grant for Research on automated performance optimization (Sep. 2018) Our paper on Foreshadow is accepted to appear at USENIX Security. In particular, responses must not include new experiments or data, describe additional work completed since submission, or promise additional work to follow. She is the recipient of several best paper awards, the Einstein Chair of the Chinese Academy of Science, the ACM/SIGART Autonomous Agents Research Award, an NSF Career Award, and the Allen Newell Medal for Excellence in Research. 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. We observe that scalability challenges in training GNNs are fundamentally different from that in training classical deep neural networks and distributed graph processing; and that commonly used techniques, such as intelligent partitioning of the graph do not yield desired results. Here, we focus on hugepage coverage. We also show that Marius can scale training to datasets an order of magnitude beyond a single machine's GPU and CPU memory capacity, enabling training of configurations with more than a billion edges and 550 GB of total parameters on a single machine with 16 GB of GPU memory and 64 GB of CPU memory. GoJournals goal is to bring the advantages of journaling for code to specs and proofs. PET discovers and applies program transformations that improve computation efficiency but only maintain partial functional equivalence. Editor in charge: Daniel Petrolia . Manuela will present examples and discuss the scope of AI in her research in the finance domain. Devices employ adaptive interrupt coalescing heuristics that try to balance between these opposing goals. We demonstrate the above using design, implementation and evaluation of blk-switch, a new Linux kernel storage stack architecture. Academic and industrial participants present research and experience papers that cover the full range of theory . All deadline times are 23:59 hrs UTC. We also welcome work that explores the interface to related areas such as computer architecture, networking, programming languages, analytics, and databases. Compared to a state-of-the-art fuzzer, Fluffy improves the fuzzing throughput by 510 and the code coverage by 2.7 with various optimizations: in-process fuzzing, fuzzing harnesses for Ethereum clients, and semantic-aware mutation that reduces erroneous test cases. This formulation of memory management, which we call memory programming, is a generalization of paging that allows MAGE to provide a highly efficient virtual memory abstraction for SC. Fan Lai, Xiangfeng Zhu, Harsha V. Madhyastha, and Mosharaf Chowdhury, University of Michigan.