Hierarchical concepts in the design of processor arrays

A hierarchical representation of parallel algorithms is described that can be systematically mapped onto a class of massive parallel architectures called processor arrays. A notation of hierarchical parallel programs is introduced for the representation of algorithms that can be mapped onto processor arrays. By means of a transformative approach, two provably correct program transformations are introduced to solve the problems of generating (CREATE) and of dissolving (FLATTEN) different levels of hierarchy. The program transformations CREATE and FLATTEN are formally described and explained by an example.<<ETX>>

[1]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[2]  Lothar Thiele,et al.  The concepts of COMPAR- a compiler for massively parallel architectures , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[3]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[4]  D.I. Moldovan,et al.  On the design of algorithms for VLSI systolic arrays , 1983, Proceedings of the IEEE.

[5]  Young-il Choo,et al.  Parallel-program transformation using a metalanguage , 1991, PPOPP '91.

[6]  Lothar Thiele,et al.  On the design of piecewise regular processor arrays , 1989, IEEE International Symposium on Circuits and Systems,.

[7]  Uwe Schwiegelshohn,et al.  A Systolic Array for the Assignment Problem , 1988, IEEE Trans. Computers.

[8]  K. Chen.  Bit-serial realizations of a class of nonlinear filters based on positive Boolean functions , 1989 .

[9]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .