Routing-aware scan chain ordering

DMCA

Routing-aware scan chain ordering (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Puneet Gupta , Andrew B. Kahng , Stefanus Mantik

Venue:	In ProceedingsAsia and South-Pacific Design Automation Conference
Citations:	6 - 1 self

BibTeX

@INPROCEEDINGS{Gupta03routing-awarescan,
    author = {Puneet Gupta and Andrew B. Kahng and Stefanus Mantik},
    title = {Routing-aware scan chain ordering},
    booktitle = {In ProceedingsAsia and South-Pacific Design Automation Conference},
    year = {2003},
    pages = {857--862}
}

OpenURL

Abstract

Scan chain insertion can have a large impact on routability, wirelength and timing of the design. We present a routing-driven methodology for scan chain ordering with minimum wirelength objective. A routing-based approach to scan chain ordering, while potentially more accurate, can result in TSP (Traveling Salesman Problem) instances which are asymmetric and highly non-metric; this may require a careful choice of solvers. We evaluate our new methodology on recent industry place-and-route blocks with 1200 to 5000 scan cells. We show substantial wirelength reductions for the routing-based flow, versus the traditional placement-based flow: in a number of our test cases, over 86 % of scan routing overhead is saved. Even though our experiments are so far timing-oblivious, the routing-based flow does also improve evaluated timing, and practical timing-driven extensions appear feasible. 1

Keyphrases

routing-aware scan chain routing-based flow salesman problem traditional placement-based flow scan cell minimum wirelength objective substantial wirelength reduction large impact routing-driven methodology new methodology practical timing-driven extension careful choice recent industry place-and-route block test case scan chain scan chain insertion routing-based approach chain ordering

DMCA