Contents: Foreword. Preface. Models and mechanisms in parallel computation. A general-purpose shared-memory model for parallel computation (Vijaya Ramachandran). Supporting a coherent shared address space across SMP nodes: An applicationdriven investigation (Angelos Bilas, Liviu Iftode, Rudrajit Samanta and Jaswinder Pal Singh). Single-message vs. batch communication (Mark W. Goudreau and Satish B. Rao). Some simple and practicle strategies for parallelism.
Discrete and combinatorial algorithms. Locality in computing connected components (Abhiram Ranade). Routing in optical and wireless networks (Eric J. Schwabe). Transparent parallel transactions on replicated autonomous databases (Rekha Goel and Gautam M. Shroff).
Mathematics of parallelizing compilers. Mathematical tools for loop transofmations: From systems of uniform recurrence equations to the polytope model (Alain Darte).
Numerical algorithms. The scalability of mesh improvement algorithms (Lori A. Freitag, Mark T. Jones and Paul E. Plassmann). Data parallel performance optimizations using array aliasing (Y. Charlie Hu and S. Lennart Johnsson). Coarsening, sampling, and smoothing: Elements of the multilevel method (Shang-Hua Teng). Some methods of parallel pseudorandom number generation (Michael Mascagni). Performance of parallel sparse triangular solution (Michael T. Heath and Padma Raghavan). Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programming (Thomas H. Cormen).
Parallel computer systems and software. Enabling department-scale supercomputing (David S. Greenberg, William E. Hart and Cynthia A. Phillips). Providing uniform dynamic access to numerical software (Henri Casanova and Jack Dongarra).