US 11,983,477 B2
Routing layer re-optimization in physical synthesis
Lakshmi N. Reddy, Mount Kisco, NY (US); Ying Zhou, Austin, TX (US); Cindy S. Washburn, Poughquag, NY (US); and Alexander Joel Suess, Hopewell Junction, NY (US)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Aug. 17, 2021, as Appl. No. 17/404,977.
Prior Publication US 2023/0059055 A1, Feb. 23, 2023
Int. Cl. G06F 30/394 (2020.01); G06F 30/3312 (2020.01); G06F 30/398 (2020.01)
CPC G06F 30/394 (2020.01) [G06F 30/3312 (2020.01); G06F 30/398 (2020.01)] 18 Claims
OG exemplary drawing
 
1. A method comprising:
at an end point of physical design synthesis optimization flow for a putative integrated circuit design having a plurality of nets, identifying at least one congested region in said putative integrated circuit design;
identifying those of said nets of said putative integrated circuit design traversing through said at least one congested region, to obtain a plurality of candidate nets for demotion;
demoting a plurality of selected nets, selected from said plurality of candidate nets for demotion, from an upper routing layer of said putative integrated circuit design to a lower routing layer of said putative integrated circuit design, wherein at least some of said plurality of selected nets experience a loss of timing quality of result after said demoting; and
limiting negative impact to timing closure of said putative integrated circuit design by selecting said plurality of selected nets from said plurality of candidate nets for demotion and by refraining from demotion based on a constraint of not introducing any new net timing slacks below a predetermined limit to said putative integrated circuit design during said demoting, wherein said not introducing any new net timing slacks below said predetermined limit to said putative integrated circuit design during said demoting comprises not demoting a given one of said plurality of candidate nets for demotion responsive to determining that:
a timing slack of said given one of said candidate nets for demotion before demotion less a timing slack of said given one of said candidate nets for demotion after demotion would exceed a predetermined technology-dependent constant; and
said timing slack of said given one of said candidate nets for demotion after demotion would be less than a scaled worst overall latch-to-latch slack.