OSDI 2021
最佳论文：
Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learning
MAGE: Nearly Zero-Cost Virtual Memory for Secure Computation
DistAI: Data-Driven Automated Invariant Learning for Distributed Protocols
SOSP 2021
最佳论文：
LineFS: Efficient SmartNIC Offload of a Distributed File System with Pipeline Parallelism
Using Lightweight Formal Methods to Validate a Key-Value Storage Node in Amazon S3
SIGCOMM 2021
最佳论文：
- Seven Years in the Life of Hypergiants’ Off-Nets
NSDI 2021
最佳论文：
- ATP: In-network Aggregation for Multi-tenant Learning
ATC 2021
最佳论文：
- Argus: Debugging Performance Issues in Modern Desktop Applications with Annotated Causal Tracing
- INFaaS: Automated Model-less Inference Serving
- Scaling Large Production Clusters with Partitioned Synchronization
FAST 2021
最佳论文：
- High Velocity Kernel File Systems with Bento
EuroSys 2021
Edsger W. Dijkstra Prize 2021
- Paris C. Kanellakis and Scott A. Smolka for “CCS Expressions, Finite State Processes, and Three Problems of Equivalence” in Information and Computation, Volume 86, Issue 1, pages 43–68, 1990.