Parallel computing is becoming an increasingly cost effective and affordable means for providing enormous computing power, and massively parallel (MPP) machines have been relatively easy to build. However, designing good parallel algorithms that can efficiently use the hardware resources to get the
Vlsi and Parallel Computation
β Scribed by Robert Suaya, Graham Birtwistle
- Publisher
- Morgan Kaufmann Pub
- Year
- 1990
- Tongue
- English
- Leaves
- 490
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book deals with issues from the world of highly parallel systems containing hundreds of thousands of processors. Very Large Scale Integration (VLSI) and concurrency, using a large set of processors, provide an opportunity to surpass the limits of vector supercomputers and address fundamental problems in computer science. Important applications for this work are found in areas such as vision and speech research, VLSI design verification, 3-D animation in graphics, and automated reasoning. The chapters in this book explore the great potential for this approach in these and other areas. Encompassing theoretical models, VLSI design, routing, and machine implementations, each of the seven chapters is written by a well-known researcher in the field. Topics include an introduction to concurrency and message-passing computers, PRAMS, fixed interconnection networks, parallel algorithms, scheduling, resource management, efficient communication, analog computation, neural networks, and CAD VLSI design.
π SIMILAR VOLUMES
This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of design
<p>The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamenΒ tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication c