Solving VLSI physical design problems on a vector machine

DOI10.1016/0010-4485(93)90065-VMaRDI QIDQ1209181zbMATH OpenFDO

Authors C. P. Ravikumar

Publication date 16 May 1993

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4485(93)90065-V

zbMATH Keywords

NP-completenumerical-optimization techniqueparallel algorithmspartitioningplacementshared-memory multiprocessorvector supercomputerVLSI layout

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Linear placement algorithms and applications to VLSI design
• scientific article; zbMATH DE number 177834
• A logic-topological calculus for the construction of integrated circuits. II.
• Practical Automatic Placement for Standard-Cell Integrated Circuits
• Algorithms for VLSI placement

Cited in

(10)

• Parallel maze routing on hypercube computers
• A Novel eigenvector technique for large scale combinatorial problems in VLSI layout
• Disjoint clustering in combinatorial circuits
• scientific article; zbMATH DE number 433056 (Why is no real title available?)
• scientific article; zbMATH DE number 4174847 (Why is no real title available?)
• A Generalized Dictionary Machine for VLSI
• scientific article; zbMATH DE number 4064479 (Why is no real title available?)
• scientific article; zbMATH DE number 1216749 (Why is no real title available?)
• scientific article; zbMATH DE number 2043451 (Why is no real title available?)
• Combinatorial optimisation algorithms for a CAD workstation

This page was built for publication: Solving VLSI physical design problems on a vector machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209181)