Introduction to Parallel Processing: Algorithms and Architectures / Edition 1by Behrooz Parhami
Pub. Date: 01/31/1999
Publisher: Springer US
THE CONTEXT OF PARALLEL PROCESSING The field of digital computer architecture has grown explosively in the past two decades. Through a steady stream of experimental research, tool-building efforts, and theoretical studies, the design of an instruction-set architecture, once considered an art, has been transformed into one of the most quantitative branches of computer… See more details below
THE CONTEXT OF PARALLEL PROCESSING The field of digital computer architecture has grown explosively in the past two decades. Through a steady stream of experimental research, tool-building efforts, and theoretical studies, the design of an instruction-set architecture, once considered an art, has been transformed into one of the most quantitative branches of computer technology. At the same time, better understanding of various forms of concurrency, from standard pipelining to massive parallelism, and invention of architectural structures to support a reasonably efficient and user-friendly programming model for such systems, has allowed hardware performance to continue its exponential growth. This trend is expected to continue in the near future. This explosive growth, linked with the expectation that performance will continue its exponential rise with each new generation of hardware and that (in stark contrast to software) computer hardware will function correctly as soon as it comes off the assembly line, has its down side. It has led to unprecedented hardware complexity and almost intolerable dev- opment costs. The challenge facing current and future computer designers is to institute simplicity where we now have complexity; to use fundamental theories being developed in this area to gain performance and ease-of-use benefits from simpler circuits; to understand the interplay between technological capabilities and limitations, on the one hand, and design decisions based on user and application requirements on the other.
Table of ContentsFundamental Concepts: Introduction to Parallelism. A Taste of Parallel Algorithms. Parallel Algorithm Complexity. Models of Parallel Processing. Extreme Models: PRAM and Basic Algorithms. More Shared-Memory Algorithms. Sorting and Selection Networks. Other Circuit-Level Examples. Mesh-Based Architectures: Sorting on a 2D Mesh or Torus. Routing on a 2D Mesh or Torus. Numerical 2D Mesh Algorithms. Other Mesh-Related Architectures. Low-Diameter Architectures: Hypercubes and Their Algorithms. Sorting and Routing on Hypercubes. Other Hypercubic Architectures. A Sampler of Other Networks. Some Broad Topics: Emulation and Scheduling. Data Storage, Input, and Output. Reliable Parallel Processing. System and Software Issues. Implementation Aspects: Shared-Memory MIMD Machines. Message-Passing MIMD Machines. Data-Parallel SIMD Machines. Past, Present, and Future. Index.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >