On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays

IEEE Transactions on Parallel and Distributed Systems

Volumn 3, Issue 3, 1992, Pages 350-363

  Fortes, Jose A B ^b  

^a UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002140529     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.139208     Document Type: Article

References (37)

1. R. M. Karp, R.E. Miller, and S. Winograd, “The organization of computations for uniform recurrence equations,” J. ACM, vol. 14, no. 3, pp. 563–590, July 1967.
2. D.I. Moldovan and J. A. B. Fortes, “Partitioning and mapping algorithms into fixed size systolic arrays,” IEEE Trans. Comput., vol. C-35, pp. 1–12, Jan. 1986
3. P. R. Cappello and K. Steiglitz, “Unifying VLSI array designs with geometric transformations,” in Proc. 1983 Int. Conf. Parallel Processing, pp. 448–457.
4. P. Quinton, “Automatic synthesis of systolic arrays from uniform recurrent equations,” in Proc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208–214.
5. S. K. Rao, “Regular iterative algorithms and their implementations on processor arrays,” Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
6. M. Chen, “A design methodology for synthesizing parallel algorithms and architectures,” J. Parallel Distributed Comput., Dec. 1986, pp. 461–491.
7. J.-M. Delosme and I.C.F. Ipsen, “An illustration of a methodology for the construction of efficient systolic architectures in VLSI,” in Proc. Second Int. Symp. VLSI Technol., Syst. Appl., 1985, pp. 268–273.
8. S. Y. Kung, VLSI Array Processors. Englewood Cliffs, NJ: Prentice-Hall, 1987.
9. C. Guerra and R. Melhem, “Synthesizing non-uniform systolic designs,” in Proc. 1986 Int. Conf. Parallel Processing, pp. 765–771.
10. G.-J. Li and B. W. Wah, “The design of optimal systolic arrays,” IEEE Trans. Comput., vol. C-34, pp. 66–77, Jan. 1985.
11. M. T. O’Keefe and J. A. B. Fortes, “A comparative study of two systematic design methodologies for systolic arrays,” in Proc. 1986 Int. Conf. Parallel Processing, pp. 672–675.
12. J.A. B. Fortes and F. Parisi-Presicce “Optimal linear schedule for the parallel execution of algorithms,” in Proc. 1984 Int. Conf. Parallel Processing, pp. 322–328.
13. L. Lamport, “The parallel execution of DO loops,” Commun. ACM, vol. 17, no. 2, pp. 83–93, Feb. 1974.
14. J.-K. Peir and R. Cytron, “Minimum distance: A method for partitioning recurrences for multiprocessors,” in Proc. 1987 Int. Conf Parallel Processing, pp. 217–225.
15. V. P. Roychowdhury and T. Kailath, “Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms,” J. VLSI Signal Processing, vol. 1, 1989.
16. W. Shang and J.A.B. Fortes, “Time optimal linear schedules for algorithms with uniform dependencies,” IEEE Trans. Comput., vol. 40, pp. 723–742, June 1991.
17. S.Y. Kung, S. C. Lo, and P. S. Lewis, “Optimal systolic design for the transitive closure and the shortest path problems,” IEEE Trans. Comput., vol. C-36, pp. 603–614, May 1987.
18. G. Strang, Linear Algebra and its Applications, second ed. New York: Academic, 1980.
19. R. Cytron, “Doacross: Beyond vectorization for multiprocessors (extended abstract),” in Proc. 1986 Int. Conf. Parallel Processing, pp. 836–844.
20. R. Kannan and A. Bachem, “Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix,” SIAM J. Comput., vol. 8, no. 4, pp. 499–507, Nov. 1979.
21. H. T. Kung and C.E. Leiserson, “Algorithms for VLSI array processors,” in Introduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980, sect. 8.3.
22. P. Lee and Z. M. Kedem, “Mapping nested loop algorithms into multidimensional systolic arrays,” IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 64–76, Jan. 1990.
23. —, “Synthesizing linear array algorithms from nested for loop algorithms,” IEEE Trans. Comput., vol. 37, pp. 1578–1598, Dec. 1988.
24. D. A. Padua, “Multiprocessors: Discussion of theoretical and practical problems,” Ph. D dissertation, Univ. of Illinois at Urbana-Champaign, Rep. UIUCDCS-R-79-990, Nov. 1979.
25. Y. Wong and J.-M. Delosme, “Optimal systolic implementation of N-dimensional recurrences,” in IEEE Proc. ICCD, 1985, pp. 618–621.
26. V. E. Taylor and J. A. B. Fortes, “Using RAB to map algorithms into bit-level systolic arrays,” in Proc. Int. Conf. Supercomput., May 1987.
27. L.J. Mordell, Diophantine Equations. New York: Academic, 1969, p. 30.
28. M.T. O’Keefe and J.A.B. Fortes, “Bit level processor array: Current architectures and a design and a programming tool,” in Proc. 1988 Int. Symp. Circuit Syst., Helsinki, Finland, June 1988, pp. 2751–2755.
29. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
30. W. Shang, “Scheduling, partitioning and mapping of uniform dependence algorithms on processor arrays,” Ph.D. dissertation, Purdue Univ., W. Lafayette, IN 47907, May 1990.
31. T. Blank, “The MasPar MP-1 Architecture,” in Proc. 35th IEEE Comput. Soc. Int. Conf.—Spring Compcon 90, San Francisco, CA, Feb. 1990.
32. D. I. Moldovan, “On the design of algorithms for VLSI systolic arrays,” Proc. IEEE, vol. 71, pp. 113–120, Jan. 1983.
33. R. Davis and D. Thomas, “Systolic array chip matches the pace of high-speed processing,” Electron. Design, Oct. 31, 1984.
34. R.W. Hockney and C. R. Jesshope, Parallel Computers: Architecture, Programming and Algorithms. Bristol, Adam Hilger: 1981, pp. 178–192.
35. K. E. Batcher, “Bit-serial parallel processing systems,” IEEE Trans. Comput., vol. C-31, no. 5, pp. 377–384.
36. J. A. B. Fortes and B. W. Wah, “Systolic array—From concept to implementation,” IEEE Comput. Mag., pp. 12–17, July 1987.
37. Z. Yang, W. Shang, and J. A. B. Fortes, “One-to-one time mappings of nested algorithms into lower dimensional processor arrays,” in Proc. Sixth IEEE Int. Parallel Processing Symp., Mar. 1992, Beverly Hills, CA, pp. 156–164.