| Summary: | 碩士 === 國立中正大學 === 電機工程研究所 === 81 === Systolic arrays, which are made out of simple processing
elements connected by data links,have made significient
improvements in speeding up computation in comparision to
conventional computers. Although systolic arrays belong to
distributed memorey parallel devices, they adopt systolic
communications instead of message passing communications for
sending data between neighboring processing elements.
Therefore, it is important to provide necessary and sufficient
conditions to avoid data collisions in the data links for a
correct algorithm design. In this paper, we present a complete
set of necessary and sufficient conditions for mapping the
class of shift-invarient uniform-dependence algorithms
structured as nested loops into grid-connected systolic arrays
of arbitrary dimensions. The proposed conditions, which are
based on the ZERO-ONE-INFINITE property of tokens' behavior
that describes how many times tokens are used and generated
during the computation , can allow us to generate all feasible
solutions.
|
|---|
