A Comparison Of Constructive Placement Algorithms*
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents experimental results on four constructive techniques for the placement of modules on a printed wiring or wire-wrap board. The four techniques reported upon are the pair-linking, the cluster development, the minimal-interconnected subgraph, and the stochastic methods. The results indicate that for problems larger than 50 modules cluster-development yields better placements, but at the expense of more computer time.Keywords
This publication has 8 references indexed in Scilit:
- Automated module placement and wire routeing according to a structured biplanar scheme in printed boardsComputer-Aided Design, 1973
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- On the Decomposition of Networks in Minimally Interconnected SubnetworksIEEE Transactions on Circuit Theory, 1969
- An algorithm for minimizing backboard wiring functionsCommunications of the ACM, 1965
- An algorithm for placement of interconnected elements based on minimum wire lengthPublished by Association for Computing Machinery (ACM) ,1964
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961
- Formal Procedures for Connecting Terminals with a Minimum Total Wire LengthJournal of the ACM, 1957