Solving VLSI physical design problems on a vector machine

DOI10.1016/0010-4485(93)90065-VzbMATH Open0795.68089MaRDI QIDQ1209181FDOQ1209181

Authors: C. P. Ravikumar 

Publication date: 16 May 1993

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

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

zbMATH Keywords

NP-completeparallel algorithmsVLSI layoutpartitioningplacementshared-memory multiprocessornumerical-optimization techniquevector supercomputer

Mathematics Subject Classification ID

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

Cited In (8)

• Disjoint clustering in combinatorial circuits
• A Novel eigenvector technique for large scale combinatorial problems in VLSI layout
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Generalized Dictionary Machine for VLSI
• Title not available (Why is that?)
• Combinatorial optimisation algorithms for a CAD workstation
• Title not available (Why is that?)

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)