This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks
November 2002 (vol. 13 no. 11)
pp. 1124-1138

Abstract—The computation model on which the algorithms are developed is the reconfigurable array of processors with wider bus networks (abbreviated to RAPWBN). The main difference between the RAPWBN model and other existing reconfigurable parallel processing systems is that the bus width of each network is bounded within the range \big. [2, \lceil \sqrt{N} \rceil]\bigr.. Such a strategy not only saves the silicon area of the chip as well as increases the computational power enormously, but the strategy also allows the execution speed of the proposed algorithms to be tuned by the bus bandwidth. To demonstrate the computational power of the RAPWBN, the channel-assignment problem is derived in this paper. For the channel-assignment problem with \big. N\bigr. pairs of components, we first design an \big. O(T + \lceil {N\over w} \rceil)\bigr. time parallel algorithm using \big. 2N\bigr. processors with a \big. 2N{\hbox{-}}\rm row\bigr. by \big. 2N{\hbox{-}}\rm column\bigr. bus network, where the bus width of each bus network is \big. w{\hbox{-}}\rm bit\bigr. for \big. 2 \leq w \leq \lceil \sqrt{N} \ \rceil\bigr. and \big. T={\lfloor \log _{w} N \rfloor}+1\bigr.. By tuning the bus bandwidth to the natural \big. \log N{\hbox{-}}\rm bit\bigr. and the extended \big. N^{1/c}{\hbox{-}}\rm bit\bigr. (\big. N^{1/c} > \log N\bigr.) for any constant \big. c\bigr. and \big. c \geq 1\bigr., two more results which run in \big. O(\log N /\log \log N)\bigr. and \big. O(1)\bigr. time, respectively, are also derived. When compared to the algorithms proposed by Olariu et al. [17] and Lin [14], it is shown that our algorithm runs in the equivalent time complexity while significantly reducing the number of processors to \big. O(N)\bigr..

