Publication 2000 Issue No. 6 - June Abstract - Constant Time Dynamic Programming on Directed Reconfigurable Networks
Constant Time Dynamic Programming on Directed Reconfigurable Networks
June 2000 (vol. 11 no. 6)
pp. 529-536
 ASCII Text x 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.
 BibTex x @article{ 10.1109/71.862204,author = {Alan A. Bertossi and Alessandro Mei},title = {Constant Time Dynamic Programming on Directed Reconfigurable Networks},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {11},number = {6},issn = {1045-9219},year = {2000},pages = {529-536},doi = {http://doi.ieeecomputersociety.org/10.1109/71.862204},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Constant Time Dynamic Programming on Directed Reconfigurable NetworksIS - 6SN - 1045-9219SP529EP536EPD - 529-536A1 - Alan A. Bertossi, A1 - Alessandro Mei, PY - 2000KW - Reconfigurable architecturesKW - directed linksKW - dynamic programmingKW - longest common subsequenceKW - shortest pathsKW - VLSI.VL - 11JA - IEEE Transactions on Parallel and Distributed SystemsER -

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.

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