Hardware Acceleration of EDA Algorithms: Custom ICs, FPGAs and GPUs
โ Scribed by Kanupriya Gulati, Sunil P. Khatri (auth.)
- Publisher
- Springer US
- Year
- 2010
- Tongue
- English
- Leaves
- 207
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Hardware Acceleration of EDA Algorithms: Custom ICs, FPGAs and GPUs
Kanupriya Gulati
Sunil P. Khatri
This book deals with the acceleration of EDA algorithms using hardware platforms such as Custom ICs, FPGAs and GPUs. Widely applied CAD algorithms are studied for potential acceleration on these platforms. Coverage includes discussion of conditions under which it is preferable to use one platform over another, e.g., when an EDA problem has a high degree of data parallelism, the GPU is typically the preferred platform, whereas when the problem has more control, an FPGA may be preferred. Results are presented for the acceleration of several CAD algorithms (fault simulation, fault table generation, model card evaluation in SPICE, Monte Carlo based statistical static timing analysis, Boolean Satisfiability), demonstrating speedups up to 800X compared to single-core implementatinos of these algorithms.
This book serves as a valuable guide on how best to leverage parallelism to accelerate CAD algorithms. It also presents a methodology to automatically extract SIMD parallelism from regular uniprocessor code which satisfies a set of constraints. With this approach, such uniprocessor code can automatically be converted to GPU code, allowing for significant acceleration. This approach is particularly useful since different GPUs have vastly different specifications, making the manual generation of GPU code an unscalable proposition.
In particular, this book:
- Provides guidelines on whether to use Custom ICs, GPUs or FPGAs when accelerating a given EDA algorithm, validating these suggestions with a concrete example (Boolean Satisfiability) implemented on all these platforms;
- Demonstrates the acceleration of several popular EDA algorithms on GPUs, with speedups up to 800X;
- Helps the reader by presenting example algorithms which may be used by the reader to determine how best to accelerate their specific EDA algorithm;
- Discusses an automatic approach to generate GPU code, given regular uniprocessor code which satisfies a set of constraints;
- Serves as a valuable reference for anyone interested in exploring alternative hardware platforms for accelerating various EDA applications by harnessing the parallelism available in these platforms.
โฆ Table of Contents
Front Matter....Pages i-xxii
Introduction....Pages 1-5
Front Matter....Pages 7-8
Hardware Platforms....Pages 9-22
GPU Architecture and the CUDA Programming Model....Pages 23-30
Front Matter....Pages 31-32
Accelerating Boolean Satisfiability on a Custom IC....Pages 33-61
Accelerating Boolean Satisfiability on an FPGA....Pages 63-81
Accelerating Boolean Satisfiability on a Graphics Processing Unit....Pages 83-99
Front Matter....Pages 101-103
Accelerating statistical static Timing Analysis Using Graphics Processors....Pages 105-118
Accelerating Fault Simulation Using Graphics Processors....Pages 119-132
Fault Table Generation Using Graphics Processors....Pages 133-152
Accelerating Circuit Simulation Using Graphics Processors....Pages 153-165
Front Matter....Pages 167-167
Automated Approach for Graphics Processor Based Software Acceleration....Pages 169-180
Conclusions....Pages 181-187
Back Matter....Pages 189-192
โฆ Subjects
Circuits and Systems; Computer-Aided Engineering (CAD, CAE) and Design
๐ SIMILAR VOLUMES
<span>Single-threaded software applications have ceased to see signi?cant gains in p- formance on a general-purpose CPU, even with further scaling in very large scale integration (VLSI) technology. This is a signi?cant problem for electronic design automation (EDA) applications, since the design com
<p><p>This book suggests and describes a number of fast parallel circuits for data/vector processing using FPGA-based hardware accelerators. Three primary areas are covered: searching, sorting, and counting in combinational and iterative networks. These include the application of traditional structu
This book describes algorithms and hardware implementations of computer holography, especially in terms of fast calculation. It summarizes the basics of holography and computer holography and describes how conventional diffraction calculations play a central role. Numerical implementations by actual
<p><P>Much of the research effort in mobile robots in the recent past has been on sensing and design of time-efficient algorithms for tasks such as localization, mapping and navigation. Mobile robots typically employ an embedded computer for high level computations. As applications of robots expand,