The cache complexity of multithreaded cache oblivious algorithms

Theory of Computing Systems

Volumn 45, Issue 2, 2009, Pages 203-233

  Frigo, Matteo ^a   Strumpen, Volker ^a  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Cache oblivious algorithms; Multithreading; Stencil computations

Indexed keywords

BACK SUBSTITUTIONS; CACHE-OBLIVIOUS ALGORITHMS; GAUSSIAN ELIMINATION; LENGTH COMPUTATION; LONGEST COMMON SUBSEQUENCE PROBLEM; MATRIX MULTIPLICATION; MULTI-THREADING; STENCIL COMPUTATIONS;

MULTITASKING; PROBABILITY; SCHEDULING;

ALGORITHMS;

EID: 67449111382     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9098-2     Document Type: Conference Paper

References (30)

1. U.A. Acar G.E. Blelloch R.D. Blumofe 2002 The data locality of work stealing Theory Comput. Syst. 35 3 321 347 (Pubitemid 36156138)
2. L.A. Belady 1966 A study of replacement algorithms for virtual storage computers IBM Syst. J. 5 2 78 101
3. Bender, M.A., Fineman, J.T., Gilbert, S., Kuszmaul, B.C.: Concurrent cache-oblivious B-trees. In: 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 228-237, Las Vegas, NV, July 2005 (Pubitemid 43206575)
4. Bilardi, G., Preparata, F.P.: Upper bounds to processor-time tradeoffs under bounded-speed message propagation. In: 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 185-194, Santa Barbara, CA, July 1995
5. Blelloch, G.E., Gibbons, P.B.: Effectively sharing a cache among threads. In: 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 235-244, Barcelona, Spain, June 2004
6. G.E. Blelloch P.B. Gibbons Y. Matias 1999 Provably efficient scheduling for languages with fine-grained parallelism J. ACM 46 2 281 321
7. Blumofe, R.D., Frigo, M., Joerg, C.F., Leiserson, C.E., Randall, K.H.: An analysis of dag-consistent distributed shared-memory algorithms. In: 8th Annunal ACM Symposium on Parallel Algorithms and Architectures, pp. 297-308, Padua, Italy, June 1996
8. Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: an efficient multithreaded runtime system. In: 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 207-216, Santa Barbara, CA, July 1995
9. R.D. Blumofe C.E. Leiserson 1999 Scheduling multithreaded computations by work stealing J. ACM 46 5 720 748
10. R.P. Brent 1974 The parallel evaluation of general arithmetic expressions J. ACM 21 2 201 206
11. Chowdhury, R.A., Ramachandran, V.: Cache-oblivious dynamic programming. In: 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 591-600, Miami, FL, 2006 (Pubitemid 43275280)
12. Chowdhury, R.A., Ramachandran, V.: The cache-oblivious Gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '07), pp. 71-80. Assoc. Comput. Mach., New York (2007) (Pubitemid 47568556)
13. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
14. Culler, D.E., Karp, R.M., Patterson, D.A., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: towards a realistic model of parallel computation. In: 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1-12, San Diego, CA, May 1993
15. Fortune, S.J., Wyllie, J.: Parallelism in random access machines. In: 10th Annual ACM Symposium on Theory of Computing, pp. 114-118, San Diego, CA, May 1978 (Pubitemid 9412032)
16. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285-298, New York, USA, October 1999
17. Frigo, M., Randall, K.H., Leiserson, C.E.: The implementation of the Cilk-5 multithreaded language. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998
18. Frigo, M., Strumpen, V.: Cache oblivious stencil computations. In: International Conference on Supercomputing, pp. 361-366, Boston, MA, June 2005 (Pubitemid 43251341)
19. P.B. Gibbons Y. Matias V. Ramachandran 1999 Can a shared-memory model serve as a bridging model for parallel computation? Theory Comput. Syst. 32 3 327 359
20. Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Press, Baltimore (1996)
21. R.L. Graham 1966 Bounds for certain multiprocessing anomalies Bell Syst. Tech. J. 45 1563 1581
22. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994)
23. D.S. Hirschberg 1975 A linear space algorithm for computing maximal common subsequences Commun. ACM 18 6 341 343
24. Hong, J.-W., Kung, H.T.: I/O complexity: the red-blue pebbling game. In: 13th Annual ACM Symposium on Theory of Computing, pp. 326-333, Milwaukee, Wisconsin, May 1981
25. Leiserson, C.E.: Minicourse on multithreaded programming in Cilk, lecture 2: analysis of Cilk algorithms. Summer School on Language-Based Techniques for Concurrent and Distributed Software at the University of Oregon (2006)
26. G.J. Narlikar G.E. Blelloch 1999 Space-efficient scheduling of nested parallelism ACM Trans. Program. Lang. Syst. 21 1 138 173
27. D.D. Sleator R.E. Tarjan 1985 Amortized efficiency of list update and paging rules Commun. ACM 28 2 202 208
28. Strumpen, V., Frigo, M.: Software engineering aspects of cache oblivious stencil computations. Technical Report RC24035, IBM Research, August 2006
29. S. Toledo 1997 Locality of reference in LU decomposition with partial pivoting SIAM J. Matrix Anal. Appl. 18 4 1065 1081
30. L.G. Valiant 1990 A bridging model for parallel computation Commun. ACM 33 8 103 111