[1] E. Dekel and S. Sahni, “Parallel Scheduling Algorithms,” Operations Research, vol. 31, pp. 24-49, 1983.
[2] M. Feldman, S. Esener, C. Guest, and S. Lee, “Comparison Between Optical and Electrical Interconnects Based on Power and Speed Considerations,” Applied Optics, vol. 27, pp. 1742-1751, 1988.
[3] T.Y. Feng, “A Survey of Interconnection Networks,” IEEE Computing Magazine, pp. 12-27, 1981.
[4] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs.New York, Academic Press, 1980.
[5] U.I. Gupta, D.T. Lee, and J.Y.T. Leung, “An Optimal Solution for the Channel-Assignment Problem,” IEEE Trans. Computers, vol. 28, pp. 807-810, 1979.
[6] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[7] K. Hwang, P.S. Tseng, and D. Kim, “An Orthogonal Multiprocessor for Parallel Scientific Computations,” IEEE Trans. Computers, vol. 38, pp. 47-61, 1989.
[8] T.W. Kao, S.J. Horng, Y.L. Wang, and H.R. Tsai, “Designing Efficient Parallel Algorithms on a CRAP,” IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 554-559, 1995.
[9] T.W. Kao and S.J. Horng, “The Power of List Ranking on a Reconfigurable Array of Processors with Wider Bus Networks,” The Australian Computer J., vol. 28, pp. 138-148, 1996.
[10] D.M. Kuchta, J. Crow, P. Pepeljugoski, K. Stawiasz, J. Trewhella, D. Booth, W. Nation, C. DeCusatis, and A. Muszynski, “Low Cost 10 Gigabit/s Optical Interconnects for Parallel processing,” Proc. Fifth Int'l Conf. Massively Parallel Processing, pp. 210-215, 1998.
[11] S.S. Lee, S.J. Horng, and H.R. Tsai, “Entropy Thresholding and Its Parallel Algorithm on a Reconfigurable Array of Processors with Wider Bus Networks,” IEEE Trans. Image Processing, vol. 8, pp. 1229-1242, 1999.
[12] H. Li and M. Maresca, "Polymorphic-Torus Architecture for Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 233-243, Mar. 1989.
[13] K. Li, Y. Pan, and S.-Q. Zheng, “Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array with Reconfigurable Pipelined Bus System,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 8, pp. 705-720, Aug. 1998.
[14] S.S. Lin, “Constant-Time Algorithms for the Channel Assignment Problem on Processor Arrays with Reconfigurable Bus Systems,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, pp. 884-890, 1994.
[15] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[16] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[17] S. Olariu, J.L. Schwing, and J. Zhang, “A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes,” BIT, vol. 32, pp. 586-597, 1993.
[18] B.T. Preas and M.J. Lorenzetti, Physical Design Automation of VLSI Sysyem. Menlo Park, Calif.: Benjamin/Cummings, 1988.
[19] D.A. Pucknell and K. Eshraghian, Basic VLSI Design. pp. 134-138, Prentice-Hall, 1994.
[20] C. Qiao, R. Melhem, D. Chiarulli, and S. Levitan, "Dynamic Reconfiguration of Optically Interconnected Networks with Time Division Multiplexing," J. Parallel and Distributed Computing, vol. 22, no. 8, pp. 268-278, Aug. 1994.
[21] R. Raghavan and S. Sahni, “Single Row Routing,” IEEE Trans. Computers, vol. 32, pp. 209-220, 1983.
[22] S. Sahni, “Data Manipulation on the Distributed Memory Bus Computer,” Parallel Processing Letters, vol. 5, pp. 3-14, 1995.
[23] J.E. Savage and M.G. Wloka, “A Parallel Algorithm for Channel Routing,” Lecture Notes in Computer Science, vol. 344, pp. 288-303, 1989.
[24] A. Schuster and Y. Ben-Asher, “Algorithms and Optic Implementation for Reconfigurable Networks,” Proc. Fifth Jerusalem Conf. Information Technology, pp. 225-235, 1990.
[25] D.B. Shu and J.G. Nash, The Gated Interconnection Network for Dynamic Programming. S.K. Tewsburg et al. eds., New York: Concurrent Computing, Plenum, 1988.
[26] A.P. Sprague and K.H. Kulkarni, “Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs,” Information Processing Letters, vol. 42, pp. 229-234, 1992.
[27] Z. Syed, A.E. Gamal, and M.A. Breuer, “On Routing for Custom Integrated Circuits,” Proc. 19th Design Automation Conf., pp. 887-893, 1982.
[28] J.L. Trahan, R. Vaidyanathan, and C.P. Subbaraman, “Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine,” J. Parallel and Distributed Computing, vol. 46, pp. 1-14, 1997.
[29] S. Tsukiyama, E.S. Kuh, and I. Shirakawa, "An Algorithm for Single-Row Routing with Prescribed Street Congestions," IEEE Trans. Circuits and Systems, vol. 27, pp. 765-771, 1980.
[30] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500-507, 1991.
[31] J.S. Wang and R.C.T. Lee, “An Efficient Channel Routing Algorithm to Yield an Optimal Solution,” IEEE Trans. Computers, vol. 39, pp. 957-962, 1990.
[32] C.H. Wu, S.J. Horng, and H.R. Tsai, “Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses,” J. Parallel and Distributed Computing, vol. 60, pp. 1137-1153, 2000.
[33] M.S. Yu, C.L. Chen, and R.C.T. Lee, “An Optimal Parallel Algorithm for Minimum Coloring of Intervals,” Proc. Int'l Conf. Parallel Processing, vol. III, pp. 162-168, 1990.
[34] M.S. Yu and C.H. Yang, “A Simple Optimal Algorithm for the Minimum Coloring Problem on Interval Graphs,” Information Processing Letters, vol. 48, pp. 48-51, 1993.

Index Terms:
Channel-assignment problem, minimum coloring problem, interval graph, list ranking, integer sorting, parallel algorithm, reconfigurable array of processors with wider bus networks.
Citation:
Shi-Jinn Horng, Horng-Ren Tsai, Yi Pan, Jennifer Seitzer, "Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 11, pp. 1124-1138, Nov. 2002, doi:10.1109/TPDS.2002.1058096
Usage of this product signifies your acceptance of the Terms of Use.