<story><title>Sorting out graph processing</title><url>https://github.com/frankmcsherry/blog/blob/master/posts/2015-08-15.md</url><text></text></story><parent_chain></parent_chain><comment><author>ibdknox</author><text>Looks like one of the x-stream guys replied: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;ar104&amp;#x2F;sortingVsScanning&amp;#x2F;blob&amp;#x2F;master&amp;#x2F;SortingConsideredHarmful&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;ar104&amp;#x2F;sortingVsScanning&amp;#x2F;blob&amp;#x2F;master&amp;#x2F;Sorti...&lt;/a&gt;&lt;p&gt;Related discussion on twitter: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;twitter.com&amp;#x2F;roy_amitabha&amp;#x2F;status&amp;#x2F;634078514698952704&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;twitter.com&amp;#x2F;roy_amitabha&amp;#x2F;status&amp;#x2F;634078514698952704&lt;/a&gt;</text></comment>
<story><title>Sorting out graph processing</title><url>https://github.com/frankmcsherry/blog/blob/master/posts/2015-08-15.md</url><text></text></story><parent_chain></parent_chain><comment><author>jules</author><text>Brilliant writing style! Also check out his work on Naiad, which is IMO by far the most interesting work in its area, and check out the Scalability! But at what COST? paper: &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;www.frankmcsherry.org&amp;#x2F;assets&amp;#x2F;COST.pdf&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;www.frankmcsherry.org&amp;#x2F;assets&amp;#x2F;COST.pdf&lt;/a&gt; which showed that a program running on a single thread often outperforms distributed systems running on 100+ cores.</text></comment>