The Community for Technology Leaders
Design Automation Conference (2000)
Los Angeles, CA
June 5, 2000 to June 9, 2000
ISBN: 1-58113-1897-9
pp: 270-273
Rajendran Panda , Motorola, Inc., Austin, TX
David Blaauw , Motorola, Inc., Austin, TX
Abhijit Das , Motorola, Inc., Austin, TX
ABSTRACT
We present a new method for removing user-specified false subgraphs from timing analysis and circuit optimization. Given a timing graph and a list of specified false paths, false subpaths, or false subgraphs, we generate a new timing graph in which all specified false paths are removed using a process of node splitting and edge removal. We present the necessary and sufficient condition for splitting a node, and show that the number of nodes that must be added to the timing graph is linear with the size of the false path specification. We also present an algorithm for finding the minimum set of nodes that must be split. Since this algorithm requires exponential run time for false subpaths and false subgraphs, we present a heuristic splitting approach which has linear worst-case run time, and where the number of added nodes is linear with the size of the false path specification. The heuristic approach was implemented and results are given for large industrial circuits.
INDEX TERMS
nanotechnology, quantum cellular automata
CITATION
Rajendran Panda, David Blaauw, Abhijit Das, "Removing User Specified False Paths from Timing Graphs", Design Automation Conference, vol. 00, no. , pp. 270-273, 2000, doi:10.1109/DAC.2000.855317
93 ms
(Ver 3.3 (11022016))