This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constant Time Dynamic Programming on Directed Reconfigurable Networks
June 2000 (vol. 11 no. 6)
pp. 529-536

Abstract—Several dynamic programming algorithms are considered which can be efficiently implemented using parallel networks with reconfigurable buses. The bit model of general reconfigurable meshes with directed links, common write, and unit-time delay for broadcasting is assumed. Given two sequences of length $m$ and $n$, respectively, their longest common subsequence can be found in constant time by an $O(mh)\times O(nh)$ directed reconfigurable mesh, where $h=\min\{m,n\}+1$. Moreover, given an $n$-node directed graph $G=(V,E)$ with (possibly negative) integer weights on its arcs, the shortest distances from a source node $v\in V$ to all other nodes can be found in constant time by an $O(n^2w)\times O(n^2w)$ directed reconfigurable mesh, where $w$ is the maximum arc weight.

[1] Y. Ben-Asher, D. Gordon, and A. Schuster, “Efficient Self-Simulation Algorithms for Reconfigurable Arrays,” J. Parallel Distributed Computing, vol. 30, no. 1, pp. 1–22, 1995.
[2] Y. Ben-Asher, K.J. Lange, D. Peleg, and A. Schuster, “The Complexity of Reconfiguring Network Models,” Information and Computation, vol. 121, pp. 41–58, 1995.
[3] Y. Ben-Asher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, Oct. 1991.
[4] Y. Ben-Asher and A. Shuster, “Time-size Tradeoffs for Reconfigurable Meshes,” Parallel Processing Letters 6, vol. 2, pp. 231–45, 1996.
[5] A.A. Bertossi and A. Mei, ”P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes,“ J. Parallel and Distributed Computing, vol. 40, pp. 248-255, 1997.
[6] A.A. Bertossi and A. Mei, “New Number Representation and Conversion Techniques on Reconfigurable Mesh,” Proc. Fifth IEEE/ACM Int'l Conf. High Performance Computing (HiPC' 98), Dec. 1998.
[7] G.H. Chen and B.F. Wang, ”Sorting and Computing Convex Hulls on Processor Arrays with Reconfigurable Bus Systems,“ Information Sciences, An Int'l J., vol. 72, no. 3, pp. 191-206, 1993.
[8] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[9] J. Jang, M. Nigam, V.K. Prasanna, and S. Sahni, “Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 1–12, Jan. 1997.
[10] J. Jang, H. Park, and V.K. Prasanna, ”An Optimal Multiplication Algorithm on Reconfigurable Mesh,“ IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 5, pp. 521-532, May 1997.
[11] J. Jang and V.K. Prasanna, ”An Optimal Sorting Algorithm on Reconfigurable Mesh,“ J. Parallel and Distributed Computing, vol. 25, pp. 31-41, 1995.
[12] J. Jenq and S. Sahni,“Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching,” Proc. Int’l Parallel Processing Symp., pp. 208-215, 1991.
[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] R. Lin, S. Olariu, J. Schwing, and J. Zhang, “A VLSI Optimal Constant Time Sorting on Reconfigurable Meshes,” Proc. Ninth European Workshop Parallel Computing, 1992.
[15] 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.
[16] M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Meshes With Buses," Proc. Int'l Parallel Processing Symp., pp. 174-181, 1993.
[17] S. Olariu, J.L. Schwing, and J. Zhang, “Integer Problems on Reconfigurable Meshes with Applications,” J. Computer and Software Eng., vol. 1, no. 1, pp. 33–45, 1994.
[18] Y. Pan and K. Li, “Linear Array with a Reconfigurable Pipelined Bus System—Concepts and Applications,” Information Sciences, vol. 106, no. 3/4, pp. 237-258, May 1998.
[19] H. Park, H.J. Kim, and V.K. Prasanna, ”An$O(1)$Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Meshes,“ Information Processing Letters, vol. 47, no. 2, pp. 109-113, 1993.
[20] Q.F. Stout, “Mesh Connected Computers with Broadcasting,” IEEE Trans. Computers, vol. 32, pp. 826–830, 1983.
[21] B.F. Wang,G.H. Chen,, and F.C. Lin,“Constant time sorting on a processor array with a reconfigurable bus systems,” Information Processing Letters, vol. 34, pp. 187-192, 1990.

Index Terms:
Reconfigurable architectures, directed links, dynamic programming, longest common subsequence, shortest paths, VLSI.
Citation:
Alan A. Bertossi, Alessandro Mei, "Constant Time Dynamic Programming on Directed Reconfigurable Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, pp. 529-536, June 2000, doi:10.1109/71.862204
Usage of this product signifies your acceptance of the Terms of Use.