<?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>Hpc on Publish Assistant</title><link>https://pub.sqrt.fr/vincent/publish-assistant/tags/hpc/</link><description>Recent content in Hpc 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/hpc/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>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>