This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models
April 1993 (vol. 42 no. 4)
pp. 385-395

A polynomial time algorithm for solving the combinatorial problem that underlies the reconfiguration issues in the m1/2-track-m-spare model, for any arbitrary m, is discussed. The following combinatorial problem is solved: Given a set of points in a two-dimensional grid, find a set of noninteracting straight lines such that every line starts at a point and connects to one of the boundaries of the grid, there are no more than m lines overlapping in any row or column of the grid, and there are no near-miss situations. The time complexity of the algorithm is shown to be O(m mod F mod /sup 2/), where mod F is the number of faulty processors.

[1] Y. Birk and J. B. Lotspiech, "On finding non-intersecting straight-line interconnections of grid points to the boundary," Tech. rep., Tech. Rep. RJ 7217 (67984), IBM, Almaden Research Center, San Jose, CA, Dec. 1989.
[2] J. Bruck and V. Roychowdhury, "How to play bowling in parallel on the grid?" Tech. rep., Tech. Rep. RJ 7209 (67688), IBM, Almaden Research Center, San Jose, CA, Dec. 1989.
[3] M. Chean and J. A. B. Fortes, "The full-use-of-suitable-spares (fuss) approach to hardware reconfiguration for fault-tolerant processor arrays,"IEEE Trans. Comput., vol. 39, pp. 564-571, Apr. 1990.
[4] J. S. N. Jean, "Fault-tolerant array processors using n-and-half-track switches," inProc. Int. Conf. Appl. Specific Array Processors, Sept. 1990.
[5] J. S. N. Jean, H. C. Fu, and S. Y. Kung, "Yield enhancement for WSI array processors using two-and-half-track switches," inProc. Int. Conf. Wafer-Scale Integration, San Francsco, CA, Jan. 1990, pp. 243-250.
[6] S. Y. Kung, S. N. Jean, and C. W. Chang, "Fault-tolerant array processors using single-track switches,"IEEE Trans. Comput., vol. 38, no. 4, pp. 501-514, Apr. 1989.
[7] F. Lombardi, M. G. Sami, and R. Stefanelli, "Reconfiguration of VLSI arrays by covering,"IEEE Trans. Comput.-Aided Design IC Syst., vol. 8, no. 9, pp. 952-965, Sept. 1989.
[8] V. P. Roychowdhury, J. Bruck, and T. Kailath, "Efficient algorithms for reconfiguration in VLSI/WSI arrays,"IEEE Trans. Comput., Special Issue on Fault tolerant Computing, vol. 39, no. 4, pp. 480-489, Apr. 1990.
[9] T. Varvarigou, V. Roychowdhury, and T. Kailath, "New algorithms for reconfiguring VLSI/WSI arrays,"J. VLSI Signal Processing, vol. 3, no. 4, pp. 329-344, Oct. 1991.
[10] T. Varvarigou, V. Roychowdhury, and T. Kailath, "Reconfiguring arrays using multiple-track models: The 3-track- 1-spare approach,"IEEE Trans. Comput., to be published.

Index Terms:
polynomial time algorithm; reconfiguring multiple-track models; combinatorial problem; m1/2-track-m-spare model; two-dimensional grid; noninteracting straight lines; time complexity; faulty processors; computational complexity; fault tolerant computing; parallel algorithms; parallel architectures; reconfigurable architectures.
Citation:
T.A. Varvarigou, V.P. Roychowdhury, T. Kailth, "A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models," IEEE Transactions on Computers, vol. 42, no. 4, pp. 385-395, April 1993, doi:10.1109/12.214686
Usage of this product signifies your acceptance of the Terms of Use.