| Nonlinear array layouts for hierarchical memory systems |
| Full text |
Pdf
(2.20 MB)
|
| Source
|
International Conference on Supercomputing
archive
Proceedings of the 13th international conference on Supercomputing
table of contents
Rhodes, Greece
Pages: 444 - 453
Year of Publication: 1999
ISBN:1-58113-164-X
|
|
Authors
|
|
Siddhartha Chatterjee
|
Department of Computer Science, The University of North Carolina, Chapel Hill, NC
|
|
Vibhor V. Jain
|
Department of Computer Science, The University of North Carolina, Chapel Hill, NC
|
|
Alvin R. Lebeck
|
Department of Computer Science, Duke University, Durham, NC
|
|
Shyam Mundhra
|
Department of Computer Science, The University of North Carolina, Chapel Hill, NC
|
|
Mithuna Thottethodi
|
Department of Computer Science, Duke University, Durham, NC
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 27, Citation Count: 31
|
|
|
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
|
E. Anderson , Z. Bai , C. Bischof , L. S. Blackford , J. Demmel , Jack J. Dongarra , J. Du Croz , S. Hammarling , A. Greenbaum , A. McKenney , D. Sorensen, LAPACK Users' guide (third ed.), Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999
|
 |
2
|
Jennifer M. Anderson , Saman P. Amarasinghe , Monica S. Lam, Data and computation transformations for multiprocessors, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.166-178, July 19-21, 1995, Santa Barbara, California, United States
|
 |
3
|
Remzi H. Arpaci , David E. Culler , Arvind Krishnamurthy , Steve G. Steinberg , Katherine Yelick, Empirical evaluation of the CRAY-T3D: a compiler perspective, Proceedings of the 22nd annual international symposium on Computer architecture, p.320-331, June 22-24, 1995, S. Margherita Ligure, Italy
|
| |
4
|
|
 |
5
|
|
| |
6
|
T. Bially. Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Transactions on Information Theory, II'-15(6):658-664, Nov. 1969.
|
 |
7
|
Jeff Bilmes , Krste Asanovic , Chee-Whye Chin , Jim Demmel, Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology, Proceedings of the 11th international conference on Supercomputing, p.340-347, July 07-11, 1997, Vienna, Austria
[doi> 10.1145/263580.263662]
|
 |
8
|
Brad Calder , Chandra Krintz , Simmi John , Todd Austin, Cache-conscious data placement, Proceedings of the eighth international conference on Architectural support for programming languages and operating systems, p.139-149, October 02-07, 1998, San Jose, California, United States
|
 |
9
|
Steve Carr , Kathryn S. McKinley , Chau-Wen Tseng, Compiler optimizations for improving data locality, Proceedings of the sixth international conference on Architectural support for programming languages and operating systems, p.252-262, October 05-07, 1994, San Jose, California, United States
|
| |
10
|
|
 |
11
|
|
 |
12
|
Siddhartha Chatterjee , Alvin R. Lebeck , Praveen K. Patnala , Mithuna Thottethodi, Recursive array layouts and fast parallel matrix multiplication, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, p.222-231, June 27-30, 1999, Saint Malo, France
[doi> 10.1145/305619.305645]
|
| |
13
|
T. M. Chilimbi, J. R. Lares, and M. D. Hill. Improving pointer-based codes through cache-conscious data placement. Technical Report CS-TR-98-1365, University of Wisconsin--Madison, Mar. 1998.
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
| |
17
|
K. Esseghir. lmprovingdata locality foreaches. Master's thesis, Department of Computer Science, Rice University, Houston, TX, Sept. 1993.
|
 |
18
|
|
 |
19
|
|
| |
20
|
|
 |
21
|
|
 |
22
|
Somnath Ghosh , Margaret Martonosi , Sharad Malik, Precise miss analysis for program transformations with caches of arbitrary associativity, Proceedings of the eighth international conference on Architectural support for programming languages and operating systems, p.228-239, October 02-07, 1998, San Jose, California, United States
|
| |
23
|
G. Gibson, t. S. Vitter, and i. Wilkes. Report of the working group on storage UO for large-scale computing. ACM Comput. Sum., Dec. 1996.
|
| |
24
|
M. F. Goodchild and A. W. Grandfield. Optimizing raster storage: an examination of four alternatives. In Proceedings of Auto-Carte 6, volume 1, pages 400-407~Ottawa, Oct. 1983.
|
| |
25
|
|
| |
26
|
|
| |
27
|
D. Hilbert. 'Uber stetige Abbildung einer Linie auf ein Fl/iehenstiick. Mathematische AnnaIen, 38:459-460,1891.
|
 |
