Algorithmic Aspects of VLSI Layout

Algorithmic Aspects of VLSI Layout

Author: Majid Sarrafzadeh

Publisher: World Scientific

Published: 1993

Total Pages: 411

ISBN-13: 981021488X

DOWNLOAD EBOOK

In the past two decades, research in VLSI physical design has been directed toward automation of layout process. Since the cost of fabricating a circuit is a fast growing function of the circuit area, circuit layout techniques are developed with an aim to produce layouts with small areas. Other criteria of optimality such as delay and via minimization need to be taken into consideration. This book includes 14 articles that deal with various stages of the VLSI layout problem. It covers topics including partitioning, floorplanning, placement, global routing, detailed routing and layout verification. Some of the chapters are review articles, giving the state-of-the-art of the problems related to timing driven placement, global and detailed routing, and circuit partitioning. The rest of the book contains research articles, giving recent findings of new approaches to the above-mentioned problems. They are all written by leading experts in the field. This book will serve as good references for both researchers and professionals who work in this field.


Parallel Algorithms for VLSI Computer-aided Design

Parallel Algorithms for VLSI Computer-aided Design

Author: Prithviraj Banerjee

Publisher: Prentice Hall

Published: 1994-01-01

Total Pages: 699

ISBN-13: 9780130158352

DOWNLOAD EBOOK

This text discusses the design and use of practical parallel algorithms for solving problems in a growing application area whose computational requirements are enormous - VLSI CAD applications.


Evolutionary Computation in Combinatorial Optimization

Evolutionary Computation in Combinatorial Optimization

Author: Peter Merz

Publisher: Springer Science & Business Media

Published: 2011-04-19

Total Pages: 274

ISBN-13: 3642203639

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, held in Torino, Italy, in April 2011. The 22 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.


Field-Coupled Nanocomputing

Field-Coupled Nanocomputing

Author: Neal G. Anderson

Publisher: Springer

Published: 2014-05-31

Total Pages: 395

ISBN-13: 3662437228

DOWNLOAD EBOOK

Field-coupled nanocomputing (FCN) paradigms offer fundamentally new approaches to digital information processing that do not utilize transistors or require charge transport. Information transfer and computation are achieved in FCN via local field interactions between nanoscale building blocks that are organized in patterned arrays. Several FCN paradigms are currently under active investigation, including quantum-dot cellular automata (QCA), molecular quantum cellular automata (MQCA), nanomagnetic logic (NML), and atomic quantum cellular automata (AQCA). Each of these paradigms has a number of unique features that make it attractive as a candidate for post-CMOS nanocomputing, and each faces critical challenges to realization. This State-of-the-Art-Survey provides a snapshot of the current developments and novel research directions in the area of FCN. The book is divided into five sections. The first part, Field-Coupled Nanocomputing Paradigms, provides valuable background information and perspectives on the QDCA, MQCA, NML, and AQCA paradigms and their evolution. The second section, Circuits and Architectures, addresses a wide variety of current research on FCN clocking strategies, logic synthesis, circuit design and test, logic-in-memory, hardware security, and architecture. The third section, Modeling and Simulation, considers the theoretical modeling and computer simulation of large FCN circuits, as well as the use of simulations for gleaning physical insight into elementary FCN building blocks. The fourth section, Irreversibility and Dissipation, considers the dissipative consequences of irreversible information loss in FCN circuits, their quantification, and their connection to circuit structure. The fifth section, The Road Ahead: Opportunities and Challenges, includes an edited transcript of the panel discussion that concluded the FCN 13 workshop.


Scheduling in Parallel Computing Systems

Scheduling in Parallel Computing Systems

Author: Shaharuddin Salleh

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 177

ISBN-13: 1461550653

DOWNLOAD EBOOK

Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques advocates the viability of using fuzzy and annealing methods in solving scheduling problems for parallel computing systems. The book proposes new techniques for both static and dynamic scheduling, using emerging paradigms that are inspired by natural phenomena such as fuzzy logic, mean-field annealing, and simulated annealing. Systems that are designed using such techniques are often referred to in the literature as `intelligent' because of their capability to adapt to sudden changes in their environments. Moreover, most of these changes cannot be anticipated in advance or included in the original design of the system. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques provides results that prove such approaches can become viable alternatives to orthodox solutions to the scheduling problem, which are mostly based on heuristics. Although heuristics are robust and reliable when solving certain instances of the scheduling problem, they do not perform well when one needs to obtain solutions to general forms of the scheduling problem. On the other hand, techniques inspired by natural phenomena have been successfully applied for solving a wide range of combinatorial optimization problems (e.g. traveling salesman, graph partitioning). The success of these methods motivated their use in this book to solve scheduling problems that are known to be formidable combinatorial problems. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques is an excellent reference and may be used for advanced courses on the topic.


ALGORITHMS VLSI DESIGN AUTOMATION

ALGORITHMS VLSI DESIGN AUTOMATION

Author: Gerez

Publisher: John Wiley & Sons

Published: 2006-06

Total Pages: 344

ISBN-13: 9788126508211

DOWNLOAD EBOOK

Market_Desc: · Electrical Engineering Students taking courses on VLSI systems, CAD tools for VLSI, Design Automation at Final Year or Graduate Level, Computer Science courses on the same topics, at a similar level· Practicing Engineers wishing to learn the state of the art in VLSI Design Automation· Designers of CAD tools for chip design in software houses or large electronics companies. Special Features: · Probably the first book on Design Automation for VLSI Systems which covers all stages of design from layout synthesis through logic synthesis to high-level synthesis· Clear, precise presentation of examples, well illustrated with over 200 figures· Focus on algorithms for VLSI design tools means it will appeal to some Computer Science as well as Electrical Engineering departments About The Book: Enrollments in VLSI design automation courses are not large but it's a very popular elective, especially for those seeking a career in the microelectronics industry. Already the reviewers seem very enthusiastic about the coverage of the book being a better match for their courses than available competitors, because it covers all design phases. It has plenty of worked problems and a large no. of illustrations. It's a good 'list-builder' title that matches our strategy of focusing on topics that lie on the interface between Elec Eng and Computer Science.


并行程序设计

并行程序设计

Author: Foster

Publisher:

Published: 2002

Total Pages: 381

ISBN-13: 9787115103475

DOWNLOAD EBOOK

国外著名高等院校信息科学与技术优秀教材


VLSI Physical Design: From Graph Partitioning to Timing Closure

VLSI Physical Design: From Graph Partitioning to Timing Closure

Author: Andrew B. Kahng

Publisher: Springer Science & Business Media

Published: 2011-01-27

Total Pages: 310

ISBN-13: 9048195918

DOWNLOAD EBOOK

Design and optimization of integrated circuits are essential to the creation of new semiconductor chips, and physical optimizations are becoming more prominent as a result of semiconductor scaling. Modern chip design has become so complex that it is largely performed by specialized software, which is frequently updated to address advances in semiconductor technologies and increased problem complexities. A user of such software needs a high-level understanding of the underlying mathematical models and algorithms. On the other hand, a developer of such software must have a keen understanding of computer science aspects, including algorithmic performance bottlenecks and how various algorithms operate and interact. "VLSI Physical Design: From Graph Partitioning to Timing Closure" introduces and compares algorithms that are used during the physical design phase of integrated-circuit design, wherein a geometric chip layout is produced starting from an abstract circuit design. The emphasis is on essential and fundamental techniques, ranging from hypergraph partitioning and circuit placement to timing closure.