Content deleted Content added
Add Mark II Colossus computer as the first machine to use one |
No edit summary |
||
Line 7:
An example of a systolic [[algorithm]] might be [[Matrix_multiplication|matrix multiplication]]. One [[matrix (math)|matrix]] is fed in a row at a time from the top of the array and is passed down the array, the other matrix is fed in a column at a time from the left hand side of the array and passes from left to right. Dummy values are then passed in until each processor has seen one whole row and one whole column. At this point, the result of the multiplication is stored in the array and can now be output a row or a column at a time, flowing down or across the array.
Because the classical synthesis methods (algebraic, i. e. projection-based synthesis), yielding only uniform [[DPU]] arrays permitting only linear pipes, systolic arrays could be used only to implement applications with regular data dependencies. By using simulated annealing instead, [[Rainer Kress]] came up with the [[super systolic array]], a generalization of the systolic array not being restricted to regular data dependencies.
''See also'': [[SISAL]].▼
▲''See also'': [[SISAL]] and [[super systolic array]].
==External links==
*[http://www.iti.fh-flensburg.de/lang/papers/isa/index.htm ''Instruction Systolic Array (ISA)'']
*[http://kressarray.de/ KressArray]
{{FOLDOC}}
| |||