Phantom redundancy

A register transfer level technique for gracefully degradable data path synthesis

Ramesh Karri, Balakrishnan Iyer, Israel Koren

Research output: Contribution to journalArticle

Abstract

In this paper, the authors present an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single)functional unit failure. When phantom redundancy is combined with a concurrent error detection technique, error detection followed by reconfiguration is automatic. The authors developed a register transfer level synthesis algorithm that incorporates phantom redundancy constraints. There is a tight interdependence between reconfiguration of a (faulty) data path and scheduling and operation-to-operator binding tasks during register transfer level synthesis. They developed a genetic algorithm.based register transfer level synthesis approach to incorporate phantom redundancy constraints. The algorithm minimizes the performance degradation of the synthesized data path in the presence of any single faulty functional unit. The effectiveness of the technique and the algorithm are illustrated using high-level synthesis benchmarks.

Original languageEnglish (US)
Pages (from-to)877-888
Number of pages12
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume21
Issue number8
DOIs
StatePublished - Aug 2002

Fingerprint

Redundancy
Error detection
Genetic algorithms
Scheduling
Recovery
Degradation

Keywords

  • Data path synthesis
  • Graceful degradation
  • Reconfigurable data paths
  • Register transfer level
  • VLSI testing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Phantom redundancy : A register transfer level technique for gracefully degradable data path synthesis. / Karri, Ramesh; Iyer, Balakrishnan; Koren, Israel.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 21, No. 8, 08.2002, p. 877-888.

Research output: Contribution to journalArticle

@article{19f40f78fad04b08927eac54553397bf,
title = "Phantom redundancy: A register transfer level technique for gracefully degradable data path synthesis",
abstract = "In this paper, the authors present an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single)functional unit failure. When phantom redundancy is combined with a concurrent error detection technique, error detection followed by reconfiguration is automatic. The authors developed a register transfer level synthesis algorithm that incorporates phantom redundancy constraints. There is a tight interdependence between reconfiguration of a (faulty) data path and scheduling and operation-to-operator binding tasks during register transfer level synthesis. They developed a genetic algorithm.based register transfer level synthesis approach to incorporate phantom redundancy constraints. The algorithm minimizes the performance degradation of the synthesized data path in the presence of any single faulty functional unit. The effectiveness of the technique and the algorithm are illustrated using high-level synthesis benchmarks.",
keywords = "Data path synthesis, Graceful degradation, Reconfigurable data paths, Register transfer level, VLSI testing",
author = "Ramesh Karri and Balakrishnan Iyer and Israel Koren",
year = "2002",
month = "8",
doi = "10.1109/TCAD.2002.800450",
language = "English (US)",
volume = "21",
pages = "877--888",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Phantom redundancy

T2 - A register transfer level technique for gracefully degradable data path synthesis

AU - Karri, Ramesh

AU - Iyer, Balakrishnan

AU - Koren, Israel

PY - 2002/8

Y1 - 2002/8

N2 - In this paper, the authors present an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single)functional unit failure. When phantom redundancy is combined with a concurrent error detection technique, error detection followed by reconfiguration is automatic. The authors developed a register transfer level synthesis algorithm that incorporates phantom redundancy constraints. There is a tight interdependence between reconfiguration of a (faulty) data path and scheduling and operation-to-operator binding tasks during register transfer level synthesis. They developed a genetic algorithm.based register transfer level synthesis approach to incorporate phantom redundancy constraints. The algorithm minimizes the performance degradation of the synthesized data path in the presence of any single faulty functional unit. The effectiveness of the technique and the algorithm are illustrated using high-level synthesis benchmarks.

AB - In this paper, the authors present an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single)functional unit failure. When phantom redundancy is combined with a concurrent error detection technique, error detection followed by reconfiguration is automatic. The authors developed a register transfer level synthesis algorithm that incorporates phantom redundancy constraints. There is a tight interdependence between reconfiguration of a (faulty) data path and scheduling and operation-to-operator binding tasks during register transfer level synthesis. They developed a genetic algorithm.based register transfer level synthesis approach to incorporate phantom redundancy constraints. The algorithm minimizes the performance degradation of the synthesized data path in the presence of any single faulty functional unit. The effectiveness of the technique and the algorithm are illustrated using high-level synthesis benchmarks.

KW - Data path synthesis

KW - Graceful degradation

KW - Reconfigurable data paths

KW - Register transfer level

KW - VLSI testing

UR - http://www.scopus.com/inward/record.url?scp=0036683885&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036683885&partnerID=8YFLogxK

U2 - 10.1109/TCAD.2002.800450

DO - 10.1109/TCAD.2002.800450

M3 - Article

VL - 21

SP - 877

EP - 888

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 8

ER -