A parallel simulated annealing algorithm for channel routing on a hypercube multiprocessor
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The algorithm begins with an initial placement of nets in the channel using the number of tracks equal to the density of the channel. Overlapping subnets are permitted at this stage as the annealing process will gradually work to remove the overlaps. Transformations are then repeatedly applied to the channel state by moving nets around the channel in a parallel fashion. By allowing overlap situations and controlling them with appropriate cost function, the algorithm is capable of producing very good results with the advantage of decreased runtime from the parallelism. and can also be applied to extensions of the channel routing problem, such as switchbox routine with obstacle avoidance.Keywords
This publication has 7 references indexed in Scilit:
- A Parallel Simulated Annealing Algorithm for the Placement of Macro-CellsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Performance of a parallel algorithm for standard cell placement on the Intel hypercubePublished by Association for Computing Machinery (ACM) ,1987
- A New Symbolic Channel Router: YACR2IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Global Wiring by Simulated AnnealingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Optimization by Simulated AnnealingScience, 1983
- Hierarchical Channel RouterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982