This paper presents asymptotically optimal algorithms for rectangular matrix transpose, FFT,
and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms …

Matrix computations are both fundamental and ubiquitous in computational science and its
vast application areas. Along with the development of more advanced computer systems …

We present a new randomized method for computing the min-plus product (aka, tropical
product) of two n× n matrices, yielding a faster algorithm for solving the all-pairs shortest …

Efficient parallel multiplication of sparse matrices is key to enabling many large-scale
calculations. This article presents the DBCSR (Distributed Block Compressed Sparse Row) …

We describe a general framework for out-of-core rendering and management of massive
terrain surfaces. The two key components of this framework are: view-dependent refinement …

We present a novel algorithm to solve dense linear systems using graphics processors
(GPUs). We reduce matrix decomposition and row operations to a series of rasterization …

This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast
Fourier transform (FFT), and sorting on computers with multiple levels of caching. Unlike …

In this paper we introduce a new indexing scheme for progressive traversal and
visualization of large regular grids. We demonstrate the potential of our approach by …

While general-purpose homogeneous multi-core architectures are becoming ubiquitous,
there are clear indications that, for a number of important applications, a better …

We develop from first principles an exact model of the behavior of loop nests executing in a
memory hicrarchy, by using a nontraditional classification of misses that has the key property …