Authors:
Part of the book series: The Springer International Series in Engineering and Computer Science (SECS, volume 172)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (4 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Authors and Affiliations
-
University of Illinois, Urbana-Champaign, USA
Ran Libeskind-Hadas, C. L. Liu
-
IBM Corporation, Armonk, USA
Nany Hasan
-
University of California, Los Angeles, USA
Jason Cong
-
Michigan State University, USA
Philip K. McKinley
Bibliographic Information
Book Title: Fault Covering Problems in Reconfigurable VLSI Systems
Authors: Ran Libeskind-Hadas, Nany Hasan, Jason Cong, Philip K. McKinley, C. L. Liu
Series Title: The Springer International Series in Engineering and Computer Science
DOI: https://doi.org/10.1007/978-1-4615-3614-7
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1992
Hardcover ISBN: 978-0-7923-9231-6Published: 30 April 1992
Softcover ISBN: 978-1-4613-6606-5Published: 08 October 2012
eBook ISBN: 978-1-4615-3614-7Published: 06 December 2012
Series ISSN: 0893-3405
Edition Number: 1
Number of Pages: XIII, 130