Optimal Placement for River Routing.

Abstract

Programs for integrated circuit layout typically have two phases: placement and routing. The router should produce as efficient a layout as possible, but of course the quality of the routing depends heavily on the quality of the placement. On the other hand, the placement procedure ideally should know the quality of a routing before it routes the wires. In this talk we present an optimal solution for a practical, common version of this placement and routing problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1981
Accession Number
ADA107903

Entities

People

  • Charles E. Leiserson
  • Roy Y. Pinter

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Advanced Electronics

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Artificial Intelligence
  • Circuits
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Electrical Engineering
  • Electronics
  • Graph Theory
  • Integrated Circuits
  • Massachusetts
  • Mathematics
  • Military Research
  • Terminals
  • Two Dimensional

Readers

  • Coastal and Marine Engineering/Sediment Transport/Hydraulic Engineering
  • Computer Networking
  • Systems Analysis and Design