The Cache Complexity of Multithreaded Cache Oblivious Algorithms

We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a private cache. We specialize this technique to computations executed by the Cilk work-stealing scheduler on a machine wi...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 45; no. 2; pp. 203 - 233
Main Authors:	Frigo, Matteo, Strumpen, Volker
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.08.2009 Springer Nature B.V
Subjects:	Algorithms Communication Computer Science Critical path Hierarchies Schedules Theory of Computation Cache oblivious algorithms Stencil computations Multithreading
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!