- Sponsor:
- sigops
This year's program features exciting developments along key aspects of systems research. The accepted papers present the latest advances in systems for machine learning, distributed systems, security, concurrency and failure tolerance, storage systems, operating systems, and cloud infrastructure.
Proceeding Downloads
DAMYSUS: streamlined BFT consensus leveraging trusted components
Recently, streamlined Byzantine Fault Tolerant (BFT) consensus protocols, such as HotStuff, have been proposed as a means to circumvent the inefficient view-changes of traditional BFT protocols, such as PBFT. Several works have detailed trusted ...
State machine replication scalability made simple
Consensus, state machine replication (SMR) and total order broadcast (TOB) protocols are notorious for being poorly scalable with the number of participating nodes. Despite the recent race to reduce overall message complexity of leader-driven SMR/TOB ...
Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus
We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-...
Building an efficient key-value store in a flexible address space
Data management applications store their data using structured files in which data are usually sorted to serve indexing and queries. However, in-place insertions and removals of data are not naturally supported in a file's address space. To avoid ...
Rolis: a software approach to efficiently replicating multi-core transactions
This paper presents Rolis, a new speedy and fault-tolerant replicated multi-core transactional database system. Rolis's aim is to mask the high cost of replication by ensuring that cores are always doing useful work and not waiting for each other or for ...
Tebis: index shipping for efficient replication in LSM key-value stores
Key-value (KV) stores based on LSM tree have become a foundational layer in the storage stack of datacenters and cloud services. Current approaches for achieving reliability and availability favor reducing network traffic and send to replicas only new ...
Sharing is caring: secure and efficient shared memory support for MVEEs
Multi-Variant Execution Environments (MVEEs) are a powerful tool for protecting legacy software against memory corruption attacks. MVEEs employ software diversity to run multiple variants of the same program in lockstep, whilst providing them with the ...
Hardening binaries against more memory errors
Memory errors, such as buffer overflows and use-after-free, remain the root cause of many security vulnerabilities in modern software. The use of closed source software further exacerbates the problem, as source-based memory error mitigation cannot be ...
PKRU-safe: automatically locking down the heap between safe and unsafe languages
- Paul Kirth,
- Mitchel Dickerson,
- Stephen Crane,
- Per Larsen,
- Adrian Dabrowski,
- David Gens,
- Yeoul Na,
- Stijn Volckaert,
- Michael Franz
After more than twenty-five years of research, memory safety violations remain one of the major causes of security vulnerabilities in real-world software. Memory-safe languages, like Rust, have demonstrated that compiler technology can assist developers ...
KASLR in the age of MicroVMs
Address space layout randomization (ASLR) is a widely used component of computer security aimed at preventing code reuse and/or data-only attacks. Modern kernels utilize kernel ASLR (KASLR) and finer-grained forms, such as functional granular KASLR (...
Nyx-net: network fuzzing with incremental snapshots
Coverage-guided fuzz testing ("fuzzing") has become mainstream and we have observed lots of progress in this research area recently. However, it is still challenging to efficiently test network services with existing coverage-guided fuzzing methods. In ...
DeepRest: deep resource estimation for interactive microservices
Interactive microservices expose API endpoints to be invoked by users. For such applications, precisely estimating the resources required to serve specific API traffic is challenging. This is because an API request can interact with different components ...
Unicorn: reasoning about configurable system performance through the lens of causality
Modern computer systems are highly configurable, with the total variability space sometimes larger than the number of atoms in the universe. Understanding and reasoning about the performance behavior of highly configurable systems, over a vast and ...
Multi-objective congestion control
Decades of research on Internet congestion control (CC) have produced a plethora of algorithms that optimize for different performance objectives. Applications face the challenge of choosing the most suitable algorithm based on their needs, and it takes ...
Hybrid anomaly detection and prioritization for network logs at cloud scale
Monitoring the health of large-scale systems requires significant manual effort, usually through the continuous curation of alerting rules based on keywords, thresholds and regular expressions, which might generate a flood of mostly irrelevant alerts ...
Performance evolution of mitigating transient execution attacks
Today's applications pay a performance penalty for mitigations to protect against transient execution attacks such as Meltdown [32] and Spectre [25]. Such a reduction in performance directly translates to higher operating costs and degraded user ...
You shall not (by)pass!: practical, secure, and fast PKU-based sandboxing
Memory Protection Keys for Userspace (PKU) is a recent hardware feature that allows programs to assign virtual memory pages to protection domains, and to change domain access permissions using inexpensive, unprivileged instructions. Several in-process ...
Verified programs can party: optimizing kernel extensions via post-verification merging
Operating system (OS) extensions are more popular than ever. For example, Linux BPF is marketed as a "superpower" that allows user programs to be downloaded into the kernel, verified to be safe and executed at kernel hook points. So, BPF extensions have ...
Minimum viable device drivers for ARM trustzone
While TrustZone can isolate IO hardware, it lacks drivers for modern IO devices. Rather than porting drivers, we propose a novel approach to deriving minimum viable drivers: developers exercise a full driver and record the driver/device interactions; ...
OPEC: operation-based security isolation for bare-metal embedded systems
Bare-metal embedded systems usually lack security isolation. Attackers can subvert the whole system with a single vulnerability. Previous research intends to enforce both privilege isolation (to run application code at the unprivileged level) and ...
LiteReconfig: cost and content aware reconfiguration of video object detection systems for mobile GPUs
An adaptive video object detection system selects different execution paths at runtime, based on video content and available resources, so as to maximize accuracy under a target latency objective (e.g., 30 frames per second). Such a system is well ...
Slashing the disaggregation tax in heterogeneous data centers with FractOS
- Lluís Vilanova,
- Lina Maudlej,
- Shai Bergman,
- Till Miemietz,
- Matthias Hille,
- Nils Asmussen,
- Michael Roitzsch,
- Hermann Härtig,
- Mark Silberstein
Disaggregated heterogeneous data centers promise higher efficiency, lower total costs of ownership, and more flexibility for data-center operators. However, current software stacks can levy a high tax on application performance. Applications and OSes ...
OS scheduling with nest: keeping tasks close together on warm cores
- Julia Lawall,
- Himadri Chhaya-Shailesh,
- Jean-Pierre Lozi,
- Baptiste Lepers,
- Willy Zwaenepoel,
- Gilles Muller
To best support highly parallel applications, Linux's CFS scheduler tends to spread tasks across the machine on task creation and wakeup. It has been observed, however, that in a server environment, such a strategy leads to tasks being unnecessarily ...
Kite: lightweight critical service domains
Converged multi-level secure (MLS) systems, such as Qubes OS or SecureView, heavily rely on virtualization and service virtual machines (VMs). Traditionally, driver domains - isolated VMs that run device drivers - and daemon VMs use full-blown general-...
Fleche: an efficient GPU embedding cache for personalized recommendations
Deep learning based models have dominated current production recommendation systems. However, the gap between CPU-side DRAM data accessing and GPU processing still impedes their inference performance. GPU-resident cache can bridge this gap, but we find ...
GNNLab: a factored system for sample-based GNN training over GPUs
We propose GNNLab, a sample-based GNN training system in a single machine multi-GPU setup. GNNLab adopts a factored design for multiple GPUs, where each GPU is dedicated to the task of graph sampling or model training. It accelerates both tasks by ...
Out-of-order backprop: an effective scheduling technique for deep learning
Neural network training requires a large amount of computation and thus GPUs are often used for the acceleration. While they improve the performance, GPUs are underutilized during the training. This paper proposes out-of-order (ooo) back-prop, an ...
D3: a dynamic deadline-driven approach for building autonomous vehicles
Autonomous vehicles (AVs) must drive across a variety of challenging environments that impose continuously-varying deadlines and runtime-accuracy tradeoffs on their software pipelines. A deadline-driven execution of such AV pipelines requires a new ...
Varuna: scalable, low-cost training of massive deep learning models
Systems for training massive deep learning models (billions of parameters) today assume and require specialized "hyperclusters": hundreds or thousands of GPUs wired with specialized high-bandwidth interconnects such as NV-Link and Infiniband. Besides ...
Characterizing the performance of intel optane persistent memory: a close look at its on-DIMM buffering
We present a comprehensive and in-depth study of Intel Optane DC persistent memory (DCPMM). Our focus is on exploring the internal design of Optane's on-DIMM read-write buffering and its impacts on application-perceived performance, read and write ...
Index Terms
- Proceedings of the Seventeenth European Conference on Computer Systems
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
EuroSys '21 | 181 | 38 | 21% |
EuroSys '20 | 234 | 43 | 18% |
EuroSys '18 | 262 | 43 | 16% |
EuroSys '16 | 180 | 38 | 21% |
EuroSys '14 | 147 | 27 | 18% |
EuroSys '13 | 143 | 28 | 20% |
EuroSys '11 | 161 | 24 | 15% |
Overall | 1,308 | 241 | 18% |