The Cache Complexity of Multithreaded Cache Oblivious Algorithms
Authors:
- 14 December 2007
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 45 (2) , 203-233
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The Data Locality of Work StealingTheory of Computing Systems, 2002
- Scheduling multithreaded computations by work stealingJournal of the ACM, 1999
- Provably efficient scheduling for languages with fine-grained parallelismJournal of the ACM, 1999
- Space-efficient scheduling of nested parallelismACM Transactions on Programming Languages and Systems, 1999
- Locality of Reference in LU Decomposition with Partial PivotingSIAM Journal on Matrix Analysis and Applications, 1997
- CilkACM SIGPLAN Notices, 1995
- A bridging model for parallel computationCommunications of the ACM, 1990
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974