29 lines
27 KiB
HTML
29 lines
27 KiB
HTML
<!doctype html><html lang=en dir=auto data-theme=auto><head><meta charset=utf-8><meta http-equiv=X-UA-Compatible content="IE=edge"><meta name=viewport content="width=device-width,initial-scale=1,shrink-to-fit=no"><meta name=robots content="index, follow"><title>JPDC 2025 Digest | Publish Assistant</title><meta name=keywords content><meta name=description content="12 papers selected.
|
||
|
||
Throughput of Byzantine Broadcast
|
||
Ruomu Hou, Haifeng Yu, Prateek Saxena
|
||
TL;DR — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.
|
||
Why notable — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.
|
||
|
||
How to reduce the number of steps for (multi-valued validated) Byzantine agreement?
|
||
Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 et al."><meta name=author content="Publish Assistant"><link rel=canonical href=https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/jpdc-2025/><link crossorigin=anonymous href=/vincent/publish-assistant/assets/css/stylesheet.d72f07832e13c592b3edba91680bfe70f01daac396179bcace0ac36e8e0494c6.css integrity="sha256-1y8Hgy4TxZKz7bqRaAv+cPAdqsOWF5vKzgrDbo4ElMY=" rel="preload stylesheet" as=style><link rel=icon href=https://pub.sqrt.fr/vincent/publish-assistant/favicon.ico><link rel=icon type=image/png sizes=16x16 href=https://pub.sqrt.fr/vincent/publish-assistant/favicon-16x16.png><link rel=icon type=image/png sizes=32x32 href=https://pub.sqrt.fr/vincent/publish-assistant/favicon-32x32.png><link rel=apple-touch-icon href=https://pub.sqrt.fr/vincent/publish-assistant/apple-touch-icon.png><link rel=mask-icon href=https://pub.sqrt.fr/vincent/publish-assistant/safari-pinned-tab.svg><meta name=theme-color content="#2e2e33"><meta name=msapplication-TileColor content="#2e2e33"><link rel=alternate hreflang=en href=https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/jpdc-2025/><noscript><style>#theme-toggle,.top-link{display:none}</style><style>@media(prefers-color-scheme:dark){:root{--theme:rgb(29, 30, 32);--entry:rgb(46, 46, 51);--primary:rgb(218, 218, 219);--secondary:rgb(155, 156, 157);--tertiary:rgb(65, 66, 68);--content:rgb(196, 196, 197);--code-block-bg:rgb(46, 46, 51);--code-bg:rgb(55, 56, 62);--border:rgb(51, 51, 51);color-scheme:dark}.list{background:var(--theme)}.toc{background:var(--entry)}}</style></noscript><script>localStorage.getItem("pref-theme")==="dark"?document.querySelector("html").dataset.theme="dark":localStorage.getItem("pref-theme")==="light"?document.querySelector("html").dataset.theme="light":window.matchMedia("(prefers-color-scheme: dark)").matches?document.querySelector("html").dataset.theme="dark":document.querySelector("html").dataset.theme="light"</script><meta property="og:url" content="https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/jpdc-2025/"><meta property="og:site_name" content="Publish Assistant"><meta property="og:title" content="JPDC 2025 Digest"><meta property="og:description" content="12 papers selected.
|
||
Throughput of Byzantine Broadcast Ruomu Hou, Haifeng Yu, Prateek Saxena
|
||
TL;DR — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.
|
||
Why notable — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.
|
||
How to reduce the number of steps for (multi-valued validated) Byzantine agreement? Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 et al."><meta property="og:locale" content="en_us"><meta property="og:type" content="article"><meta property="article:section" content="cloud-edge"><meta property="article:published_time" content="2025-01-01T00:00:00+00:00"><meta property="article:modified_time" content="2025-01-01T00:00:00+00:00"><meta name=twitter:card content="summary"><meta name=twitter:title content="JPDC 2025 Digest"><meta name=twitter:description content="12 papers selected.
|
||
Throughput of Byzantine Broadcast Ruomu Hou, Haifeng Yu, Prateek Saxena
|
||
TL;DR — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.
|
||
Why notable — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.
|
||
How to reduce the number of steps for (multi-valued validated) Byzantine agreement? Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 et al."><script type=application/ld+json>{"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Edge and Cloud Systems","item":"https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/"},{"@type":"ListItem","position":2,"name":"Digests","item":"https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/"},{"@type":"ListItem","position":3,"name":"JPDC 2025 Digest","item":"https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/jpdc-2025/"}]}</script><script type=application/ld+json>{"@context":"https://schema.org","@type":"BlogPosting","headline":"JPDC 2025 Digest","name":"JPDC 2025 Digest","description":"12 papers selected.\nThroughput of Byzantine Broadcast Ruomu Hou, Haifeng Yu, Prateek Saxena\nTL;DR — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.\nWhy notable — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.\nHow to reduce the number of steps for (multi-valued validated) Byzantine agreement? Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 et al.\n","keywords":[],"articleBody":"12 papers selected.\nThroughput of Byzantine Broadcast Ruomu Hou, Haifeng Yu, Prateek Saxena\nTL;DR — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.\nWhy notable — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.\nHow to reduce the number of steps for (multi-valued validated) Byzantine agreement? Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 et al.\nTL;DR — Presents new Byzantine agreement protocols that lower the step complexity for multi-valued and validated variants, breaking barriers that have stood since the classical results.\nWhy notable — Step complexity is a fundamental metric for distributed agreement; reducing it has direct implications for consensus latency in blockchains and replicated systems.\nLocating a black hole in a dynamic ring Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro\nTL;DR — Solves the black-hole search problem on rings whose topology changes over time, establishing the agent and time complexity of locating a fatal node in a dynamic distributed environment.\nWhy notable — Extends a classic distributed exploration problem to dynamic graphs, requiring new algorithmic techniques that are broadly applicable to fault detection in evolving networks.\nDispersion of mobile robots on directed anonymous graphs Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma\nTL;DR — Characterizes the necessary and sufficient conditions for a group of mobile robots to disperse to distinct nodes of a directed anonymous graph, and provides optimal algorithms.\nWhy notable — Directed anonymous graphs model asymmetric communication networks; the dispersion problem’s resolution here advances the theory of autonomous distributed agents.\nQPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements Victor Jarlow, Charalampos Stylianopoulos, Marina Papatriantafilou\nTL;DR — Redesigns the Space-Saving frequent-elements sketch for concurrent shared-memory execution, achieving high query throughput alongside update throughput without sacrificing approximation accuracy.\nWhy notable — Bridges the gap between approximate streaming data structures and parallel execution, demonstrating that heavy-hitter summaries can scale on multicore without significant accuracy loss.\nA parallel algorithm for minimum weight set cover with small neighborhood property Yingli Ran, Yaoyao Zhang, Zhao Zhang 0002\nTL;DR — Gives a parallel approximation algorithm for minimum weight set cover instances where sets have bounded neighborhood size, achieving near-optimal approximation ratio in poly-logarithmic rounds.\nWhy notable — Expands the frontier of problems admitting efficient parallel approximation, with implications for distributed network optimization where local structure can be exploited.\nOptimizing parallel heterogeneous system efficiency: Dynamic task graph adaptation with recursive tasks Nathalie Furmento, Abdou Guermouche, Gwenolé Lucas, Thomas Morin et al.\nTL;DR — Extends task-graph runtime systems to support recursive task generation, enabling dynamic adaptation of the task graph structure to improve load balance on heterogeneous CPU-GPU platforms.\nWhy notable — Recursive task parallelism is essential for divide-and-conquer workloads; integrating it into heterogeneous runtimes closes a major gap in practical parallel programming models.\nA scheduler to foster data locality for GPU and out-of-core task-based linear algebra applications Maxime Gonthier, Loris Marchal, Samuel Thibault\nTL;DR — Proposes a data-locality-aware scheduler for task-based dense linear algebra that simultaneously manages GPU memory and out-of-core data transfers to minimize data movement.\nWhy notable — Data movement dominates cost in large linear algebra computations; the scheduler’s dual handling of GPU memory and disk I/O makes it practically relevant for exascale workloads.\nLeveraging Multi-Instance GPUs through moldable task scheduling Jorge Villarrubia, Luis Costero, Francisco D. Igual, Katzalin Olcoz\nTL;DR — Develops a moldable task scheduling framework that dynamically partitions GPU compute across concurrent tasks using NVIDIA’s Multi-Instance GPU feature to improve overall throughput.\nWhy notable — MIG is a critical hardware feature for multi-tenant GPU clusters; this work provides the first scheduling framework that exploits it through principled moldable-task theory.\nIntegration framework for online thread throttling with thread and page mapping on NUMA systems Janaina Schwarzrock, Hiago Mayk G. de A. Rocha, Arthur Francisco Lorenzon, Samuel Xavier de Souza et al.\nTL;DR — Combines online thread-count throttling with NUMA-aware thread and page placement in a unified runtime framework, adaptively co-optimizing both dimensions to maximize performance.\nWhy notable — Thread throttling and NUMA placement are typically managed independently; their joint online optimization yields measurable gains that neither technique alone achieves.\nTo repair or not to repair: Assessing fault resilience in MPI stencil applications Roberto Rocco, Elisabetta Boella, Daniele Gregori, Gianluca Palermo\nTL;DR — Systematically evaluates the cost-benefit trade-off between full fault recovery and partial resilience strategies for MPI stencil computations under process failures.\nWhy notable — Provides practitioners with a principled decision framework for resilience in HPC applications, showing when expensive full recovery is justified versus cheaper degraded-mode execution.\nA lightweight RDMA connection protocol based on post-hoc confirmation Ke Wu 0003, Dezun Dong, Weixia Xu 0001\nTL;DR — Designs an RDMA connection protocol that defers acknowledgment to post-operation confirmation, drastically reducing connection setup overhead for short-lived high-frequency transfers.\nWhy notable — RDMA setup latency is a critical bottleneck in disaggregated memory and distributed storage systems; this protocol’s approach generalizes to any latency-sensitive fabric.\n","wordCount":"835","inLanguage":"en","datePublished":"2025-01-01T00:00:00Z","dateModified":"2025-01-01T00:00:00Z","author":{"@type":"Person","name":"Publish Assistant"},"mainEntityOfPage":{"@type":"WebPage","@id":"https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/jpdc-2025/"},"publisher":{"@type":"Organization","name":"Publish Assistant","logo":{"@type":"ImageObject","url":"https://pub.sqrt.fr/vincent/publish-assistant/favicon.ico"}}}</script></head><body id=top><header class=header><nav class=header-nav><div class=logo><a href=https://pub.sqrt.fr/vincent/publish-assistant/ accesskey=h title="Publish Assistant (Alt + H)">Publish Assistant</a>
|
||
<span class=logo-sep>/</span>
|
||
<a class=logo-topic href=/vincent/publish-assistant/cloud-edge/ title="Edge and Cloud Systems">Edge and Cloud Systems</a><div class=logo-switches><button id=theme-toggle class=theme-toggle accesskey=t title="(Alt + T)" aria-label="Toggle theme">
|
||
<svg class="moon" width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M21 12.79A9 9 0 1111.21 3 7 7 0 0021 12.79z"/></svg>
|
||
<svg class="sun" width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><circle cx="12" cy="12" r="5"/><line x1="12" y1="1" x2="12" y2="3"/><line x1="12" y1="21" x2="12" y2="23"/><line x1="4.22" y1="4.22" x2="5.64" y2="5.64"/><line x1="18.36" y1="18.36" x2="19.78" y2="19.78"/><line x1="1" y1="12" x2="3" y2="12"/><line x1="21" y1="12" x2="23" y2="12"/><line x1="4.22" y1="19.78" x2="5.64" y2="18.36"/><line x1="18.36" y1="5.64" x2="19.78" y2="4.22"/></svg></button></div></div><ul id=menu class=menu><li><a href=/vincent/publish-assistant/cloud-edge/venues/ title=Venues><span>Venues</span></a></li><li><a href=/vincent/publish-assistant/cloud-edge/calendar/ title=Calendar><span>Calendar</span></a></li><li><a href=/vincent/publish-assistant/cloud-edge/digests/ title=Digests><span class=active>Digests</span></a></li></ul></nav></header><main class=main><article class=post-single><header class=post-header><nav class=breadcrumbs role=navigation aria-label=Breadcrumb><a href=/vincent/publish-assistant/cloud-edge/digests/>Digests</a>
|
||
<svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="feather feather-chevron-right"><polyline points="9 18 15 12 9 6"/></svg></nav><h1 class="post-title entry-hint-parent">JPDC 2025 Digest</h1><div class=post-meta><span title='2025-01-01 00:00:00 +0000 UTC'>January 1, 2025</span> · <span>Publish Assistant</span></div></header><div class="post-content md-content"><p>12 papers selected.</p><hr><h3 id=throughput-of-byzantine-broadcast>Throughput of Byzantine Broadcast<a hidden class=anchor aria-hidden=true href=#throughput-of-byzantine-broadcast>#</a></h3><p><em>Ruomu Hou, Haifeng Yu, Prateek Saxena</em></p><p><strong>TL;DR</strong> — Establishes tight throughput bounds for Byzantine broadcast protocols and constructs algorithms that saturate those bounds, separating throughput from latency in the fault-tolerant broadcast landscape.</p><p><strong>Why notable</strong> — Provides the first rigorous throughput characterization of Byzantine broadcast, a fundamental primitive whose capacity limits were previously unquantified.</p><hr><h3 id=how-to-reduce-the-number-of-steps-for-multi-valued-validated-byzantine-agreement>How to reduce the number of steps for (multi-valued validated) Byzantine agreement?<a hidden class=anchor aria-hidden=true href=#how-to-reduce-the-number-of-steps-for-multi-valued-validated-byzantine-agreement>#</a></h3><p><em>Baohan Huang, Haibin Zhang, Chao Liu 0039, Shengli Liu 0001 <em>et al.</em></em></p><p><strong>TL;DR</strong> — Presents new Byzantine agreement protocols that lower the step complexity for multi-valued and validated variants, breaking barriers that have stood since the classical results.</p><p><strong>Why notable</strong> — Step complexity is a fundamental metric for distributed agreement; reducing it has direct implications for consensus latency in blockchains and replicated systems.</p><hr><h3 id=locating-a-black-hole-in-a-dynamic-ring>Locating a black hole in a dynamic ring<a hidden class=anchor aria-hidden=true href=#locating-a-black-hole-in-a-dynamic-ring>#</a></h3><p><em>Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro</em></p><p><strong>TL;DR</strong> — Solves the black-hole search problem on rings whose topology changes over time, establishing the agent and time complexity of locating a fatal node in a dynamic distributed environment.</p><p><strong>Why notable</strong> — Extends a classic distributed exploration problem to dynamic graphs, requiring new algorithmic techniques that are broadly applicable to fault detection in evolving networks.</p><hr><h3 id=dispersion-of-mobile-robots-on-directed-anonymous-graphs>Dispersion of mobile robots on directed anonymous graphs<a hidden class=anchor aria-hidden=true href=#dispersion-of-mobile-robots-on-directed-anonymous-graphs>#</a></h3><p><em>Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma</em></p><p><strong>TL;DR</strong> — Characterizes the necessary and sufficient conditions for a group of mobile robots to disperse to distinct nodes of a directed anonymous graph, and provides optimal algorithms.</p><p><strong>Why notable</strong> — Directed anonymous graphs model asymmetric communication networks; the dispersion problem’s resolution here advances the theory of autonomous distributed agents.</p><hr><h3 id=qpopss-query-and-parallelism-optimized-space-saving-for-finding-frequent-stream-elements>QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements<a hidden class=anchor aria-hidden=true href=#qpopss-query-and-parallelism-optimized-space-saving-for-finding-frequent-stream-elements>#</a></h3><p><em>Victor Jarlow, Charalampos Stylianopoulos, Marina Papatriantafilou</em></p><p><strong>TL;DR</strong> — Redesigns the Space-Saving frequent-elements sketch for concurrent shared-memory execution, achieving high query throughput alongside update throughput without sacrificing approximation accuracy.</p><p><strong>Why notable</strong> — Bridges the gap between approximate streaming data structures and parallel execution, demonstrating that heavy-hitter summaries can scale on multicore without significant accuracy loss.</p><hr><h3 id=a-parallel-algorithm-for-minimum-weight-set-cover-with-small-neighborhood-property>A parallel algorithm for minimum weight set cover with small neighborhood property<a hidden class=anchor aria-hidden=true href=#a-parallel-algorithm-for-minimum-weight-set-cover-with-small-neighborhood-property>#</a></h3><p><em>Yingli Ran, Yaoyao Zhang, Zhao Zhang 0002</em></p><p><strong>TL;DR</strong> — Gives a parallel approximation algorithm for minimum weight set cover instances where sets have bounded neighborhood size, achieving near-optimal approximation ratio in poly-logarithmic rounds.</p><p><strong>Why notable</strong> — Expands the frontier of problems admitting efficient parallel approximation, with implications for distributed network optimization where local structure can be exploited.</p><hr><h3 id=optimizing-parallel-heterogeneous-system-efficiency-dynamic-task-graph-adaptation-with-recursive-tasks>Optimizing parallel heterogeneous system efficiency: Dynamic task graph adaptation with recursive tasks<a hidden class=anchor aria-hidden=true href=#optimizing-parallel-heterogeneous-system-efficiency-dynamic-task-graph-adaptation-with-recursive-tasks>#</a></h3><p><em>Nathalie Furmento, Abdou Guermouche, Gwenolé Lucas, Thomas Morin <em>et al.</em></em></p><p><strong>TL;DR</strong> — Extends task-graph runtime systems to support recursive task generation, enabling dynamic adaptation of the task graph structure to improve load balance on heterogeneous CPU-GPU platforms.</p><p><strong>Why notable</strong> — Recursive task parallelism is essential for divide-and-conquer workloads; integrating it into heterogeneous runtimes closes a major gap in practical parallel programming models.</p><hr><h3 id=a-scheduler-to-foster-data-locality-for-gpu-and-out-of-core-task-based-linear-algebra-applications>A scheduler to foster data locality for GPU and out-of-core task-based linear algebra applications<a hidden class=anchor aria-hidden=true href=#a-scheduler-to-foster-data-locality-for-gpu-and-out-of-core-task-based-linear-algebra-applications>#</a></h3><p><em>Maxime Gonthier, Loris Marchal, Samuel Thibault</em></p><p><strong>TL;DR</strong> — Proposes a data-locality-aware scheduler for task-based dense linear algebra that simultaneously manages GPU memory and out-of-core data transfers to minimize data movement.</p><p><strong>Why notable</strong> — Data movement dominates cost in large linear algebra computations; the scheduler’s dual handling of GPU memory and disk I/O makes it practically relevant for exascale workloads.</p><hr><h3 id=leveraging-multi-instance-gpus-through-moldable-task-scheduling>Leveraging Multi-Instance GPUs through moldable task scheduling<a hidden class=anchor aria-hidden=true href=#leveraging-multi-instance-gpus-through-moldable-task-scheduling>#</a></h3><p><em>Jorge Villarrubia, Luis Costero, Francisco D. Igual, Katzalin Olcoz</em></p><p><strong>TL;DR</strong> — Develops a moldable task scheduling framework that dynamically partitions GPU compute across concurrent tasks using NVIDIA’s Multi-Instance GPU feature to improve overall throughput.</p><p><strong>Why notable</strong> — MIG is a critical hardware feature for multi-tenant GPU clusters; this work provides the first scheduling framework that exploits it through principled moldable-task theory.</p><hr><h3 id=integration-framework-for-online-thread-throttling-with-thread-and-page-mapping-on-numa-systems>Integration framework for online thread throttling with thread and page mapping on NUMA systems<a hidden class=anchor aria-hidden=true href=#integration-framework-for-online-thread-throttling-with-thread-and-page-mapping-on-numa-systems>#</a></h3><p><em>Janaina Schwarzrock, Hiago Mayk G. de A. Rocha, Arthur Francisco Lorenzon, Samuel Xavier de Souza <em>et al.</em></em></p><p><strong>TL;DR</strong> — Combines online thread-count throttling with NUMA-aware thread and page placement in a unified runtime framework, adaptively co-optimizing both dimensions to maximize performance.</p><p><strong>Why notable</strong> — Thread throttling and NUMA placement are typically managed independently; their joint online optimization yields measurable gains that neither technique alone achieves.</p><hr><h3 id=to-repair-or-not-to-repair-assessing-fault-resilience-in-mpi-stencil-applications>To repair or not to repair: Assessing fault resilience in MPI stencil applications<a hidden class=anchor aria-hidden=true href=#to-repair-or-not-to-repair-assessing-fault-resilience-in-mpi-stencil-applications>#</a></h3><p><em>Roberto Rocco, Elisabetta Boella, Daniele Gregori, Gianluca Palermo</em></p><p><strong>TL;DR</strong> — Systematically evaluates the cost-benefit trade-off between full fault recovery and partial resilience strategies for MPI stencil computations under process failures.</p><p><strong>Why notable</strong> — Provides practitioners with a principled decision framework for resilience in HPC applications, showing when expensive full recovery is justified versus cheaper degraded-mode execution.</p><hr><h3 id=a-lightweight-rdma-connection-protocol-based-on-post-hoc-confirmation>A lightweight RDMA connection protocol based on post-hoc confirmation<a hidden class=anchor aria-hidden=true href=#a-lightweight-rdma-connection-protocol-based-on-post-hoc-confirmation>#</a></h3><p><em>Ke Wu 0003, Dezun Dong, Weixia Xu 0001</em></p><p><strong>TL;DR</strong> — Designs an RDMA connection protocol that defers acknowledgment to post-operation confirmation, drastically reducing connection setup overhead for short-lived high-frequency transfers.</p><p><strong>Why notable</strong> — RDMA setup latency is a critical bottleneck in disaggregated memory and distributed storage systems; this protocol’s approach generalizes to any latency-sensitive fabric.</p></div><footer class=post-footer><ul class=post-tags></ul><nav class=paginav><a class=prev href=https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/ic-2025/><span class=title>« Prev</span>
|
||
<span>IC 2025 Digest</span>
|
||
</a><a class=next href=https://pub.sqrt.fr/vincent/publish-assistant/cloud-edge/digests/middleware-2025/><span class=title>Next »</span>
|
||
<span>Middleware 2025 Digest</span></a></nav></footer></article></main><footer class=footer><span>© 2026 <a href=https://pub.sqrt.fr/vincent/publish-assistant/>Publish Assistant</a></span> ·
|
||
<span>Powered by
|
||
<a href="https://gohugo.io/?utm_source=papermod" rel=noopener target=_blank>Hugo</a> &
|
||
<a href=https://github.com/adityatelange/hugo-PaperMod/ rel=noopener target=_blank>PaperMod</a></span></footer><a href=#top id=top-link class="top-link hidden" aria-label="go to top" title="Go to Top (Alt + G)" accesskey=g><svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" class="feather feather-chevrons-up"><polyline points="17 11 12 6 7 11"/><polyline points="17 18 12 13 7 18"/></svg>
|
||
</a><script>let menu=document.getElementById("menu");if(menu){const e=localStorage.getItem("menu-scroll-position");e&&(menu.scrollLeft=parseInt(e,10)),menu.onscroll=function(){localStorage.setItem("menu-scroll-position",menu.scrollLeft)}}document.querySelectorAll('a[href^="#"]').forEach(e=>{e.addEventListener("click",function(e){e.preventDefault();var t=this.getAttribute("href").substr(1);window.matchMedia("(prefers-reduced-motion: reduce)").matches?document.querySelector(`[id='${decodeURIComponent(t)}']`).scrollIntoView():document.querySelector(`[id='${decodeURIComponent(t)}']`).scrollIntoView({behavior:"smooth"}),t==="top"?history.replaceState(null,null," "):history.pushState(null,null,`#${t}`)})})</script><script>var toplink=document.getElementById("top-link");window.onscroll=function(){const e=window.innerHeight;document.body.scrollTop>e||document.documentElement.scrollTop>e?toplink.classList.remove("hidden"):toplink.classList.add("hidden")}</script><script>document.getElementById("theme-toggle").addEventListener("click",()=>{const e=document.querySelector("html");e.dataset.theme==="dark"?(e.dataset.theme="light",localStorage.setItem("pref-theme","light")):(e.dataset.theme="dark",localStorage.setItem("pref-theme","dark"))})</script></body></html> |