A Parallel VLSI Circuit Layout Methodology

Abstract

We propose a parallel computation layout technique that solves the layout problem directly rather than decomposing it into the traditional distinct steps of placement and routing. The method combines a superior geometric partitioning algorithm with extensive use of pre~con1puted minimum - length Steiner trees to produce layouts. Note: Abstract extracted from PDF file via OCR