We survey routing problems on fixed-connection networks. We consider many aspects of the
routing problem and provide known theoretical results for various communication models …

The ability of parallel computing to process large data sets and handle time-consuming
operations has resulted in unprecedented advances in biological and scientific computing …

This paper surveys and places into perspective a number of results concerning the D-BSP
(Decomposable Bulk Synchronous Parallel) model of computation, a variant of the popular …

This introduction to networking large scale parallel computer systems acts as a primary
resource for a wide readership, including network systems engineers, electronics engineers …

We introduce a novel methodology for the quantitative assessment of the effectiveness and
portability of models of parallel computation. Specifically, we relate the effectiveness of a …

Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also, because
of its linear sequential complexity, it requires considerable effort just to reach speed-up one …

This paper provides an overview of lower and upper bounds for algorithms for mesh-
connected processor networks. Most of our attention goes to routing and sorting problems …

Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also because
of its linear sequential complexity, it requires considerable effort to just reach speed-up one …

In this paper we present lower and upper bounds for the deterministic simulation of a
Parallel Random Access Machine (PRAM) with n processors and m variables on a …

We present a general deterministic scheme to implement a shared memory abstraction on
any distributed-memory machine which exhibits a clustered structure. More specifically, we …