A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

[1]  Kazuhiro Ueda,et al.  A Parallel Processing Approach for Logic Module Placement , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Maurice Hanan,et al.  Some experimental results on placement techniques , 1976, DAC.

[3]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[4]  Robert J. Smith,et al.  COMET - A Fast Component Placer , 1980, 17th Design Automation Conference.

[5]  Melvin A. Breuer,et al.  A Placement Algorithm for Array Processors , 1983, 20th Design Automation Conference Proceedings.