See this document in CiteSeerX!

Morton-order Matrices Deserve Compilers' Support (1999)  (Make Corrections)  (4 citations)
David S. Wise, Jeremy D. Frens



  Home/Search   Context   Related

 
View or download:
indiana.edu/hyplan/dswise/morton.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/hyplan/dswise/649 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A proof of concept is offered for the uniform representation of matrices serially in Morton-order (or Z-order) representation, as well as their divide-and-conquer processing as quaternary trees. Generally, d dimensional arrays are accessed as 2 d -ary trees. This data structure is important because, at once, it relaxes serious problems of locality and latency, while the tree helps schedule multi-processing. It enables algorithms that avoid cache misses and page faults at all levels in... (Update)

BibTeX entry:   (Update)

D. S. Wise and J. D. Frens. Morton-order Matrices Deserve Compilers' Support. Technical Report, TR533, Nov. 1999. http://citeseer.ist.psu.edu/wise99mortonorder.html   More

@misc{ wise99mortonorder,
  author = "D. Wise and J. Frens",
  title = "Morton-order Matrices Deserve Compilers' Support",
  text = "D. S. Wise and J. D. Frens. Morton-order Matrices Deserve Compilers' Support.
    Technical Report, TR533, Nov. 1999.",
  year = "1999",
  url = "citeseer.ist.psu.edu/wise99mortonorder.html" }
Citations (may not include all citations):
2003   The Art of Computer Programming (context) - Knuth - 1997
385   A transformation system for developing recursive programs - Burstall, Darlington - 1977
273   Can programming be liberated from the von Neumann style (context) - Backus - 1978
245   An extended set of FORTRAN basic linear algebra subprograms - Dongarra, DuCroz et al. - 1988
168   Gaussian elimination is not optimal (context) - Strassen - 1969
157   Automatically tuned linear algebra software - Whaley, Dongarra - 1998
106   Unifying data and control transformations for distributed sh.. - Cierniak, Li - 1995
89   A gentle introduction to HASKELL - Fasel, Hudak - 1992
81   A class of data structures for associative searching (context) - Orenstein, Merrett - 1984
81   The implementation of the CILK-5 multithreaded language - Frigo, Leiserson et al. - 1998
72   LogP: a practical model of parallel computation (context) - Culler, Karp et al. - 1996
64   Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
60   Recursion leads to automatic variable blocking for dense lin.. (context) - Gustavson - 1997
58   Nonlinear array layouts for hierarchical memory systems - Chatterjee, Jain et al. - 1999
55   Baltimore: The Johns Hopkins University Press (context) - Golub, Van Loan et al. - 1989

[Article contains additional citations not shown here]

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC