Architecture-cognizant divide and conquer algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Architecture-cognizant divide and conquer algorithms

Full text

Pdf (159 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents

Portland, Oregon, United States

Article No. 25

Year of Publication: 1999

ISBN:1-58113-091-0

Authors

Kang Su Gatlin	University of California San Diego, Computer Science and Engineering Department
Larry Carter	University of California San Diego, Computer Science and Engineering Department

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331557 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	B. Alpern , L. Carter , J. Ferrante, Space-limited procedures: a methodology for portable high-performance, Proceedings of the conference on Programming Models for Massively Parallel Computers, p.10, October 09-12, 1995
	2	Anderson , Bai , Bischof , Demmel , Dongarra , DuCroz , Greenbaum , Hammarling , McKenney , Sorenson, LAPACK Working Note 20: A Portable Linear Algebra Library For High-Performance Computers, University of Tennessee, Knoxville, TN, 1990
	3	Robert D. Blumofe , Matteo Frigo , Christopher F. Joerg , Charles E. Leiserson , Keith H. Randall, An analysis of dag-consistent distributed shared-memory algorithms, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.297-308, June 24-26, 1996, Padua, Italy [doi>10.1145/237502.237574]
	4	Murray I. Cole, Algorithmic skeletons: a structured approach to the management of parallel computation, 1988
	5	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	6	DIGITAL, AlphaServer 4100 Technical Summary, http://www.digital.com/info/alphaserver/technical.html, 1998.
	7	Matteo Frigo , Charles E. Leiserson, Portable high-performance programs, 1999
	8	M. Frigo , S. G. Johnson, The Fastest Fourier Transform in the West, Massachusetts Institute of Technology, Cambridge, MA, 1997
	9	S. GORLATCH AND C. LENGAUER, Parallelization of divide-and-conquer in the bird-meertens formalism, Formal Aspects of Computing, 3 (1995).
	10	Anthony LaMarca , Richard E. Ladner, The influence of caches on the performance of sorting, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.370-379, January 05-07, 1997, New Orleans, Louisiana, United States
	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	Steven S. Muchnick, Advanced compiler design and implementation, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1998
	13	Radu Rugina , Martin Rinard, Automatic parallelization of divide and conquer algorithms, Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, p.72-83, May 04-06, 1999, Atlanta, Georgia, United States
	14	SUPERCOMPUTING TECHNOLOGIES GROUP, Cilk 5.2 Reference Manual, http://supertech.lcs.mit.edu/cilk/release/cilk5.2.html, 1998.
	15	O. Temam , E. D. Granston , W. Jalby, To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.410-419, December 1993, Portland, Oregon, United States [doi>10.1145/169627.169762]
	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	Mithuna Thottethodi , Siddhartha Chatterjee , Alvin R. Lebeck, Tuning Strassen's matrix multiplication for memory efficiency, Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), p.1-14, November 07-13, 1998, San Jose, CA
	18	Sivan Toledo, Locality of Reference in LU Decomposition with Partial Pivoting, SIAM Journal on Matrix Analysis and Applications, v.18 n.4, p.1065-1081, Oct. 1997 [doi>10.1137/S0895479896297744]

CITED BY 10

	Gabriel Rivera , Chau-Wen Tseng, Tiling optimizations for 3D scientific computations, Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), p.32-es, November 04-10, 2000, Dallas, Texas, United States
	Qing Yi , Vikram Adve , Ken Kennedy, Transforming loops to recursion for multi-level memory hierarchies, ACM SIGPLAN Notices, v.35 n.5, p.169-181, May 2000
	Matthias Korch , Thomas Rauber , Gudula Rünger, Performance optimization of RK methods using block-based pipelining, Performance analysis and grid computing, Kluwer Academic Publishers, Norwell, MA, 2004
	Thomas Rauber , Gudula Rüger, Optimizing locality for ODE solvers, Proceedings of the 15th international conference on Supercomputing, p.123-132, June 2001, Sorrento, Italy
	Markus Püschel , José M. F. Moura , Bryan Singer , Jianxin Xiong , Jeremy Johnson , David Padua , Manuela Veloso , Robert W. Johnson, Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms, International Journal of High Performance Computing Applications, v.18 n.1, p.21-45, February 2004
	Michelle Mills Strout , Larry Carter , Jeanne Ferrante , Barbara Kreaseck, Sparse Tiling for Stationary Iterative Methods, International Journal of High Performance Computing Applications, v.18 n.1, p.95-113, February 2004
	Richard Vuduc , James W. Demmel , Jeff A. Bilmes, Statistical Models for Empirical Search-Based Performance Tuning, International Journal of High Performance Computing Applications, v.18 n.1, p.65-94, February 2004
	Matthias Korch , Thomas Rauber, Optimizing locality and scalability of embedded Runge-Kutta solvers using block-based pipelining, Journal of Parallel and Distributed Computing, v.66 n.3, p.444-468, March 2006
	Franz Franchetti , Yevgen Voronenko , Markus Püschel, Tools and techniques for performance---FFT program generation for shared memory: SMP and multicore, Proceedings of the 2006 ACM/IEEE conference on Supercomputing, November 11-17, 2006, Tampa, Florida
	Thomas Rauber , Gudula Rünger, Improving locality for ODE solvers by program transformations, Scientific Programming, v.12 n.3, p.133-154, August 2004