The cache complexity of multithreaded cache oblivious algorithms

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 271-280

  Frigo, Matteo ^a   Strumpen, Volker ^a  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBABILITY; PROGRAM PROCESSORS;

MATRIX MULTIPLICATION; MULTITHREADED CACHE; STENCIL COMPUTATIONS;

BUFFER STORAGE;

EID: 33749564381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148157     Document Type: Conference Paper

References (22)

1. U. A. Acar, G. E. Blelloch, and R. D. Blumofe. The Data Locality of Work Stealing. Theory of Computing Systems, 35(3):321-347, 2002.
2. L. A. Belady. A Study of Replacement Algorithms for Virtual Storage Computers. IBM Systems Journal, 5(2):78-101, 1966.
3. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul. Concurrent Cache-Oblivious B-Trees. In 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 228-237, Las Vegas, NV, July 2005.
4. G. Bilardi and F. P. Preparata. Upper Bounds to Processor-Time Tradeoffs Under Bounded-Speed Message Propagation. In 7th Annual ACM Aymposium on Parallel Algorithms and Architectures, pages 185-194, Santa Barbara, CA, July 1995.
5. G. E. Blelloch and P. B. Gibbons. Effectively Sharing a Cache Among Threads. In 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 235-244, Barcelona, Spain, June 2004.
6. G. E. Blelloch, P. B. Gibbons, and Y. Matias. Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. Journal of the ACM, 46(2):281-321, 1999.
7. R. D. Blumofe. M. Frigo. C. F. Joerg, C. E. Leiserson, and K. H. Randall. An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. In 8th Annunal ACM Symposium on Parallel Algorithms and Architectures, pages 297-308, Padua, Italy, June 1996.
8. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An Efficient Multithreaded Runtime System. In 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207-216, Santa Barbara. CA, July 1995.
9. R. D. Blumofe and C. E. Leiserson. Scheduling Multithreaded Computations by Work Stealing. Journal of the ACM, 46(5):720-748, Sept. 1999.
10. R. P. Brent. The Parallel Evaluation of General Arithmetic Expressions. Journal of the ACM, 21(2):201-206, Apr. 1974.
11. R. A. Chowdhury and V. Ramachandran. Cache-Oblivious Dynamic Programming. In 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 591-600, Miami, FL, 2006.
12. D. E. Culler, R. M. Karp, D. A. Patterson. A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 1-12, San Diego, CA, May 1993.
13. S. J. Fortune and J. Wyllie. Parallelism in Random Access Machines. In 10th Annual ACM Symposium on Theory of Computing, pages 114-118, San Diego, CA, May 1978.
14. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache Oblivious Algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285-298, New York, USA, Oct. 1999.
15. M. Frigo, K. H. Randall, and C. E. Leiserson. The Implementation of the Cilk-5 Multithreaded Language. In ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998.
16. M. Frigo and V. Strumpen. Cache Oblivious Stencil Computations. In International Conference on Supercomputing, pages 361-366, Boston, Massachusetts, June 2005.
17. P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory of Computing Systems, 32(3):327-359, 1999.
18. R. L. Graham, Bounds for Certain Multiprocessing Anomalies. The Bell System Technical Journal, 45:1563-1581, Nov. 1966,
19. J.-W. Hong and H. T. Rung. I/O Complexity: The Red-Blue Pebbling Game. In 13th Annual ACM Symposium on Theory of Computing, pages 326-333, Milwaukee, Wisconsin, May 1981.
20. G. J. Narlikar and G. E. Blelloch. Space-Efficient Scheduling of Nested Parallelism. ACM Transactions on Programming Languages and Systems, 21(1):138-173, 1999.
21. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28(2):202-208, Feb. 1985.
22. L. G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8):103-111. August 1990.