Oblivious algorithms for multicores and network of processors

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010

Volumn , Issue , 2010, Pages

  Chowdhury, Rezaul Alam ^a   Silvestri, Francesco ^b   Blakeley, Brandon ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Algorithm; Cache; Gaussian elimination paradigm; List ranking; Multicore; Network; Oblivious

Indexed keywords

BLOCK LENGTHS; CACHE SIZE; CONNECTED COMPONENT; DESIGN OF ALGORITHMS; DISTRIBUTED MEMORY; FUNDAMENTAL PROBLEM; GAUSSIAN ELIMINATION; GAUSSIAN ELIMINATION PARADIGM; MACHINE PARAMETERS; MATRIX TRANSPOSITION; MULTI CORE; MULTI-CORE MODEL; MULTI-LEVEL CACHING; OBLIVIOUS ALGORITHMS; PARALLEL TASK; RUNTIMES; SHARED MEMORY MACHINES;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; GAUSSIAN DISTRIBUTION; MACHINE DESIGN;

PARAMETER ESTIMATION;

EID: 77954024841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2010.5470354     Document Type: Conference Paper

References (26)

1. M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran, "Cache-oblivious algorithms, " in Proc. 40th IEEE FOCS, 1999, pp. 285-297.
2. L. Arge, G. S. Brodal, and R. Fagerberg, "Cache-oblivious data structures, " in Handbook of Data Structures and Applications. CRC Press, 2004, ch. 38.
3. E. D. Demaine, "Cache-oblivious algorithms and data structures, " 2002.
4. G. Bilardi, A. Pietracaprina, G. Pucci, and F. Silvestri, "Network-oblivious algorithms, " in Proc. 21st IEEE IPDPS, 2007.
5. L. Arge, M. Goodrich, M. Nelson, and N. Sitchinava, "Fundamental parallel algorithms for private-cache chip multiprocessors, " in Proc. 20th ACM SPAA, 2008, pp. 197-206.
6. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul, "Concurrent cache-oblivious B-trees, " in Proc. 17th ACM SPAA, 2005, pp. 228-237.
7. R. A. Chowdhury and V. Ramachandran, "The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation, " in Proc. 19th ACM SPAA, 2007, pp. 71-80.
8. M. Frigo and V. Strumpen, "The cache complexity of multithreaded cache oblivious algorithms, " Theory Comput. Syst., vol.45, no.2, pp. 203-233, 2009.
9. G. Blelloch and P. Gibbons, "Effectively sharing a cache among threads, " in Proc. 16th ACM SPAA, 2004, pp. 235-244.
10. G. Blelloch, R. A. Chowdhury, P. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch, "Provably good multicore cache performance for divide-and-conquer algorithms, " in Proc. 19th ACM-SIAM SODA, 2008, pp. 501-510.
11. R. A. Chowdhury and V. Ramachandran, "Cache-efficient dynamic programming algorithms for multicores, " in Proc. 20th ACM SPAA, 2008, pp. 207-216.
12. L. Valiant, "A bridging model for multi-core computing, " in Proc. 16th ESA, 2008, pp. 13-28.
13. R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran, "Oblivious algorithms for multicores and network of processors, " Univ. of Texas at Austin, Tech. Rep. 09-19, 2009, http://www.cs.utexas.edu/ research/publications.
14. G. Blelloch, P. Gibbons, and H. Simhadri, "Low depth cache-oblivious sorting, " School of Computer Science, Carnegie Mellon University, Tech. Rep. CMU-CS-09-134, 2009.
15. R. Cole and V. Ramachandran, "Resource oblivious multicore sorting, " 2009, under submission.
16. B. Chamberlain, D. Callahan, and H. Zima, "Parallel programmability and the Chapel language, " Int. J. of High Perf. Comp. Appl., vol.21, no.3, pp. 291-312, 2007.
17. R. J. Lipton and R. E. Tarjan, "A separator theorem for planar graphs, " SIAM J. Applied Mathematics, vol.36, pp. 177-189, 1979.
18. G. Bilardi, A. Pietracaprina, and G. Pucci, "Decomposable BSP: A bandwidth-latency model for parallel and hierarchical computation, " in Handbook of Parallel Computing: Models, Algorithms and Applications. CRC Press, 2007, pp. 277-315.
19. R. A. Chowdhury and V. Ramachandran, "Cache-oblivious dynamic programming, " in Proc. 17th ACM-SIAM SODA, 2006, pp. 591-600.
20. D. Irony, S. Toledo, and A. Tiskin, "Communication lower bounds for distributed-memory matrix multiplication, " Journal of Parallel and Distributed Computing, vol.64, no.9, pp. 1017-1026, 2004.
21. R. Cole and U. Vishkin, "Deterministic coin tossing with applications to optimal parallel list ranking, " Inf. Control, vol.70, no.1, pp. 32-53, 1986.
22. L. Arge, M. Goodrich, and N. Sitchinava, "Parallel external memory graph algorithms, " in Proc. 24th IEEE IPDPS, 2010.
23. Y. J. Chiang, M. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter, "External-memory graph algorithms, " in Proc. 6th ACM-SIAM SODA, 1995, pp. 139-149.
24. J. JáJá, An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
25. F. Y. Chin, J. Lam, and I. N. Chen, "Efficient parallel algorithms for some graph problems, " Commun. ACM, vol.25, no.9, pp. 659-665, 1982.
26. "Blue Waters project, " http://www.ncsa.uiuc.edu/BlueWaters.