Patents by Inventor Paul G. Villarrubia
Paul G. Villarrubia has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7996812Abstract: A system and a method for correcting early-mode timing violations that operate across the process space of a circuit design. Optimizations are performed to replace padding that increase path delays on fast paths. At the stage in the design process where early-mode violations are addressed, placement, late-mode timing closure, routing, and detailed electrical and timing analysis are assumed to have been completed. The optimizations are designed to be effective in delaying fast paths while minimizing the impact on already-completed work on the chip, in contrast to relying only on adding pads that can have a negative impact on all of these quantities. The optimizations are classified according to their invasiveness and are followed by their deployment. The deployment is designed to minimize using delay pads, reduce design disruptions, and minimize effects on other aspects of the design.Type: GrantFiled: August 14, 2008Date of Patent: August 9, 2011Assignee: International Business Machines CorporationInventors: Pooja M. Kotecha, Frank J. Musante, Veena S. Pureswaran, Louise H. Trevillyan, Paul G. Villarrubia
-
Patent number: 7882475Abstract: A method of force directed placement programming is presented. The method includes: assigning a plurality of objects from a cell netlist to bins; shifting the objects based on the bins; computing a magnitude of a spreading force for each object of the plurality of objects based on the shifting; sorting the objects based on the magnitude of the spreading force of the objects; selecting a subset of the sorted objects based on a threshold value indicating at least one of a top percentage, a threshold force, and a threshold value that is based on a placement congestion; adjusting the spreading force of the selected objects to be equal to a predetermined value indicating a minimum spreading force; and determining a placement of the objects based on adjusted spreading force of the selected objects.Type: GrantFiled: July 29, 2008Date of Patent: February 1, 2011Assignee: International Business Machines CorporationInventors: Charles J. Alpert, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia, Natarajan Viswanathan
-
Publication number: 20100192155Abstract: Scheduling of parallel processing for regionally-constrained object placement selects between different balancing schemes. For a small number of movebounds, computations are assigned by balancing the placeable objects. For a small number of objects per movebound, computations are assigned by balancing the movebounds. If there are large numbers of movebounds and objects per movebound, both objects and movebounds are balanced amongst the processors. For object balancing, movebounds are assigned to a processor until an amortized number of objects for the processor exceeds a first limit above an ideal number, or the next movebound would raise the amortized number of objects above a second, greater limit. For object and movebound balancing, movebounds are sorted into descending order, then assigned in the descending order to host processors in successive rounds while reversing the processor order after each round. The invention provides a schedule in polynomial-time while retaining high quality of results.Type: ApplicationFiled: January 26, 2009Publication date: July 29, 2010Applicant: International Business Machines CorporationInventors: Gi-Joon Nam, Shyam Ramji, Taraneh Taghavi, Paul G. Villarrubia
-
Publication number: 20100042955Abstract: A system and a method for correcting early-mode timing violations that operate across the process space of a circuit design. Optimizations are performed to replace padding that increase path delays on fast paths. At the stage in the design process where early-mode violations are addressed, placement, late-mode timing closure, routing, and detailed electrical and timing analysis are assumed to have been completed. The optimizations are designed to be effective in delaying fast paths while minimizing the impact on already-completed work on the chip, in contrast to relying only on adding pads that can have a negative impact on all of these quantities. The optimizations are classified according to their invasiveness and are followed by their deployment. The deployment is designed to minimize using delay pads, reduce design disruptions, and minimize effects on other aspects of the design.Type: ApplicationFiled: August 14, 2008Publication date: February 18, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: POOJA M. KOTECHA, Frank J. Musante, Veena S. Pureswaran, Louise H. Trevillyan, Paul G. Villarrubia
-
Patent number: 7624366Abstract: The layout of latches in a common clock domain is efficiently optimized to shrink the physical size of the domain while maintaining timing requirements. The latches are placed in a first layout preferably using quadratic placement, and a star object is built representing an interim clock structure. The latches are weighted based on wire distance from a source of the star object, and then re-placed using the weighting. The weighted placement and repartitioning may be iteratively repeated until a target number of bins is reached. The boundary of the latches in the final global placement is used to define a movebound for further detailed placement.Type: GrantFiled: October 31, 2006Date of Patent: November 24, 2009Assignee: International Business Machines CorporationInventors: Charles J. Alpert, David J. Hathaway, William R. Migatz, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia
-
Patent number: 7581201Abstract: A method for performing timing optimization of a detail routed netlist, incorporating statistical variability information, common path pessimism reduction, and capacitative coupling information, in a tightly coupled, incremental manner with minimal perturbations to the placement, routing, and asserted parasitic information. The method corrects violations in a placed and routed design of a VLSI circuit chip, where the design is represented by a netlist describing logical and physical characteristics of the design and by a corresponding timing graph, the method including the steps of: identifying violations in the design; iteratively eliminating the violations by incrementally transforming the logical and the physical characteristics of the design, incorporating in the design only legal placements and routes; and applying incremental timing to evaluate the transformations, and updating the existing timing graphs to reflect changes consisting of the legal placements and routes.Type: GrantFiled: February 28, 2007Date of Patent: August 25, 2009Assignee: International Business Machines CorporationInventors: Michael A. Kazda, Pooja M. Kotecha, Adam P. Matheny, Lakshmi Reddy, Louise H. Trevillyan, Paul G. Villarrubia
-
Patent number: 7549137Abstract: A novel iterative latch placement scheme wherein the latches are gradually pulled by increasing attraction force until they are eventually placed next to a clock distribution structure such as a local clock buffer (LCB). During the iterations, timing optimizations such as gate sizing and re-buffering are invoked in order to keep the timing estimation accurate. By applying the iterative clock net weighting adjustment, the present invention allows tighter interaction between logic placement and clock placement which leads to higher quality timing and significant power savings.Type: GrantFiled: December 14, 2006Date of Patent: June 16, 2009Assignee: International Business Machines CorporationInventors: Charles J. Alpert, Shyam Ramji, Chin Ngai Sze, Paul G. Villarrubia
-
Patent number: 7467369Abstract: The illustrative embodiments provide a computer implemented method which perform cell transforms that decrease overall wire length, without degrading device timing or violating electrical constraints. The process computes delay constraint coefficients for a data set. The process performs a detailed placement transform by moving a subset of cells, making the placement legal, computing a half perimeter wire length change for each output net that is a member of the subset of nets, and computing a Manhattan distance change for each source-sink gate pair within the move cells. the process computes a weighted total wire length incremented value for the transformed data set. Further, the process continues by evaluating arrival time constraints, electrical constraints, and user configurable move limits for violations, and restoring the move cells to the original placement if a violation is found.Type: GrantFiled: October 30, 2006Date of Patent: December 16, 2008Assignee: International Business Machines CorporationInventors: Charles J. Alpert, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia
-
Publication number: 20080282213Abstract: A method of force directed placement programming is presented. The method includes: assigning a plurality of objects from a cell netlist to bins; shifting the objects based on the bins; computing a magnitude of a spreading force for each object of the plurality of objects based on the shifting; sorting the objects based on the magnitude of the spreading force of the objects; selecting a subset of the sorted objects based on a threshold value indicating at least one of a top percentage, a threshold force, and a threshold value that is based on a placement congestion; adjusting the spreading force of the selected objects to be equal to a predetermined value indicating a minimum spreading force; and determining a placement of the objects based on adjusted spreading force of the selected objects.Type: ApplicationFiled: July 29, 2008Publication date: November 13, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. Alpert, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia, Natarajan Viswanathan
-
Publication number: 20080209376Abstract: A method for performing timing optimization of a detail routed netlist, incorporating statistical variability information, common path pessimism reduction, and capacitative coupling information, in a tightly coupled, incremental manner with minimal perturbations to the placement, routing, and asserted parasitic information. The method corrects violations in a placed and routed design of a VLSI circuit chip, where the design is represented by a netlist describing logical and physical characteristics of the design and by a corresponding timing graph, the method including the steps of: identifying violations in the design; iteratively eliminating the violations by incrementally transforming the logical and the physical characteristics of the design, incorporating in the design only legal placements and routes; and applying incremental timing to evaluate the transformations, and updating the existing timing graphs to reflect changes consisting of the legal placements and routes.Type: ApplicationFiled: February 28, 2007Publication date: August 28, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael A. Kazda, Pooja M. Kotecha, Adam P. Matheny, Lakshmi Reddy, Louise H. Trevillyan, Paul G. Villarrubia
-
Publication number: 20080148203Abstract: A novel iterative latch placement scheme wherein the latches are gradually pulled by increasing attraction force until they are eventually placed next to a clock distribution structure such as a local clock buffer (LCB). During the iterations, timing optimizations such as gate sizing and re-buffering are invoked in order to keep the timing estimation accurate. By applying the iterative clock net weighting adjustment, the present invention allows tighter interaction between logic placement and clock placement which leads to higher quality timing and significant power savings.Type: ApplicationFiled: December 14, 2006Publication date: June 19, 2008Inventors: Charles J. Alpert, Shyam Ramji, Chin Ngai Sze, Paul G Villarrubia
-
Publication number: 20080127017Abstract: A computer implemented method and a computer program product which perform cell transforms that decrease overall wire length, without degrading device timing or violating electrical constraints. The process computes delay constraint coefficients for a data set. The process performs a detailed placement transform by moving a subset of cells, making the placement legal, computing a half perimeter wire length change for each output net that is a member of the subset of nets, and computing a Manhattan distance change for each source-sink gate pair within the move cells. The process computes a weighted total wire length incremented value for the transformed data set, if the move will not improve placement, the move transform is not allowed. Further, the process continues by evaluating arrival time constraints, electrical constraints and user configurable move limits for violations, restoring the move cells to the original placement if a violation is found.Type: ApplicationFiled: October 30, 2006Publication date: May 29, 2008Inventors: Charles J. Alpert, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia
-
Publication number: 20080127018Abstract: The layout of latches in a common clock domain is efficiently optimized to shrink the physical size of the domain while maintaining timing requirements. The latches are placed in a first layout preferably using quadratic placement, and a star object is built representing an interim clock structure. The latches are weighted based on wire distance from a source of the star object, and then re-placed using the weighting. The weighted placement and repartitioning may be iteratively repeated until a target number of bins is reached. The boundary of the latches in the final global placement is used to define a movebound for further detailed placement.Type: ApplicationFiled: October 31, 2006Publication date: May 29, 2008Inventors: Charles J. Alpert, David J. Hathaway, William R. Migatz, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia
-
Publication number: 20080066037Abstract: A method of force directed placement programming is presented. The method includes sorting objects of a netlist for placement by magnitude of their spreading force and selecting a plurality of the objects. The method further includes waiving (or nullifying) the spreading force for the selected objects in a subsequent non-linear program solver step of the force directed placement program. The positions of the objects after the subsequent non-linear program solver step are based only on their connections to other objects in the netlist. The selected objects no longer retain their relative ordering as obtained during a previous non-linear program solve step of the force directed placement program. An alternative method of force directed placement programming is also present, which includes identifying objects from a netlist for placement that have a very high spreading force magnitude.Type: ApplicationFiled: September 13, 2006Publication date: March 13, 2008Applicant: INTERNATIONAL BUSINESS MACHINES COMPANYInventors: Charles J. Alpert, Gi-Joon Nam, Haoxing Ren, Paul G. Villarrubia, Natarajan Viswanathan
-
Publication number: 20070283301Abstract: A system and method for correcting electrical violations, the method including examining a plurality of nets for at least one electrical violation in a sequential order of a first output-to-input traversal, and determining a net correction in each net of the plurality of nets having an electrical violation prior to examining a next net in the sequential order of the first output-to-input traversal.Type: ApplicationFiled: June 5, 2006Publication date: December 6, 2007Inventors: Arvind K. Karandikar, Charles J. Alpert, Mehmet C. Yildiz, Stephen T. Quay, Tuhin Mahmud, Paul G. Villarrubia
-
Patent number: 6671867Abstract: A method of designing the layout of an integrated circuit (IC) by deriving an analytical constraint for a cut-based placement partitioner using analytical optimization, and placing cells on the IC with the cut-based placement partitioner using the analytical constraint. Quadratic optimization may be used to determine a desired ratio of a cell area of a given partition to a total cell area (the balance parameter), and placing may be performed using multilevel bisection partitioning constrained by the balance parameter. This implementation may include a determination of an aspect ratio for an entire partitioning region of the integrated circuit, and a “center-of-mass” coordinate of the cells based on the quadratic optimization, which are then used to define a placement rectangle having the same aspect ratio, and centered on the center-of-mass coordinate. This placement rectangle is used to derive the balance parameter.Type: GrantFiled: April 11, 2002Date of Patent: December 30, 2003Assignee: International Business Machines CorporationInventors: Charles J. Alpert, Gi-Joon Nam, Paul G. Villarrubia
-
Publication number: 20030217338Abstract: A method, computer software, and system for performing congestion mitigation in an IC design while preserving global logic order, comprising the steps of carrying out circuit block placement; measuring the congestion for each circuit block to determine if it exceeds a target value; reallocating area to circuit blocks that exceed said target value of congestion solely from adjacent circuit blocks; and removing overlap.Type: ApplicationFiled: May 17, 2002Publication date: November 20, 2003Applicant: International Business Machines CorporationInventors: Glenn E. Holmes, Zahi M. Kurzum, Shyam Ramji, Haoxing Ren, Paul G. Villarrubia
-
Publication number: 20030196183Abstract: A method of designing the layout of an integrated circuit (IC) by deriving an analytical constraint for a cut-based placement partitioner using analytical optimization, and placing cells on the IC with the cut-based placement partitioner using the analytical constraint. Quadratic optimization may be used to determine a desired ratio of a cell area of a given partition to a total cell area (the balance parameter), and placing may be performed using multilevel bisection partitioning constrained by the balance parameter. This implementation may include a determination of an aspect ratio for an entire partitioning region of the integrated circuit, and a “center-of-mass” coordinate of the cells based on the quadratic optimization, which are then used to define a placement rectangle having the same aspect ratio, and centered on the center-of-mass coordinate. This placement rectangle is used to derive the balance parameter.Type: ApplicationFiled: April 11, 2002Publication date: October 16, 2003Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. Alpert, Gi-Joon Nam, Paul G. Villarrubia