Architecture-cognizant divide and conquer algorithms

ACM/IEEE SC 1999 Conference, SC 1999

Volumn , Issue , 1999, Pages 25-

  Gatlin, Kang Su ^a   Carter, Larry ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); MEMORY ARCHITECTURE; OPTIMIZATION;

DEEP MEMORY; DIVIDE AND CONQUER; DIVIDE-AND-CONQUER ALGORITHM; MATRIX MULTIPLY; OPTIMAL VARIANTS; PARALLEL COMPUTER; RECURSIONS; TARGET COMPUTERS;

DYNAMIC PROGRAMMING;

EID: 77949563167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1999.10068     Document Type: Conference Paper

References (18)

1. B. ALPERN, L. CARTER, AND J. FERRANTE, Space-limited procedures: A methodology for portable high-performance, in International Working Conference on Massively Parallel Programming Models, 1995.
2. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. D. CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK: A portable linear algebra library for high-performance computers, in Technical Report CS-90-105, University of Tennesee, Knoxville, 1990.
3. R. BLUMOFE, M. FRIGO, AND C. JOERG, An analysis of DAG-consistent distributed shared-memory algorithms, in 8th Symposium on Parallel Algorithms and Architectures, june 1996.
4. M. COLE, Algorithmic skeletons: A structured approach to the management of parallel computation, PhD thesis, University of Edinburgh, Department of Computer Science, 1988.
5. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, 1994.
6. DIGITAL, AlphaServer 4100 Technical Summary, http://www.digital.com/info/alphaserver/technical.html, 1998.
7. M. FRIGO, Portable High-Performance Programs, PhD thesis, Massachussets Institute of Technology, June 1999.
8. M. FRIGO AND S. JOHNSON, The Fastest Fourier Transform in the west, MIT-LCS-TR-728, (1997).
9. S. GORLATCH AND C. LENGAUER, Parallelization of divide-and-conquer in the bird-meertens formalism, Formal Aspects of Computing, 3 (1995).
10. A. LAMARCA AND R. LADNER, The influence of caches on the performance of sorting, in Symposium on Discrete Algorithms, January 1997.
11. G. MOU AND P. HUDAK, An algebraic model for divide-and-conquer algorithms and its parallelism, Journal of Supercomputing, 2 (1988), pp. 257-278.
12. S. MUCHNICK, Advanced Compiler Design and Implementation, Morgan Kaufman, 1997.
13. R. RUGINA AND M. RINARD, Automatic parallelization of divide and conquer algorithms, in Principles and Practice of Parallel Programming, June 1999.
14. SUPERCOMPUTING TECHNOLOGIES GROUP, Cilk 5.2 Reference Manual, http://supertech.lcs.mit.edu/cilk/release/cilk5.2.html, 1998.
15. O. TEMAN, E. D. GRANSTON, AND W. JALBY, To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts, in Proc. of SuperComputing '93, Nov. 1993.
16. C. THOMBORSON, B. ALPERN, AND L. CARTER, Rectiliniear Steiner tree minimization on a workstation, Computational Support for Discrete Mathematics: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, (1994).
17. M. THOTTETHODI, S. CHATTERJEE, AND A. LEBECK, Tuning Strassen's matrix multiplication for memory efficiency, in SuperComputing, November 1998.
18. S. TOLEDO, Locality of reference in lu decomposition with partial pivoting, SIAM Journal of Matrix Anal. Appl., 18 (1997), pp. 1065-1081.