NobleBlocks
Public

Cache efficient functional algorithms

Published in Communications of the ACM • Jun 25, 2015
Authors:
Guy E. Blelloch
,
Robert Harper

Abstract

The widely studied I/O and ideal-cache models were developed to account for the large difference in costs to access memory at different levels of the memory hierarchy. Both models are based on a two level memory hierarchy with a fixed size fast memory (cache) of size M , and an unbounded slow memory...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!