Abstract
This paper addresses the problem of mapping algorithms with constant data dependences to linear processor arrays. The closed-form necessary and sufficient mapping conditions are derived to identify mappings without computational conflicts and data link collisions. These mapping conditions depend on the space-time mapping matrix and the problem size parameters only. Their correctness can be verified in constant time that is independent of problem size. The design of optimal linear processor arrays is formulated as a mathematic programming problem, which can be solved efficiently by a systematic enumeration of a polynomial search space.
Similar content being viewed by others
References
H.T. Kung and C.E. Leiserson, “Algorithms for VLSI processor arrays,” in C. Mead and L. Conway, eds.,Introduction to VLSI Systems, Chapter 8.3. Addison-Wesley, 1980.
M.C. Chen, “A design methodology for synthesizing parallel algorithms and architectures,”J. Parallel and Distributed Computing, Vol. 3, pp. 461–491, 1986.
C.-H. Huang and C. Lengauer, “The derivation of systolic implementations of programs,”Acta Informatica, Vol. 24, pp. 595–632, 1987.
B. Lisper, “Synthesizing Synchronous Systems by Static Scheduling in Space-Time,” Lecture Notes in Computer Science 362. Springer-Verlag, 1989.
P. Quinton, “Automatic synthesis of systolic arrays from uniform recurrent equations,” inProc. 11th Ann. Int. Symp. on Computer Architecture, pp. 208–214. IEEE Computer Society Press, 1984.
P. Quinton and V. van Dongen, “The mapping of linear recurrence equations on regular arrays,”J. VLSI Signal Processing, Vol. 1, pp. 95–113, 1989.
S.V. Rajopadhye and R.M. Fujimoto, “Synthesizing systolic arrays from recurrence equations,”Parallel Computing, Vol. 14, pp. 163–189, 1990.
S.K. Rao, “Regular Iterative Algorithms and their Implementations on Processor Arrays,” Ph.D. thesis, Department of Electrical Engineering, Stanford University, Oct. 1985.
J.A.B. Fortes, K.-S. Fu, and B.W. Wah, “Systematic design approaches for algorithmically specified systolic arrays,” in V.M. Milutinović, editor,Computer Architecture—Concepts and Systems, Chapter 11. North-Holland, 1988.
W. Shang and J.A.B. Fortes, “On the optimality of linear schedules,”J. VLSI Signal Processing, Vol. 1, pp. 209–220, 1989.
W. Shang and W.A.B. Fortes, “Time optimal linear schedules for algorithms with uniform dependences,”IEEE Trans. on Computers, Vol. C-40, pp. 723–742, 1991.
Y. Wong and J.M. Delosme, “Optimization of computation time for systolic arrays,” Technical Report YALEU/DCS/RR-651, Department of Computer Science, Yale University, May 1989.
Y. Wong and J.M. Delosme, “Optimization of processor count for systolic arrays,” Technical Report YALEU/DCS/RR-697, Department of Computer Science, Yale University, May 1989.
J. Bu, E.F. Deprettere, and P. Dewilde, “A design methodology for fixed-size systolic arrays,” in S.Y. Kung and E.E. Swartzlander, eds.,Application Specific Array Processors, pp. 591–602, IEEE Computer Society Press, 1990.
A. Darte, “Regular partitioning for synthesizing fixed-size systolic arrays,”Integration, Vol. 12, pp. 293–304, 1991.
D.I. Moldovan and J.A.B. Fortes, “Partitioning and mapping algorithms into fixed-size systolic arrays,”IEEE Trans. on Computers, Vol. C-35, pp. 1–12, 1986.
J. Teigh and L. Thiele, “Partitioning of processor arrays: a piecewise regular approach,”Integration, Vol. 14, pp. 97–332, 1993.
X. Zhong and S. Rajopadhye, “Deriving fully efficient systolic arrays by quasi-linear allocation functions,” in E.H.L. Aarts, J. van Leeuwen, and M. Rem, editors,Parallel Architectures and Languages Europe (PARLE'91), Vol. I: Parallel Architectures and Algorithms, Lecture Notes in Computer Science 505, pp. 219–235, Springer-Verlag, 1991.
A. Benaini and Y. Robert, “Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem,”Parallel Computing, Vol. 15, pp. 211–226, 1990.
P.R. Cappello, “A processor-time-minimal systolic array for cubical mesh algorithms,”IEEE Trans. on Parallel and Distributed Systems, Vol. 3, pp. 4–13, 1992.
P. Clauss, C. Mongenet, and G.R. Perrin, “Calculus of space-optimal mappings of systolic algorithms on processor arrays,” in S.Y. Kung and E.E. Swartzlander, eds.,Application Specific Array Processors, pp. 5–18, IEEE Computer Society Press, 1990.
J. Teich and L. Thiele, “Control generation in the design of processor arrays,”J. VLSI Signal Processing, Vol. 3, pp. 77–92, 1991.
J. Xue and C. Lengauer, “The synthesis of control signals for one-dimensional systolic arrays,”Integration, Vol. 14, pp. 1–32, 1992.
W. Shang and W.A.B. Fortes, “On time mapping of uniform dependence algorithms into lower dimensional processor arrays,”IEEE Trans. on Parallel and Distributed Systems, Vol. 3, pp. 350–363, May 1992.
D.I. Moldovan, “ADVIS: A software package for the design of systolic arrays,”IEEE Trans. on Computer-Aided Design, Vol. CAD-6, pp. 33–40, Jan. 1987.
P. Lee and Z. Kedem, “Mapping nested loop algorithms into multidimensional systolic arrays,”IEEE Trans. on Parallel and Distributed Systems, Vol. 1, pp. 64–76, 1990.
A. Benaini and M. Tchuente, “Matrix product on modular linear systolic array,” in M. Cosnard et al., ed.,Parallel & Distributed Algorithms, pp. 79–88, North-Holland, 1989.
K. Ganapathy and B.W. Wah, “Synthesizing optimal lower dimensional processor arrays,” inInt. Conf. on Parallel Processing, pp. 96–103, Aug. 1992.
P. Lee and Z. Kedem, “Synthesizing linear-array algorithms from nested for loop algorithms,”IEEE Trans. on Computers, Vol. C-37, pp. 1578–1598, 1988.
I. Ramakrishnan, D. Fussell, and A. Silberschatz, “Mapping homogeneous graphs on linear arrays,”IEEE Trans. on Computers, Vol. C-35, pp. 189–209, Mar. 1986.
V.P. Roychowdhury and T. Kailath, “Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms,”J. VLSI Signal Processing, Vol. 1, pp. 127–142, 1989.
D.I. Moldovan, “On the design of algorithms for VLSI systolic arrays,”Proc. IEEE, Vol. 71, pp. 113–120, 1983.
J. Xue, “On the loading, recovery and access of stationary data in systolic arrays,” in L. Bouge, M. Cosnard, Y. Robert, and D. Trystram, eds.,Parallel Processing: CONPAR92-VAPP V, Lecture Notes in Computer Science 634, pp. 259–264, Elsevier (North-Holland), Sept. 1992.
E.W. Dijkstra,Predicate Calculus and Programming Semantics, Series in Automatic Computation, Prentice-Hall, 1990.
R.M. Karp, R.E. Miller, and S. Winograd, “The organization of computations for uniform recurrence equations,”J. ACM, Vol. 14, pp. 563–590, 1967.
A. Schrijver,Theory of Linear and Integer Programming, Series in Discrete Mathematics, John Wiley & Sons, 1986.
P. Feautrier, “Parametric integer programming,”Operations Research, Vol. 22, pp. 243–268, 1988.
I. Ramakrishnan and P. Varman, “Modular matrix multiplication on a linear array,”IEEE Trans. on Computers, Vol. C-33, pp. 952–958, Nov. 1984.
J.F. Myoupo, “Synthesizing linear systolic arrays for dynamic programming problems,”Parallel Processing Letters, Vol. 2, pp. 97–110, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xue, J. Closed-form mapping conditions for the synthesis of linear processor arrays. Journal of VLSI Signal Processing 10, 181–199 (1995). https://doi.org/10.1007/BF02407035
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02407035