Ahnentafel indexing into morton-ordered arrays, or matrix locality for free

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1900, Issue , 2000, Pages 771-773

  Wise, David S ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Caching; Compilers; Paging; Quadtree matrices

Indexed keywords

CONCURRENCY CONTROL; DATA STRUCTURES; DIGITAL STORAGE; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; FORESTRY; INDEXING (OF INFORMATION); MATRIX ALGEBRA; PROGRAM COMPILERS; STORAGE MANAGEMENT; TREES (MATHEMATICS);

CACHING; DATA STORAGE REPRESENTATION; DIMENSIONAL ARRAYS; HIERARCHICAL MEMORY; PAGING; PARALLEL LANGUAGES; QUAD TREES; RUNTIME ENVIRONMENTS;

INFORMATION MANAGEMENT;

ALGORITHMS; DATA BASES; INDEXING; PROGRAMING LANGUAGES;

EID: 84937431996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44520-x_108     Document Type: Conference Paper

References (18)

1. J. Backus. The history of FORTRAN I, II, and III. In R. L. Wexelblat (ed.), History of Program. Languages, New York, Academic Press (1981), 25–45. Also preprinted in SIGPLAN Not. 13, 8 (1978 August), 165–180.
2. R. M. Burstall & J. Darlington. A transformation system for developing recursive programs. J.ACM 24, 1 (1997 January), 44–67.
3. F.W. Burton, V. J. Kollias, J. G. Kollias. Real-time raster-to-quadtree and quadtree-toraster conversion algorithms with modest storage requirements. Angew. Informatik 4 (1986), 170–174.
4. H. G. Cragon A historical note on binary tree. SIGARCH Comput. Archit. News 18, 4 (1990 December), 3.
5. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, & T. von Eicken. LogP: a practical model of parallel computation. Commun. ACM 39, 11 (1996 November), 78–85.
6. J. Frens. Matrix Factorization Using a Block-Recursive Structure and Block-Recursive Algorithms. PhD dissertation, Indiana University, Bloomington (in progress).
7. J. Frens & D. S. Wise. Auto-blocking matrix multiplication, or tracking BLAS3 performance from source code. Proc. 1997 ACMSymp. on Principles and Practice of Parallel Program., SIGPLAN Not. 32, 7 (1997 July), 206–216.
8. M. Frigo, C. E. Leiserson, H. Prokop, & S. Ramachandran. Cache-oblivious algorithms, Extended abstract. Lab for Computer Science, M.I.T., Cambridge, MA (1999 May). http://supertech.lcs.mit.edu/cilk/papers/abstracts/FrigoLePr99.html
9. Y. C. Hu, S. L. Johnsson & S.H. Teng. High performance Fortran for highly irregular problems. Proc. 6th ACM SIGPLAN Symp. on Principles and Practice of Parallel Program., SIGPLAN Not. 32, 7 (1977 July), 13–24.
10. D. E. Knuth. The Art of Computer Programming I, Fundamental Algorithms (3rd ed.), Reading, MA: Addison-Wesley, (1997).
11. G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Ottawa, Ontario: IBM Ltd. (1966 March 1).
12. J. A. Orenstein & T. H. Merrett. A class of data structures for associative searching. Proc. 3rd ACM SIGACT–SIGMOD Symp. on Princ. of Database Systems (1984), 181–190.
13. H. Samet. The Design and Analysis of Spatial Data Structures Reading, MA: Addison- Wesley, (1990), x2.7.
14. G. Schrack. Finding neighbors of equal size in linear quadtrees and octrees in constant time. CVGIP: Image Underst. 55, 3 (1992 May), 221-230.
15. K. D. Tocher. The application of automatic computers to sampling experiments. J. Roy. Statist. Soc. Ser. B 16, 1 (1954), 39–61.
16. M. S. Warren & J. K. Salmon. A parallel hashed oct-tree N-body problem. Proc. Supercomputing ’93. Los Alamitos, CA: IEEE Computer Society Press (1993), 12–21.
17. D. S. Wise. Undulant block elimination and integer-preserving matrix inversion. Sci. Comput. Program. 33, 1 (1999 January), 29–85. http://www.cs.indiana.edu/ftp/techreports/TR418.html
18. D. S. Wise & J. Frens. Morton-order matrices deserve compilers’ support. Technical Report 533, Computer Science Dept, Indiana University (1999 November). http://www.cs.indiana.edu/ftp/techreports/TR533.html