DTR: a defect-tolerant routing algorithm

  • Authors:
  • A. Pitaksanonkul;S. Thanawastien;C. Lursinsap;J. A. Gandhi

  • Affiliations:
  • The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA;The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA;The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA;The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA

  • Venue:
  • DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new channel routing algorithm called DTR (Defect-Tolerant Routing) is investigated. This algorithm minimizes the total area and simultaneously maximizes the performance by reducing the critical area which can potentially be the source of logical faults caused by the bridging effects of spot defects. Experimental results show DTR produces less critical area than Yoshimura&Kuh's algorithm [1].