Patents by Inventor Andrew James Sullivan

Andrew James Sullivan 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).

  • Method, apparatus and computer program product for organizing hierarchical information
    Patent number: 7885958
    Abstract: A method, apparatus, and computer program product for organizing hierarchical information according to a defined objective.
    Type: Grant
    Filed: February 27, 2006
    Date of Patent: February 8, 2011
    Assignee: International Business Machines Corporation
    Inventors: Andrew James Sullivan, Brian Trevor Denton, Brent Scott Elmer, Robert John Milne
  • Method and apparatus for applying fine-grained transforms during placement synthesis interaction
    Patent number: 7047163
    Abstract: A method (and system) of applying transforms for modifying a plurality of domains concurrently in a design space, includes creating a sequence of more and less granular placement and netlist modification transforms. A converging design process flow is created by a flexible mechanism in which a select combination of fine-grained transforms are applied to optimize the netlist and placement of a design.
    Type: Grant
    Filed: March 13, 2000
    Date of Patent: May 16, 2006
    Assignee: International Business Machines Corporation
    Inventors: Kanad Chakraborty, Wilm Ernst Donath, Prabhakar Nandavar Kudva, Lakshmi Narasimha Reddy, Leon Stok, Andrew James Sullivan, Paul Gerard Villarrubia
  • Apparatus and method for determining buffered steiner trees for complex circuits
    Patent number: 6591411
    Abstract: An apparatus and method for determining buffered Steiner trees for complex circuits is provided. The apparatus and method first clusters sinks with similar characteristics such as criticality, polarity and distance. The purpose of this step is to potentially isolate positive sinks from negative ones and non-critical sinks from critical ones. The present invention then constructs low-level Steiner trees over each of these clusters. Finally, a top-level timing driven Steiner tree is computed where each cluster is treated as a sink. The top-level tree is then merged with the low-level trees to yield a solution for the entire net.
    Type: Grant
    Filed: March 15, 2001
    Date of Patent: July 8, 2003
    Assignee: International Business Machines Corporation
    Inventors: Charles Jay Alpert, Rama Gopal Gandham, Jiang Hu, Stephen Thomas Quay, Andrew James Sullivan
  • Apparatus and method for determining buffered steiner trees for complex circuits
    Publication number: 20020133799
    Abstract: An apparatus and method for determining buffered Steiner trees for complex circuits is provided. The apparatus and method first clusters sinks with similar characteristics such as criticality, polarity and distance. The purpose of this step is to potentially isolate positive sinks from negative ones and non-critical sinks from critical ones. The present invention then constructs low-level Steiner trees over each of these clusters. Finally, a top-level timing driven Steiner tree is computed where each cluster is treated as a sink. The top-level tree is then merged with the low-level trees to yield a solution for the entire net.
    Type: Application
    Filed: March 15, 2001
    Publication date: September 19, 2002
    Applicant: International Business Machines Corporation
    Inventors: Charles Jay Alpert, Rama Gopal Gandham, Jiang Hu, Stephen Thomas Quay, Andrew James Sullivan