论文信息 - Formal description of systolic algorithms and an analysis of the information flow - 字舞流文

Formal description of systolic algorithms and an analysis of the information flow

Presentation d'une formalisation mathematique stricte des algorithmes systoliques. L'equivalence entre des tableaux systoliques est alors definie. Un graphe de dependance de donnees est defini comme un outil d'analyse du flux d'informations

Yasuyoshi Inagaki | Hirotome Aso | Y. Inagaki | Hirotomo Aso

[1] Oscar H. Ibarra,et al. Designing Systolic Algorithms Using Sequential Machines , 1986, IEEE Transactions on Computers.

[2] Dan I. Moldovan,et al. Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[3] Hirotomo Aso,et al. A synthesis method of systolic algorithms for nested loop programs , 1988, Systems and Computers in Japan.

[4] P. Quinton. Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

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

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