Optimizing Indirect Memory References with milk
dl.acm.org
dl.acm.org
Optimizing Indirect Memory References with milk
http://dl.acm.org/citation.cfm?id=2967948
(seems to be available without paywall)
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).
this is effectively scheduling to hide memory latency (ala SMT) except done entirely dynamically, with batching to support locality.
the most impressive part of the paper isn't just the speedup, but the speedup in the presence of the substantial overhead involved in capturing, scheduling, and restoring the closures.
it would be nice if the super-fine-grained threading model made more than the occasional appearance. it opens up a lot of potential for hiding all kinds of latencies. if a runtime can reap substantial benefits, imagine what an architecture could do (i.e. SMT)
An error occurred while processing your request.
Reference #50.bfc0c16d.1473861325.1484741f
I guess the milk went stale.