FaSa: A fast and stable quadratic placement algorithm

DOI10.1007/BF02948901MaRDI QIDQ1415932zbMATH OpenOpenAlexFDO

Authors WenTing Hou, Xianlong Hong, Weimin Wu, Yici Cai

Publication date 9 December 2003

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02948901

zbMATH Keywords

VLSI design

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A Fourier space algorithm for solving quadratic assignment problems
• scientific article; zbMATH DE number 724213
• Publication:4506201
• An algorithm for quadratic assignment problems
• A new exact algorithm for the solution of quadratic assignment problems
• A new algorithm for the quasi-assignment problem
• An exact algorithm for the general quadratic assignment problem
• scientific article; zbMATH DE number 934533
• Geometric quadrisection in linear time, with application to VLSI placement

Cites work

• scientific article; zbMATH DE number 3744430 (Why is no real title available?)
• Modification of the minimum-degree algorithm by multiple elimination
• RITUAL: a performance driven placement algorithm

Cited in

(3)

• A timing-driven placement algorithm with the Elmore delay model for row-based VLSIs
• FaSa
• VLSI Placement Using Quadratic Programming and Network Partitioning Techniques

Describes a project that uses

Uses Software

• RITUAL

This page was built for publication: FaSa: A fast and stable quadratic placement algorithm

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