A fully-pipelined solutions constructor for dynamic programming problems
The problem of designing modular linear systolic arrays for dynamic programming was raised in . An attempt to solve this problem appeared in . Unfortunately, the size of the local memory of each processor and the time delay between two consecutive processors of this array (in ) are still depending on n as in . Moreover, these two arrays (in [8, 9]) are partially pipelined. Some elements have to be initially stored in the array. However, the difference between these two linear arrays is that the one in  is faster and more easy to handle than in . In this paper we discuss a way of designing fully — pipelined modular linear systolic arrays for dynamic programming. The algorithm we obtain requires n2+1 processors (or simply cells) and 6n2-n-3 time steps for its execution: each cell has a local memory of size 1 and the time delay between two consecutive cells of the array is constant. As far as the author knows, It is the only fully-pipelined modular linear systolic array algorithm for dynamic programming appearing in the literature for the moment.
Key WordsDesign of Algorithms Parallel Algorithms Linear Systolic Arrays Modular Arrays Complexity Dynamic Programming
Unable to display preview. Download preview PDF.
- K. Q. Brown: "Dynamic programming in computer science", CMU Tech. Report (February 1979).Google Scholar
- A. L. Fischer and H. T. Kung: "Synchronizing large VLSI processor arrays", Proc. Tenth Annual IEEE/ACM Symposium on Computer Architecture, June 1983, pp. 54–58.Google Scholar
- L. J. Guibas, H. T. Kung and C. D. Thompson:"Direct VLSI implementation of combinatorial algorithms", Proc. Conf. very Large Scale Integration: Architecture, Design, Fabrication, California Institute of Technology (January 1979), PP. 509–525.Google Scholar
- D. E. Knuth: "The Art of computer Programming", Vol. 3 Sorting and Searching, Addison-Wesley (1973).Google Scholar
- H. T. Kung: "Why systolic architecture?", IEEE Computer 15 (1) January, 1980, PP. 37–46.Google Scholar
- F. T. Leighton and C. E. Leiserson:"Wafer-scale integration of systolic arrays", Proc. Twenty third Symp. Foundations of Computer Science, November 1982, PP. 297–311.Google Scholar
- B. Louka and M. Tchuente:"Dynamic programming on two-dimensional systolic arrays", Inform. Process. Lett. 29, (1988), PP. 97–104.Google Scholar
- J. F. Myoupo:" Dynamic programming on linear systolic arrays", Proc. 28 th Annu. Allerton Conf. Contr., Commun., Comput. PP. 254–261, Oct. 1990.Google Scholar
- I. V. Ramakrishnan and P. J. Varman:" Dynamic programming and transitive closure on linear pipelines", Proc. Int. Conf. Parallel Processing, St. Charles, August 1984.Google Scholar
- F. L. Van Scoy:"The parallel recognition of classes of graphs", IEEE-TC, Vol. C-29, No.7 (July 1980), PP. 563–570.Google Scholar