28
|
Y. Charlie Hu , S. Lennart Johnsson , Shang-Hua Teng, High performance Fortran for highly irregular problems, Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.13-24, June 18-21, 1997, Las Vegas, Nevada, United States
|
| |
29
|
S. F. Hummel, I. Banieeseu, C.-T. Wang, and J. Wein. Load balancing and data locality via fractiling: An experimental study. In Language, Compilers andRun- ?qme Systems.for Scalable Computers. Kluwer Academic Publishers, 1995.
|
 |
30
|
|
 |
31
|
|
| |
32
|
|
 |
33
|
Induprakas Kodukula , Nawaaz Ahmed , Keshav Pingali, Data-centric multi-level blocking, Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, p.346-357, June 16-18, 1997, Las Vegas, Nevada, United States
|
| |
34
|
Charles H. Koelbel , David B. Loveman , Robert S. Schreiber , Guy L. Steele, Jr. , Mary E. Zosel, The high performance Fortran handbook, MIT Press, Cambridge, MA, 1994
|
| |
35
|
Richard E. Ladner , James D. Fix , Anthony LaMarca, Cache performance analysis of traversals and random accesses, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.613-622, January 17-19, 1999, Baltimore, Maryland, United States
|
 |
36
|
Monica D. Lam , Edward E. Rothberg , Michael E. Wolf, The cache performance and optimizations of blocked algorithms, Proceedings of the fourth international conference on Architectural support for programming languages and operating systems, p.63-74, April 08-11, 1991, Santa Clara, California, United States
|
 |
37
|
|
| |
38
|
|
| |
39
|
R. Laurini. Graphical data bases built on Pea.no space-filling curves. In C. E. Vandoni, editor, Proceedings of the EUROGRAPHICS '85 Conference, pages 327-338, Amsterdam, 1985. North-Holland.
|
 |
40
|
|
| |
41
|
|
| |
42
|
|
| |
43
|
|
| |
44
|
G. Peano. Sur une eourbe qui remplit toute une aire plaine. Mathematisehe Annalen, 36:157-160, 1890.
|
| |
45
|
|
| |
46
|
|
 |
47
|
|
 |
48
|
|
| |
49
|
H. Sagan. Space-FillingCurves. Springer-Verlag, 1994. ISBN 0-387-94265-3.
|
| |
50
|
S. Sen, S. Chatterjee, and A. R. Lebeek. Towards a theory of cache-efficient algorithms. In preparation, Apr. 1999.
|
 |
51
|
J. P. Singh , T. Joe , J. L. Hennessy , A. Gupta, An empirical comparison of the Kendall Square Research KSR-1 and Stanford DASH multiprocessors, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.214-225, December 1993, Portland, Oregon, United States
[doi> 10.1145/169627.169699]
|
 |
52
|
|
| |
53
|
L. Stals and U. Pride. Techniques for improving the data locality of iterative methods. Technical Report MRR97-038, Institut ffir Mathematik, Universitfit Augsburg, Augsburg, Germany, Oct. 1997.
|
| |
54
|
|
| |
55
|
V. Stmssen. Gaussian elimination is not optimal. Numer. Math., 13:354-356, 1969.
|
 |
56
|
|
 |
57
|
|
 |
58
|
|
| |
59
|
|
 |
60
|
|
 |
61
|
|
 |
62
|
|
 |
63
|
|
CITED BY 32
|
|
|
|
|
|
|
|
|
|
José E. Moreira , Samuel P. Midkiff , Manish Gupta , Pedro V. Artigas , Peng Wu , George Almasi, The NINJA project, Communications of the ACM, v.44 n.10, p.102-109, Oct. 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
José E. Moreira , Samuel P. Midkiff , Manish Gupta , Peng Wu , George Almasi , Pedro Artigas, NINJA: Java for high performance numerical computing, Scientific Programming, v.10 n.1, p.19-33, January 2002
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
G. Almasi , F. G. Gustavson , J. E. Moreira, Design and evaluation of a linear algebra package for Java, Proceedings of the ACM 2000 conference on Java Grande, p.150-159, June 03-04, 2000, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|