1989 · 13 citations · 11 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingIntegrated Circuit DesignParallel ArchitecturesParallel Computer ArchitecturePhysical DesignStandard Cell DesignVery-large-scale Integration LayoutCell Layout DesignParallel Algorithms On HypercubesPlacementPlacement AlgorithmsPlacement ArchitecturePlacement OptimizationStandard Cell PlacementVlsi Implementation
A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel approaches to control error in parallel cell-placement algorithms: (1) Heuristic Cell-Coloring; (2) Adaptive Sequence Length Control.
11
Almost all k-colorable graphs are easy to color
Jonathan Turner · Journal of Algorithms · 1988 · 168 citations · Full text