Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

We investigate the effect that caches have on the performance of sorting algorithms both
experimentally and analytically. To address the performance problems that high cache miss …

High performance applications involving large data sets require the efficient and flexible use
of multiple disks. In an external memory machine with D parallel, independent disks, only …

Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The re sulting input/output communication (or I/O) between fast internal …

There is arguably no field in greater need of a comprehensive handbook than computer
engineering. The unparalleled rate of technological advancement, the explosion of …

Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …

The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard
interface between parallel software and hardware. In theory, the BSP model has been …

Contemporary accelerator designs exhibit a high degree of spatial localization, wherein two-
dimensional physical distance determines communication costs between processing …

Abstract Breadth First Search (BFS) traversal is an archetype for many important graph
problems. However, computing a BFS level decomposition for massive graphs was …

This paper presents a general methodology for the efficient parallelization of existing data
cube construction algorithms. We describe two different partitioning strategies, one for top …