US 11,720,732 B2
Determining a blended timing constraint that satisfies multiple timing constraints and user-selected specifications
Chris Aaron Cavitt, Poughkeepsie, NY (US); Brandon Albert Bruen, Wappingers Falls, NY (US); Eric Foreman, Fairfax, VT (US); and Jesse Peter Surprise, Highland, NY (US)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Aug. 16, 2021, as Appl. No. 17/402,739.
Prior Publication US 2023/0047911 A1, Feb. 16, 2023
Int. Cl. G06F 30/30 (2020.01); G06F 30/3315 (2020.01); G06F 30/347 (2020.01); G06F 30/398 (2020.01); G06F 119/12 (2020.01)
CPC G06F 30/3315 (2020.01) [G06F 30/347 (2020.01); G06F 30/398 (2020.01); G06F 2119/12 (2020.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method of analyzing timing-related design options of a first component-under-design (CUD), the computer-implemented method comprising:
accessing, using a processor, a plurality of timing constraint requirements placed on the first CUD by one or more second CUDs;
wherein each of the plurality of timing constraint requirements is specifically designed for the first CUD; and
performing, using the processor, a comparative analysis of each of the plurality of timing constraint requirements to identify a single timing constraint requirement that satisfies each of the plurality of timing constraint requirements.