This Article 
 Bibliographic References 
 Add to: 
Area Minimization in a Three-Sided Switchbox by Sliding the Modules
November 1990 (vol. 39 no. 11)
pp. 1395-1398

An optimal algorithm for minimizing the number of columns (width) in a three-sided switchbox, when the modules are allowed to slide, is presented. The proposed algorithm runs in O(mn+e log e) time, where m and n are the number of terminals on the top and on the bottom, and e is the total number of feasible alignments (e>or=mn). The movable-module model considered is a generalization, and a realistic version, of the (previously studied) movable-terminal model.

[1] M. J. Atallah and S. R. Kosaraju, "'An efficient algorithm for maxdominance, with application," Tech. Rep. CSD-TR-641, Comput. Sci. Dep., Purdue Univ., Nov. 1986,Algorithmica, to be published.
[2] Y. Kajitani and T. Takahashi, "The noncross matching and applications to the 3-sided switch box routing in VLSI layout," inProc. Int. Conf. Circuits Syst., 1986.
[3] W. Lipski and F. P. Preparata, "An elementary theory of wirability,"Math. Syst. Theory, 1987.

Index Terms:
area minimisation; three-sided switchbox; optimal algorithm; movable-module model; circuit layout CAD.
M. Sarrafzadeh, "Area Minimization in a Three-Sided Switchbox by Sliding the Modules," IEEE Transactions on Computers, vol. 39, no. 11, pp. 1395-1398, Nov. 1990, doi:10.1109/12.61050
Usage of this product signifies your acceptance of the Terms of Use.