Weekly CS Paper Digest — Jun 14 – Jun 20, 2026

Weekly Paper Notes — one of the top picks from the 2026-06-20 CS paper digest. Area: Distributed Computing. Authors: Jiasheng Zhou, Longbin Zeng, Clavis Chen, Ruiming Lu et al. arXiv: 2606.20374 · PDF TL;DR ARGUS is a tracing and performance-diagnosis system designed for always-on operation on production LLM training clusters with more than 10,000 GPUs. The central insight is that no single profiler can be cheap, deep, and continuous all at once — so ARGUS decomposes observation along the training call hierarchy into three independent collection channels: CPU call stacks, framework semantics, and GPU kernel execution....

Weekly Paper Notes — one of the top picks from the 2026-06-20 CS paper digest. Area: Databases / Systems. Authors: Georg Kreuzmayr (TigerBeetle), Muhammad El-Hindi (TUM), Benjamin Wagner (Firebolt), Tobias Ziegler (TigerBeetle), Viktor Leis (TUM) arXiv: 2606.19969 · PDF TL;DR For two decades distributed database systems treated the network as an opaque, kernel-managed pipe and the kernel TCP stack was fast enough that this abstraction was free. It isn’t anymore....

Seminal Paper of the Week — the paper that quietly defined what “cloud storage” looks like from the inside. Authors: Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung (Google) Published: SOSP ‘03 — 19th ACM Symposium on Operating Systems Principles, October 2003. Canonical link: The Google File System (Google research mirror) · ACM DOI 10.1145/945445.945450 TL;DR In 2003, Ghemawat, Gobioff and Leung described how Google was running a multi-thousand-node, petabyte-scale distributed file system on commodity hardware — and how the design assumptions diverged so sharply from the established POSIX-file-system lineage that almost every architectural decision in the paper looks like a heresy until you read the workload section....

Weekly Paper Notes — one of the top picks from the 2026-06-13 CS paper digest. Area: Operating Systems / Systems. Authors: Zhuoping Yang, Yiyu Shi, Alex Jones arXiv: 2606.06697 · PDF TL;DR The GPU has quietly become a multi-tenant device — applications no longer just dispatch compute kernels, they call into vendor libraries (cuFFT, cuBLAS, NCCL), interact with GPU-resident services, and touch storage and network adapters through GPUDirect paths. But the CUDA programming model still hands each process the full keys to the device: its own context, raw device pointers, runtime handles, module loader, and direct kernel launch....

Weekly Paper Notes — one of the top picks from the 2026-06-13 CS paper digest. Area: Distributed Computing. Authors: Samuel Erickson, Mikael Johansson (KTH) arXiv: 2606.13287 · PDF TL;DR In asynchronous SGD (ASGD), workers compute gradients on possibly stale parameters and push updates without waiting for slow peers. That’s how you keep all the GPUs busy, but it’s also how slow workers (“stragglers”) inject large delays into the update stream, which classical analyses say should slow convergence in proportion to the maximum delay across the workers....

Seminal Paper of the Week — a foundational systems paper that quietly shapes how every distributed system you use is layered. Authors: Jerome H. Saltzer, David P. Reed, David D. Clark (MIT) Published: ACM Transactions on Computer Systems 2(4), November 1984. Canonical link: End-to-End Arguments in System Design (MIT) · ACM DOI 10.1145/357401.357402 TL;DR The end-to-end argument is a layering principle: a function should be implemented in a lower layer of a system only when it can be completely and correctly implemented at that layer, and when implementing it there provides a clear performance benefit over implementing it at the endpoints....

Weekly Paper Notes — Seminal Paper of the Week for the 2026-06-06 CS paper digest. Area: Distributed Systems / Databases. Citation: Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels — Dynamo: Amazon’s Highly Available Key-value Store. SOSP ‘07. DOI: 10.1145/1294261.1294281 Canonical PDF: Amazon Dynamo paper (Werner Vogels’ archive) Why the paper still matters Almost every popular “NoSQL” key-value store of the last fifteen years — Cassandra, Riak, Voldemort, DynamoDB (the service), early versions of Redis Cluster, parts of MongoDB’s replica routing — pulls its core design vocabulary directly from Dynamo: consistent hashing for partitioning, vector clocks for divergence tracking, sloppy quorums with hinted handoff for availability under failure, and read repair / Merkle-tree anti-entropy for eventual convergence....

Weekly Paper Notes — one of the top picks from the 2026-06-06 CS paper digest. Area: AI / ML. Authors: Akarsh Kumar, Phillip Isola (MIT) arXiv: 2606.06479 · PDF TL;DR This paper proposes Supervised Memory Training (SMT), a way to pretrain nonlinear RNNs without ever doing backpropagation through time (BPTT). The trick: replace recurrent credit assignment with a supervised problem over memory transitions. A Transformer-based “memory encoder” is first trained with a predictive-state objective — it learns a representation m_t that retains exactly the information about the past needed to predict the future....

Weekly Paper Notes — one of the top picks from the 2026-06-06 CS paper digest. Area: NLP / Systems-for-ML. Authors: Yutao Sun, Yanqi Zhang, Li Dong, et al. (Microsoft Research Asia) arXiv: 2606.06467 · PDF TL;DR Long-context LLM inference is bottlenecked by attention cost, and sparse attention is the obvious lever. The two existing families both disappoint in practice: block-sparse patterns (sliding window, dilated, etc.) give clean speedups but lose quality, while token-sparse patterns (top-k over the KV cache) preserve quality but spend most of the budget deciding which tokens to attend to — the routing itself becomes the bottleneck....