| 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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 41, Citation Count: 10
|
|
|
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
|
|
| |
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
|
|
| |
5
|
|
| |
6
|
DIGITAL, AlphaServer 4100 Technical Summary, http://www.digital.com/info/alphaserver/technical.html, 1998.
|
| |
7
|
|
| |
8
|
|
| |
9
|
S. GORLATCH AND C. LENGAUER, Parallelization of divide-and-conquer in the bird-meertens formalism, Formal Aspects of Computing, 3 (1995).
|
| |
10
|
|
| |
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
|
|
 |
13
|
|
| |
14
|
SUPERCOMPUTING TECHNOLOGIES GROUP, Cilk 5.2 Reference Manual, http://supertech.lcs.mit.edu/cilk/release/cilk5.2.html, 1998.
|
 |
15
|
|
| |
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
|
|
| |
18
|
|
CITED BY 10
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|