Sciweavers

Share
GLVLSI
2010
IEEE

Resource-constrained timing-driven link insertion for critical delay reduction

9 years 1 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the open defects. Based on the assumption of a single wiring open in a signal net, it is known that the non-tree interconnection of a signal net has no adjacent loop. In this paper, based on the concept of splitting a time-equivalent node or edge in a cyclic connection for timing analysis, a 0-1 integer linear programming(ILP) formulation for resource-constrained timing-driven link insertion is proposed to insert timing-driven links to maximize the reduced delay of the critical path in a rectilinear Steiner tree under a given resource constraint. The experimental results show that our proposed
Jin-Tai Yan, Zhi-Wei Chen
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2010
Where GLVLSI
Authors Jin-Tai Yan, Zhi-Wei Chen
Comments (0)
books