Heath M.T., Ranade A., Schreiber R.S. (eds.) Algorithms for Parallel Processing

Springer, 1999. — 373 p.This IMA Volume in Mathematics and its Applications Algorithms for Parallel Processing is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "Mathematics in High-Performance Computing." The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. The main idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.Models and Mechanisms In Parallel Computation
A general-purpose shared-memory model for parallel computation
Supporting a coherent shared address space across
SMP nodes: An application-driven investigation
Single-message vs. batch communication
Some simple and practical strategies for parallelism
Discrete and Combinatorial Algorithms
Locality in computing connected components
Routing in optical and wireless networks
Transparent parallel transactions on replicated autonomous databases
Mathematics of Parallelizing Compilers
Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope model
Numerical Algorithms
The scalability of mesh improvement algorithms
Data parallel performance optimizations using array aliasing
Coarsening, sampling, and smoothing: Elements of the multilevel method
Some methods of parallel pseudorandom number generation
Performance of parallel sparse triangular solution
Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programming
Parallel Computer Systems and Software
Enabling department-scale supercomputing
Providing uniform dynamic access to numerical software