ACM Home Page
Please provide us with feedback. Feedback
Nonlinear array layouts for hierarchical memory systems
Full text PdfPdf (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
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 27,   Citation Count: 31
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/305138.305231
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
2
3
 
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
8
9
 
10
11
12
 
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
 
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
 
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
 
34
 
35
36
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
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
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Siddhartha Chatterjee: colleagues
Vibhor V. Jain: colleagues
Alvin R. Lebeck: colleagues
Shyam Mundhra: colleagues
Mithuna Thottethodi: colleagues

Peer to Peer - Readers of this Article have also read: