8 research outputs found
Algorithmic ramifications of prefetching in memory hierarchy
External Memory models, most notable being the I-O Model [3], capture the effects of memory hierarchy and aid in algorithm design. More than a decade of architectural advancements have led to new features not captured in the I-O model - most notably the prefetching capability.
We propose a relatively simple Prefetch model that incorporates data prefetching in the traditional I-O models and show how to design
algorithms that can attain close to peak memory bandwidth. Unlike (the inverse of) memory latency, the memory bandwidth is much closer to the
processing speed, thereby, intelligent use of prefetching can considerably mitigate the I-O bottleneck. For some fundamental problems, our algorithms attain running times approaching that of the idealized Random Access Machines under reasonable assumptions. Our work also explains
the significantly superior performance of the I-O efficient algorithms in systems that support prefetching compared to ones that do not
Equilibria. 2021 March
This month's edition talks about 'Denial' in various socio-economic spheres