Search

Lawrence T Pileggi

from Pittsburgh, PA
Age ~62

Lawrence Pileggi Phones & Addresses

  • 357 Dorseyville Rd, Pittsburgh, PA 15215 (412) 963-6770 (412) 963-9616
  • 300 Spagnoli Ct, Los Altos, CA 94022
  • Austin, TX
  • 537 N Neville St APT 2C, Pittsburgh, PA 15213

Work

Position: Professional/Technical

Education

Degree: Associate degree or higher

Industries

Research

Resumes

Resumes

Lawrence Pileggi Photo 1

Tanoto Professor At Carnegie Mellon University

View page
Location:
Greater Pittsburgh Area
Industry:
Research

Publications

Us Patents

System And Method For Concurrent Buffer Insertion And Placement Of Logic Gates

View page
US Patent:
6367051, Apr 2, 2002
Filed:
Jun 12, 1998
Appl. No.:
09/096810
Inventors:
Lawrence Pileggi - Pittsburgh PA
Sharad Malik - Princeton NJ
Emre Tuncer - Palo Alto CA
Abhijeet Chakraborty - Sunnyvale CA
Satyamurthy Pullela - Cupertino CA
Altan Odabasioglu - Sunnyvale CA
Douglas B. Boyle - Palo Alto CA
Assignee:
Monterey Design Systems, Inc. - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 2, 716 7
Abstract:
A design tool for integrated circuits includes a placement tool which concurrently places logic gates and interconnect. In one embodiment, the logic gates are placed into bins and virtual buffers are inserted between logic gates mapped to different bins. Placement and interconnect wire lengths and densities are successively improved leading to removal of some buffers and actualization of the virtual buffers.

System And Method For Concurrent Placement Of Gates And Associated Wiring

View page
US Patent:
6385760, May 7, 2002
Filed:
Jun 12, 1998
Appl. No.:
09/096804
Inventors:
Lawrence Pileggi - Pittsburgh PA
Majid Sarrafzadeh - Wilmette IL
Gary K. Yeap - San Jose CA
Feroze Peshotan Taraporevala - San Jose CA
Tong Gao - Fremont CA
Douglas B. Boyle - Palo Alto CA
Assignee:
Monterey Design Systems, Inc. - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 8, 716 2, 716 7
Abstract:
A design tool for integrated circuits includes a placement tool which places logic gates and interconnect components concurrently. Probabilistic interconnect models are used to represent the collection of possible interconnect routings that provide acceptable circuit performance and routing area.

Placement Method For Integrated Circuit Design Using Topo-Clustering

View page
US Patent:
6442743, Aug 27, 2002
Filed:
Jun 12, 1998
Appl. No.:
09/097107
Inventors:
Majid Sarrafzadeh - Wilamette IL
Lawrence Pileggi - Pittsburgh PA
Sharad Malik - Princeton NJ
Feroze Peshotan Taraporevala - San Jose CA
Abhijeet Chakraborty - Sunnyvale CA
Gary K. Yeap - San Jose CA
Salil R. Raje - Santa Clara CA
Lilly Shieh - Union City CA
Douglas B. Boyle - Palo Alto CA
Dennis Yamamoto - Los Altos CA
Assignee:
Monterey Design Systems - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 10, 716 9
Abstract:
The disclosure describes a placement method for the physical design of integrated circuits in which natural topological feature clusters are discovered and exploited during the placement process is disclosed. Topo-clusters drive initial placement, with all of the gates of a topo-cluster being placed initially in a single bin of the placement layout or within a group of positionally-related bins. An iterative placement refinement process is done using a technique referred to as Dual Geometrically-Bounded FM (GBFM). GBFM is applied on a local basis to windows encompassing a number of bins. From iteration to iteration, windows may shift position and vary in size. When a region bounded by a window meets a specified cost threshold in terms of a specified cost function, that region stops participating. Following the foregoing global placement process the circuit is then ready for detailed placement in which cells are assigned to placement rows.

Method For Accurate And Efficient Updates Of Timing Information Logic Synthesis, Placement And Routing For Integrated Circuit Design

View page
US Patent:
6449756, Sep 10, 2002
Filed:
Jun 12, 1998
Appl. No.:
09/094542
Inventors:
Sharad Malik - Princeton NJ
Lawrence Pileggi - Pittsburgh PA
Eric McCaughrin - Oakland CA
Abhijeet Chakraborty - Sunnyvale CA
Douglas B. Boyle - Palo Alto CA
Assignee:
Monterey Design Systems - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 6, 716 2, 716 4
Abstract:
A timing graph representing timing information of an integrated circuit design may change after modifications are made to the integrated circuit design. The modifications change timing parameters for edges in the timing graph. The measure of these changes may be computed at a computed measure compared to a threshold. In the event the measure exceeds the threshold, the edges in the timing graph that need to change in response to the modifications are updated. Otherwise, the current edges in the timing graph are continued to be used. The threshold is set in accordance with the accuracy and efficiency requirements of an electronic design automation tool.

Method And System For Progressive Clock Tree Or Mesh Construction Concurrently With Physical Design

