Abstract
This paper deals with the optimum placement of blocks on a two-dimensional cell-array, which minimizes the total routing length of signal sets. A new heuristic procedure, based on iterative improvement, is proposed. The procedure repeats random generation of an initial solution and its improvement by a sequence of local transformations. The best among the local optimum solutions is taken as a final solution. The iterative improvement method proposed is different from previous ones in the sense that it considers interchanging more than two blocks at the same time and examines only a small portion of feasible solution which has high probability of being better. Experimental results show that this procedure gives better solutions than the best one up to now. The computation time for each local optimum solution grows almost linearly with regard to the number of blocks.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Place of Publication | New York, NY |
| Publisher | IEEE |
| Pages | 11-17 |
| Number of pages | 7 |
| Publication status | Published - 1979 |
| Event | Des Autom Conf, 16th Annu, Proc - San Diego, CA, USA Duration: 1979 Jun 25 → 1979 Jun 27 |
Other
| Other | Des Autom Conf, 16th Annu, Proc |
|---|---|
| City | San Diego, CA, USA |
| Period | 79/6/25 → 79/6/27 |
ASJC Scopus subject areas
- Engineering(all)