In this first volume of Algorithms and Parallel VLSI Architectures are collected 21 lectures and tutorials which have been presented at the above mentioned Workshop. A companion volume entitled Algorithms and Parallel VLSI Architectures Volume B - Proceedings contains a further 50 proceedings papers. There has been a growing interest in the interplay between the development of algorithms and the design of architectures. Recent developments in VLSI technology combined with increasing insight into the theoretical basis of numerical computations has led to an increasing demand for VLSI Algorithms for the sake of the vast application potentialities in real-time signal and image processing, space-time critical scientific computations and other large and structured problems. The lectures and tutorials which are included in this volume elaborate and illustrate such mutual influences between theoretical results and their algorithmic and architectural representations and implementations. The papers present some intriguing results from recent developments in the areas of network theory and linear algebra.
The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field. The second edition builds on the success of the former edition with more than 150 completely new entries, designed to ensure that the reference addresses recent areas where optimization theories and techniques have advanced. Particularly heavy attention resulted in health science and transportation, with entries such as "Algorithms for Genomics", "Optimization and Radiotherapy Treatment Design", and "Crew Scheduling".
This volume reviews, in the context of partial differential equations, algorithm development that has been specifically aimed at computers that exhibit some form of parallelism. Emphasis is on the solution of PDEs because these are typically the problems that generate high computational demands. The authors discuss architectural features of these computers insomuch as they influence algorithm performance, and provide insight into algorithm characteristics that allow effective use of hardware.
Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra, including (1) direct solution of dense, structured, or sparse linear systems, (2) dense or structured least squares computations, (3) dense or structured eigenvaluen and singular value computations, and (4) rapid elliptic solvers. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms. Consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra--direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers, plus an extensive up-to-date bibliography (2,000 items) on related research.
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extract