View page
US Patent:
6651232, Nov 18, 2003
Filed:
Nov 5, 1998
Appl. No.:
09/186430
Inventors:
Lawrence Pileggi - Pittsburgh PA
Christopher Dunn - Sunnyvale CA
Satyamurthy Pullela - Cupertino CA
Majid Sarrafzadeh - Wilmette IL
Tong Gao - Mountain View CA
Salil Raje - Santa Clara CA
Assignee:
Monterey Design Systems, Inc. - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 7, 716 10, 716 12
Abstract:
Progressively optimized clock tree/mesh construction is performed concurrently with placement of all remaining objects. Clock tree/mesh is specified loosely for initial placement, then followed by progressive detailed placement. In particular, preferred approach provides automated and reliable solution to clock tree/mesh construction, occuring concurrently with placement process so that clock tree wiring and buffering considers and influences placement and wiring of all other objects, such as logic gates, memory elements, macrocells, etc. Hence, in this concurrent manner, clock tree/mesh pre-wiring and pre-buffering may be based on construction of approximate clock tree using partitioning information only, i. e. , prior to object placement. Further, present approach provides modified DME-based clock tree topology construction without meandering, and recursive algorithm for buffered clock tree construction.

Method And Apparatus For Generating Sign-Off Prototypes For The Design And Fabrication Of Integrated Circuits

View page
US Patent:
6775808, Aug 10, 2004
Filed:
Aug 3, 2000
Appl. No.:
09/632494
Inventors:
Salil R. Raje - San Jose CA
Lawrence T. Pileggi - Pittsburgh PA
Dinesh D. Gaitonde - San Mateo CA
Olivier R. Coudert - Sunnyvale CA
Padmini Gopalakrishnan - Sunnyvale CA
Jackson David Kreiter - Sunnyvale CA
Assignee:
Monterey Design Systems, Inc. - Sunnyvale CA
International Classification:
G06F 1750
US Classification:
716 4, 716 5, 716 6
Abstract:
Methods and apparatus for a physical âsign-offâ prototype tool that includes a prototype tool that generates a physical prototype for a design and a optimization tool that provides a designer with the option to further optimize the physical prototype before signing off on the design. In either situation, the âsign-offâ prototype provides a forward prediction of the area, timing and performance of the final GDS of the design generated by a physical implementation tool.

Methods, Systems, And Computer Program Products For Modeling Inductive Effects In A Circuit By Combining A Plurality Of Localized Models

View page
US Patent:
6820245, Nov 16, 2004
Filed:
Mar 12, 2002
Appl. No.:
10/096446
Inventors:
Michael W. Beattie - Pittsburgh PA
Lawrence T. Pileggi - Pittsburgh PA
Assignee:
Carnegie Mellon University - Pittsburgh PA
International Classification:
G06F 1750
US Classification:
716 4, 716 1, 716 5, 716 7, 703 2, 703 14
Abstract:
Inductive effects in an integrated circuit device and/or system are modeled by partitioning the integrated circuit device and/or system into multiple windows or portions and determining a first localized inductance matrix for a first portion of the circuit and/or system and a second localized inductance matrix for a second portion of the circuit and/or system. The first and second localized inductance matrices are solved to obtain first and second localized susceptance vectors. The first and second localized susceptance vectors may be combined to form a susceptance matrix, which may be used directly in a susceptance-based simulator, or inverted to obtain a sparser inductance matrix that is representative of the inductive couplings in the entire integrated circuit device and/or system.

Placement Method For Integrated Circuit Design Using Topo-Clustering

View page
US Patent:
6961916, Nov 1, 2005
Filed:
May 1, 2002
Appl. No.:
10/136161
Inventors:
Majid Sarrafzadeh - Wilamette IL, US
Lawrence Pileggi - Pittsburgh PA, US
Sharad Malik - Princeton NJ, US
Feroze Peshotan Taraporevala - San Jose CA, US
Abhijeet Chakraborty - Sunnyvale CA, US
Gary K. Yeap - San Jose CA, US
Salil R. Raje - Santa Clara CA, US
Lilly Shieh - Union City CA, US
Douglas B. Boyle - Palo Alto CA, US
Dennis Yamamoto - Los Altos CA, US
Assignee:
Synopsys, Inc. - Mountain View CA
International Classification:
G06F017/50
US Classification:
716 10, 716 2, 716 7, 716 9
Abstract:
The present invention, generally speaking, provides a placement method for the physical design of integrated circuits in which natural topological feature clusters (topo-clusters) are discovered and exploited during the placement process. Topo-clusters may be formed based on various criteria including, for example, functional similarity, proximity (in terms of number of nets), and genus. Genus refers to a representation of a netlist in terms of a number of planar netlists—netlists in which no crossing of nets occurs. Topo-clusters drive initial placement, with all of the gates of a topo-cluster being placed initially in a single bin of the placement layout or within a group of positionally-related bins. The portion of a topo-cluster placed within a given bin is called a quanto-cluster. An iterative placement refinement process then follows, using a technique referred to herein as Geometrically-Bounded FM (GBFM), and in particular Dual GBFM.
Lawrence T Pileggi from Pittsburgh, PA, age ~62 Get Report