<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Making Caches Work for Graph Analytics · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1608.01362/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1608.01362/feed.xml" rel="self" type="application/rss+xml" /><item><title>Making Caches Work for Graph Analytics — mentioned by forgotpwtomain</title><link>https://news.ycombinator.com/item?id=12496244</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.01362:12496244</guid><pubDate>Wed, 14 Sep 2016 12:42:07 GMT</pubDate><description>&lt;p&gt;&amp;gt; These press releases are terrible. It took me quite a while to find the original paper: Was about to post the same-thing, how do these articles get past the editor? At any-rate it may be worth switching to the ACM publication link, the mit-news page is totally uninformative. [Optimizing Cache Performance for Graph Analytics](https://arxiv.org/abs/1608.01362) also looks to be relevant (same ,authors Aug 2016).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.01362/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
