<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Distributed-Systems on Publish Assistant</title><link>https://pub.sqrt.fr/vincent/publish-assistant/tags/distributed-systems/</link><description>Recent content in Distributed-Systems on Publish Assistant</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 20 Jul 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://pub.sqrt.fr/vincent/publish-assistant/tags/distributed-systems/index.xml" rel="self" type="application/rss+xml"/><item><title>HPDC 2025 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/hpdc-2025/</link><pubDate>Sun, 20 Jul 2025 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/hpdc-2025/</guid><description>&lt;p&gt;10 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="parameterized-algorithms-for-non-uniform-all-to-all"&gt;Parameterized Algorithms for Non-uniform All-to-all&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Ke Fan, Jens Domke, Seydou Ba, Sidharth Kumar&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Introduces parameterized algorithms that adapt non-uniform all-to-all collective communication to heterogeneous network topologies, reducing message contention and improving throughput.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Non-uniform all-to-all is a performance bottleneck in many HPC applications; topology-aware parameterization directly benefits MPI implementations on dragonfly and fat-tree networks at scale.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://doi.org/10.1145/3731545.3731590"&gt;→ Read paper&lt;/a&gt;
&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="dpu-kv-on-the-benefits-of-dpu-offloading-for-in-memory-key-value-stores-at-the-edge"&gt;DPU-KV: On the Benefits of DPU Offloading for In-Memory Key-Value Stores at the Edge&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Arjun Kashyap, Yuke Li 0003, Xiaoyi Lu 0001&lt;/em&gt;&lt;/p&gt;</description></item><item><title>IPDPS 2025 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/ipdps-2025/</link><pubDate>Mon, 19 May 2025 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/ipdps-2025/</guid><description>&lt;p&gt;12 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="enhancing-ompss-2-suspendable-tasks-by-combining-operating-system-and-user-level-threads-with-c-coroutines"&gt;Enhancing OmpSs-2 Suspendable Tasks by Combining Operating System and User-Level Threads with C++ Coroutines&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Arnau Cinca, Aleix Roca, Kevin Sala, Raúl Peñacoba Veigas &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Extends the OmpSs-2 task-based runtime with C++ coroutines to implement suspendable tasks that can yield while blocked on I/O or communication without stalling the OS thread.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Suspendable tasks are a key missing primitive for overlapping computation and communication in task-graph runtimes; the hybrid OS/user-level thread design avoids the overhead of full context switches while remaining portable, with broad implications for OpenMP-style programming on modern heterogeneous nodes.&lt;/p&gt;</description></item><item><title>NSDI 2025 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/nsdi-2025/</link><pubDate>Mon, 28 Apr 2025 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/nsdi-2025/</guid><description>&lt;p&gt;13 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="pred-performance-oriented-random-early-detection-for-consistently-stable-performance-in-datacenters"&gt;PRED: Performance-oriented Random Early Detection for Consistently Stable Performance in Datacenters&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Xinle Du, Tong Li 0014, Guangmeng Zhou, Zhuotao Liu &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — PRED redesigns AQM by making drop probability a direct function of per-flow performance targets rather than queue length, eliminating the instability of classic RED in modern datacenter workloads.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — RED has been a cornerstone of congestion control for decades; PRED&amp;rsquo;s performance-centric reformulation challenges a long-held design axiom and demonstrates significantly lower tail latency at scale. It opens the door to intent-driven AQM as a first-class primitive in datacenter switches.&lt;/p&gt;</description></item><item><title>EuroSys 2025 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/eurosys-2025/</link><pubDate>Sun, 30 Mar 2025 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/eurosys-2025/</guid><description>&lt;p&gt;13 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="empowering-webassembly-with-thin-kernel-interfaces"&gt;Empowering WebAssembly with Thin Kernel Interfaces&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Arjun Ramesh, Tianshu Huang, Ben L. Titzer, Anthony Rowe 0001&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — A new OS interface design exposes thin, capability-based kernel primitives directly to WebAssembly modules, eliminating the POSIX translation layer.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — WebAssembly is increasingly used beyond the browser as a portable, sandboxed compute substrate; this work shows that rethinking the system interface from scratch yields significantly lower overhead and better safety properties than layering Wasm on top of POSIX.&lt;/p&gt;</description></item><item><title>Middleware 2024 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/middleware-2024/</link><pubDate>Mon, 02 Dec 2024 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/middleware-2024/</guid><description>&lt;p&gt;11 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="chasing-lightspeed-consensus-fast-wide-area-byzantine-replication-with-mercury"&gt;Chasing Lightspeed Consensus: Fast Wide-Area Byzantine Replication with Mercury&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Christian Berger 0006, Lívio Rodrigues, Hans P. Reiser, Vinicius Vielmo Cogo &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Mercury is a wide-area Byzantine fault-tolerant replication protocol that minimises latency by exploiting geographic locality and pipelining to approach the theoretical lightspeed bound.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Achieving near-lightspeed latency in Byzantine replication across wide-area networks has been a long-standing open challenge; Mercury&amp;rsquo;s design demonstrates it is practically attainable. The result raises the bar for what production BFT middleware can deliver in geo-distributed deployments.&lt;/p&gt;</description></item><item><title>SOSP 2024 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/sosp-2024/</link><pubDate>Tue, 05 Nov 2024 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/sosp-2024/</guid><description>&lt;p&gt;13 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="verus-a-practical-foundation-for-systems-verification"&gt;Verus: A Practical Foundation for Systems Verification&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Andrea Lattuada 0001, Travis Hance, Jay Bosamiya, Matthias Brun 0002 &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Verus is a Rust-based verification framework that makes formal proofs of low-level systems code tractable at scale, covering memory safety, functional correctness, and concurrency.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Formal verification of real systems code has long been impractical; Verus closes the usability gap by integrating SMT-based proofs directly into a systems programming language, making it the most broadly applicable verification tool for the OS community to date.&lt;/p&gt;</description></item><item><title>SoCC 2024 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/socc-2024/</link><pubDate>Fri, 01 Nov 2024 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/socc-2024/</guid><description>&lt;p&gt;12 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="queue-management-for-slo-oriented-large-language-model-serving"&gt;Queue Management for SLO-Oriented Large Language Model Serving&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Archit Patke, Dhemath Reddy, Saurabh Jha, Haoran Qiu &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — A queue management framework that enforces latency SLOs for LLM serving by dynamically routing and prioritizing requests across heterogeneous inference capacity.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — As LLM deployments move into production clouds, meeting strict time-to-first-token and total latency SLOs becomes critical; this work directly addresses that gap with a practical, deployable solution. It is one of the first papers to treat LLM serving as a cloud SLO-management problem rather than a pure model-optimization problem.&lt;/p&gt;</description></item><item><title>OSDI 2024 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/osdi-2024/</link><pubDate>Wed, 10 Jul 2024 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/osdi-2024/</guid><description>&lt;p&gt;11 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="distserve-disaggregating-prefill-and-decoding-for-goodput-optimized-large-language-model-serving"&gt;DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Yinmin Zhong, Shengyu Liu, Junda Chen, Jianbo Hu &lt;em&gt;et al.&lt;/em&gt;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Separates the compute-heavy prefill phase from the memory-bound decoding phase onto different GPU pools, eliminating head-of-line blocking and significantly improving LLM serving throughput.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Became one of the most influential LLM systems papers of 2024; the prefill–decode disaggregation insight is now widely adopted in production inference stacks (vLLM, SGLang, etc.).&lt;/p&gt;</description></item><item><title>CCGrid 2024 Digest</title><link>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/ccgrid-2024/</link><pubDate>Mon, 06 May 2024 00:00:00 +0000</pubDate><guid>https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/ccgrid-2024/</guid><description>&lt;p&gt;10 papers selected.&lt;/p&gt;
&lt;hr&gt;
&lt;h3 id="fair-efficient-multi-resource-scheduling-for-stateless-serverless-functions-with-anubis"&gt;Fair, Efficient Multi-Resource Scheduling for Stateless Serverless Functions with Anubis&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Amit Samanta 0001, Ryan Stutsman&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Anubis introduces a fair, multi-resource scheduler for stateless serverless functions that achieves efficiency without sacrificing isolation between tenants.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Why notable&lt;/strong&gt; — Fairness in serverless resource allocation is an open problem as functions compete for heterogeneous resources (CPU, memory, I/O); Anubis provides a concrete, deployable answer. The work directly addresses a gap in production FaaS platforms where existing schedulers optimize for throughput but ignore per-tenant equity.&lt;/p&gt;</description></item></channel></rss>