×

Layout method arranging nodes corresponding to LSI elements having a connecting relationship

  • US 6,675,155 B2
  • Filed: 05/20/1998
  • Issued: 01/06/2004
  • Est. Priority Date: 10/24/1997
  • Status: Expired due to Term
First Claim
Patent Images

1. A layout operation for arranging a layout of a plurality of nodes in a generation space of a computer system, comprising:

  • a definition operation of defining each node as a geographical shape set by associated coordinates, wherein each node has a connection relationship to other nodes of the plurality of nodes;

    a hyper node formation operation of forming a plurality of hyper nodes from sets of the nodes;

    a hyper node arrangement operation of executing an optimization problem solution algorithm to determine a plurality of solutions to a problem of arrangement of the plurality of hyper nodes formed by the hyper node formation step in the generation space and arranging the plurality of hyper nodes in the generation space based on one of the determined solutions;

    a node optimum arrangement operation, carried out after the hyper node arrangement step, of executing the optimization problem solution algorithm taking arrangement relationships between the plurality of hyper nodes obtained by the hyper node arrangement step into consideration to determine a solution to a problem of arrangement of the plurality of nodes in an optimum condition in the generation space and arranging the plurality of nodes in the generation space based on the determined solution; and

    an arrangement output operation of laying out the determined arrangement of the plurality of nodes as an arrangement of a plurality of geographical shapes, based upon the arrangement relationships between the plurality of the hyper nodes.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×