We propose a taxonomy of parallel sorting that encompasses a broad range of array-and file-
sorting algorithms. We analyze how research on parallel sorting has evolved, from the …

The success of the von Neumann model of sequential computation is attributable to the fact
that it is an efficient bridge between software and hardware: high-level languages can be …

One of the greatest challenges faced by designers of digital systems is optimizing the
communication and interconnection between system components. Interconnection networks …

We investigate certain fundamental problems in decentralized decision making and
computation. We study the problem of whether a set of decision makers (or processors) with …

We give a parallel implementation of merge sort on a CREW PRAM that uses n processors
and O(\logn) time; the constant in the running time is small. We also give a more complex …

Google's MapReduce programming model serves for processing large data sets in a
massively parallel manner. We deliver the first rigorous description of the model including its …

In this paper we propose a new algorithm for finding the blocks (biconnected components) of
an undirected graph. A serial implementation runs in O(n+m) time and space on a graph of n …

We describe efficient deterministic techniques for breaking symmetry in parallel. The
techniques work well on rooted trees and graphs of constant degree or genus. Our primary …

Parallel computation | Guide books skip to main content ACM Digital Library home ACM
Association for Computing Machinery corporate logo Google, Inc. (search) Advanced Search …

We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine
composed of thousands of autonomous processing elements. This machine uses an …