<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Distributed-Systems on Do you want to talk about AI?</title>
    <link>https://doyouwant.ai/tags/distributed-systems/</link>
    <description>Recent content in Distributed-Systems on Do you want to talk about AI?</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 16 May 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://doyouwant.ai/tags/distributed-systems/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>1968 Keeps Showing Up</title>
      <link>https://doyouwant.ai/posts/1968-keeps-showing-up/</link>
      <pubDate>Sat, 16 May 2026 00:00:00 +0000</pubDate>
      <guid>https://doyouwant.ai/posts/1968-keeps-showing-up/</guid>
      <description>&lt;p&gt;Three papers landed on arXiv in the same week. May 13 through 15, 2026. All three are about the same problem: how to coordinate multiple AI agents working on the same task without the coordination itself becoming the bottleneck.&lt;/p&gt;&#xA;&lt;p&gt;The first paper is the one that caught me. Evan Rose and colleagues at Northeastern published APWA, a distributed architecture for parallelizable agentic workflows. The core move is clean. Build a dependency graph of subtasks. Check whether any two subtasks need each other&amp;rsquo;s outputs. If they don&amp;rsquo;t, run them in parallel. The paper calls these &amp;ldquo;non-interfering subproblems&amp;rdquo; and defines them formally: two subtasks are non-interfering if the inputs of each are independent of the outputs of the other.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
