Linear mappings of n-dimensional uniform recurrences onto k-dimensional systolic arrays

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology

Volumn 12, Issue 2, 1996, Pages 187-202

  Zimmermann, Karl Heinz ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; IMAGE PROCESSING; OPTIMIZATION; PROGRAM PROCESSORS; SIGNAL PROCESSING; STORAGE ALLOCATION (COMPUTER);

ALLOCATION FUNCTION; HYPERPLANE METHOD; LINEAR MAPPINGS; SCALAR VALUED CAUSAL TIMING FUNCTION; UNIFORM RECURRENCE EQUATIONS;

SYSTOLIC ARRAYS;

EID: 0030148463     PISSN: 09225773     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00924526     Document Type: Article

References (51)

1. H.T. Kung and C.E. Leiserson, "Systolic arrays (for VLSI)," in Duff et al. (Eds.) Sparse Matrix Proc. Soc. Ind. App. Math., pp. 256-282, 1979.
2. C. Mead and L. Conway, Introduction to VLSI Systems, Reading, MA: Addison-Wesley, 1980.
3. L. Guibas, H.T. Kung, and C.D. Thompson, "Direct VLSI implementation of combinatorial algorithms," Proc. Conf. on Very Large Scale Integration: Architecture, Design and Fabrication, pp. 509-525, 1979.
4. H.T. Kung, "Why systolic architectures?," Computer, Vol. 15, pp. 37-46, 1982.
5. S.Y. Kung, VLSI Array Processors, Englewood Cliffs, NJ: Prentice Hall, 1987.
6. R.H. Kuhn, "Transforming algorithms for single-stage and VLSI architectures," Proc. Workshop Interconnection Networks Parallel Distributed Processing, IEEE CH1560-2, pp. 11-19, 1980.
7. D.I. Moldovan, "On the analysis and synthesis of VLSI algorithms," IEEE Transaction on Computers, Vol. C-31, No. 11, pp. 1121-1126, 1982.
8. D.I. Moldovan, "ADVIS: A software package for the design of systolic arrays," Proc. 1984 IEEE ICCD: VLSI in Computers, pp. 158-164, 1984.
9. W.L. Miranker and A. Winkler, "Spacetime representations of computational structures," Computing, Vol. 32, pp. 93-114, 1984.
10. P.R. Cappello and K. Steiglitz, "Unifying VLSI designs with linear tranformations on space time," Adv. Comput. Res., Vol. 2, pp. 23-65, 1984.
11. K. Culik II and I. Fris, "Topological transformations as a tool in the design of systolic networks," Research Report CS-84-11, Dept. of Computer Science, University of Waterloo, Waterloo, Canada, 1984.
12. Y. Wong and J.-M. Delosme, "Optimal systolic implementation of n-dimensionale recurrences," IEEE Proc. ICCD, pp. 618-621, 1985.
13. S.K. Rao, Regular Iterative Algorithms and Their Implementations on Processor Arrays, Ph.D. thesis, Stanford University, Stanford, CA, 1985.
14. J.A.B. Fortes, K.S. Fu, and B.W. Wah, "Systematic approach to the design of algorithmically specified systolic arrays," Proc. ISCASSP, pp. 8.9.1-4, 1985.
15. G. Lin and B.W. Waft, "The design of optimal systolic design," IEEE Trans. Comput., Vol. C-34, pp. 66-77, 1985.
16. D.I. Moldovan and J.A.B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays," IEEE Transaction on Computers, Vol. 35, No. 1, pp. 1-12, 1986.
17. J.-M. Delosme and I.C.F. Ipsen, "Systolic array synthesis: Computability and time cones," M. Cosnard et al. (Eds.), in Parallel Algorithms and Architectures, North Holland, pp. 295-312, 1986.
18. J. McCanny and J. McWhirter, "The derivation and utilization of bit level systolic array architectures," Proc. 1986 Int. Workshop Systolic Arrays, Oxford, England, pp. 47-59, 1986.
19. S.V. Rajopadhye and R.M. Fujimoto, "Systolic array synthesis by static analysis of program dependencies," Conf. PARLE, Eindhoven, LCNS 259, pp. 295-310, 1987.
20. P. Lee and Z.M. Kedem, "Synthesizing linear array algorithms from nested for loop algorithms," IEEE Transaction on Computers, Vol. C-37, No. 12, pp. 1578-1597, 1988.
21. P. Clauss and G.-R. Perrin, "Synthesis of process arrays," Conpar '88, Cambridge: Cambrigde Univ. Press, 1988.
22. M.C. Chen, "Transformations of parallel programs in CRYSTAL," Tech. Report YALEU/DCS/TR-608, Yale University, 1988.
23. A.M. Benaini and M. Tchuente, "Matrix product on modular linear systolic arrays, M. Cosnard et al. (Eds.), in Parallel and Distributed Algorithms, North Holland, pp. 79-88, 1989.
24. W. Shang and J.A.B. Fortes, "Time optimal and conflict free mappings of uniform dependence algorithms into lower dimensional processor arrays," Int. Conf. on Parallel Processing, pp. 101-110, 1990.
25. H. LeVerge, C. Mauras, and P. Quinton, "The ALPHA language and its use for the design of systolic arrays," VLSI Signal Processing, Vol. 3, pp. 173-182, 1991.
26. Y. Wong and J.-M. Delosme, "Optimization of computation time for systolic arrays," IEEE Transactions on Computers, Vol. 41, No. 2, pp. 159-177, 1992.
27. R.M. Karp, R.E. Miller, and S. Winograd, "The organization of computations for uniform recurrence equations," Journal of the ACM, Vol. 13, No. 3, pp. 563-590, 1967.
28. L. Lamport, "The parallel execution of DO loops," Commun. ACM, pp. 83-93, 1974.
29. A. Darte, T. Risset, and Y. Robert, "Synthesizing systolic arrays: Some recent developments" Int. Conf. on Application Specific Array Processors, IEEE Computer Soc. Press, pp. 372-386, 1991.
30. P. Clauss, C. Mongenet, and G.-R. Perrin, "Calculus of space-optimal mappings of systolic algorithms on processor arrays," J. VLSI Signal Processing, Vol. 4, pp. 27-36, 1992.
31. W Shang and J.A.B. Fortes, "Time optimal linear schedules for algorithms with uniform dependencies," IEEE Transaction on Computers, Vol. 40, No. 6, pp. 723-742, 1991.
32. A. Darte, L. Khachiyan, and Y. Robert, "Linear scheduling is close to optimality," Int. Conf. on Application Specific Array Processors, IEEE Computer Soc. Press, pp. 37-46, 1992.
33. P. Quinton, "The systematic design of systolic arrays," in F. Folgelman-Soulie et al. (Eds.), Automata Networks in Computer Science, Manchester: Manchester University Press, pp. 229-260, 1987.
34. P. Feautrier, "Some efficient solutions to the affine scheduling problem. I. One-dimensional time," Int. J. of Parallel Programming, Vol. 21, No. 5, pp. 313-347, 1992.
35. J.A.B. Fortes and F. Parisi-Presicce, "Optimal linear schedules for the parallel execution of algorithms," Int. Conf. on Parallel Processing, pp. 322-328, 1984.
36. P. Feautrier, "Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time," Int. J. of Parallel Programming, Vol. 21, No. 6, pp. 389-420, 1992.
37. J.W.S. Cassels, An Introduction to the Geometry of Numbers, Berlin: Springer, 1959.
38. C. Mongenet, "Affine timing for systems of affine recurrence equations," PARLE91, LNCS 505, Springer, pp. 237-251, 1991.
39. CD. Polychronopoulos, Parallel Programming and Compilers, Boston: Kluwer, 1988.
40. W. Shang, M.T. O'Keefe, and J.A.B. Fortes, "On loop transformations for generalized cycle shrinking," IEEE Transaction on Parallel and Distributed Systems, Vol. 5, No. 2, pp. 193-205, 1994.
41. A. Schrijver, Theory of Linear and Integer Programming, New York: Wiley & Sons, 1986.
42. B. McDonald, Finite Rings with Identity, New York: Marcel Dekker, 1974.
43. K.-H. Zimmermann, "An optimal partitioning method for parallel algorithms: LSGP," B. Soucek and IRIS Group (Eds.), in Genetic, Chaotic and Parallel Programming: The Sixth Generation, New York: Wiley & Sons, pp. 233-266, 1992.
44. P.R. Cappello, "A spacetime-minimal systolic array for matrix product," J. McCanny, J. McWhirter, and E.E. Schwartzlander Jr. (Eds.), in Systolic Array Processors, Prentice Hall, pp. 347-356, 1989.
45. J. Vlontzos, "A wavefront array processor using dataflow processing elements," Proc. Int. Conf. on Supercomputing, Athens, Greece, 1987.
46. J. Bu, E.F. Deprettere, and P. Dewilde, "A design mthodology for fixed-size systolic arrays," Int. Conf. on Application Specific Array Processors, IEEE Computer Soc. Press, pp. 591-600, 1990.
47. B. Lisper, "Linear programming methods for minimizing execution time of indexed computations," P. Feautrier and F. Irigion (Eds.), in Int. Workshop on Compilers for Parallel Computers, pp. 131-142, 1991.
48. S.V. Rajopadhye, "Synthesizing systolic arrays with control signals from recurrence equations," Distributed Computing, Vol. 3, 88-105, 1989.
49. Y. Yaacobi and P.R. Cappello, "Converting affine recurrence equations to quasi-uniform recurrence equations," Third Int. Workshop on Parallel Computation and VLSI Theory, San Diego, 1988, pp. 373-382.
50. Y. Yaacobi and P.R. Cappello, "Scheduling a system of affine recurrence equations onto a systolic array," Int. Conf. on Systolic Arrays, San Diego, 1988, pp. 373-382.
51. C. Mongenet, P. Clauss, and G.-R. Perrin, "Geometrical tools to map systems of affine recurrence equations on regular array," Acta Informatica, Vol. 31, pp. 137-160, 1994.