+612 9045 4394
 
CHECKOUT
Fault Covering Problems in Reconfigurable VLSI Systems : The Springer International Series in Engineering and Computer Science - Ran Libeskind-Hadas

Fault Covering Problems in Reconfigurable VLSI Systems

The Springer International Series in Engineering and Computer Science

Hardcover

Published: 30th April 1992
Ships: 7 to 10 business days
7 to 10 business days
RRP $415.99
$287.90
31%
OFF
or 4 easy payments of $71.97 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 8th October 2012
    $227.90

Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems.
Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems.
The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems.
The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.

Preface
An Overviewp. 1
Introductionp. 1
The Embedding Approachp. 3
The Covering Approachp. 7
Previous Workp. 7
Physical Implementation Issues in Reconfigurable Designp. 9
Overview of Remaining Chaptersp. 15
Fault Covers in Rectangular Arraysp. 19
Introductionp. 19
Admissible Assignmentsp. 21
The Feasible Minimum Cover Problemp. 24
Critical Setsp. 25
An Exhaustive Search Algorithm for the Feasible Minimum Cover Problemp. 33
Experimental Resultsp. 38
The Feasible Cover Problemp. 39
Excess-k Critical Setsp. 39
Experimental Resultsp. 45
Two Reconfiguration Problemsp. 47
Reconfiguration with Shared Sparesp. 49
Reconfiguration of Programmable Logic Arraysp. 50
Summaryp. 54
Fault Covers in Heterogeneous and General Arraysp. 55
Introductionp. 55
Fault Covers in Heterogeneous Arraysp. 56
The Feasible Cover Problemp. 58
The Feasible Minimum Cover Problemp. 62
The Minimum Feasible Cover Problemp. 64
The Feasible Cover Problem with Multiple Spare Arraysp. 71
Applications of the Heterogeneous Array Modelp. 74
Fault Covers in General Arraysp. 76
The Feasible Cover Problemp. 78
The Feasible Minimum Cover Problemp. 83
The Minimum Feasible Cover Problemp. 86
Summaryp. 89
General Formulation of Fault Covering Problemsp. 91
Introductionp. 91
A General Formulationp. 93
Illustrative Examplesp. 96
Integer Linear Programming Approachp. 100
The General Transformationp. 101
Experimental Resultsp. 105
Complexity Analysis of Subcasesp. 107
The Definition of Subcases and Their Complexitiesp. 108
Polynomial Time Algorithmsp. 110
NP-Completeness Resultsp. 112
Summaryp. 116
Bibliographyp. 119
Indexp. 129
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780792392316
ISBN-10: 0792392310
Series: The Springer International Series in Engineering and Computer Science
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 130
Published: 30th April 1992
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 23.5 x 15.5  x 1.91
Weight (kg): 0.86