## A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels

- Vinod Valsalam, Anthony Skjellum
- Concurrency and Computation: Practice and…
- 2002

Highly Influenced

@inproceedings{Wise1999MortonorderMD, title={Morton-order Matrices Deserve Compilers ’ Support Technical Report 533}, author={David S. Wise and Jeremy D. Frens}, year={1999} }

- Published 1999

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-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 hierarchical… CONTINUE READING

Highly Cited

This paper has 25 citations. REVIEW CITATIONS