This paper introduces a method of merging systolic messy arrays. A systolic messy array features data-triggered PEs placed in various directions in a 2-dimensional lattice plane. The two kinds of merging are described as Shared-array and Interlacing-array. A shared-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays and the data on the portions is shared with all systolic messy arrays. An interlacing-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays but where the data on the portions is not shared. The data on the portions flows independently so that an interlacing-array can deal with each of its own calculations without interference. Several examples of the two kinds of merging are presented and their construction methods are illustrated.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Makio ISHIHARA, Hironori KIDA, Minoru TANAKA, "Merging of Systolic Messy Arrays Based on Data Flows" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 2, pp. 639-643, February 2006, doi: 10.1093/ietfec/e89-a.2.639.
Abstract: This paper introduces a method of merging systolic messy arrays. A systolic messy array features data-triggered PEs placed in various directions in a 2-dimensional lattice plane. The two kinds of merging are described as Shared-array and Interlacing-array. A shared-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays and the data on the portions is shared with all systolic messy arrays. An interlacing-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays but where the data on the portions is not shared. The data on the portions flows independently so that an interlacing-array can deal with each of its own calculations without interference. Several examples of the two kinds of merging are presented and their construction methods are illustrated.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.2.639/_p
Copy
@ARTICLE{e89-a_2_639,
author={Makio ISHIHARA, Hironori KIDA, Minoru TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Merging of Systolic Messy Arrays Based on Data Flows},
year={2006},
volume={E89-A},
number={2},
pages={639-643},
abstract={This paper introduces a method of merging systolic messy arrays. A systolic messy array features data-triggered PEs placed in various directions in a 2-dimensional lattice plane. The two kinds of merging are described as Shared-array and Interlacing-array. A shared-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays and the data on the portions is shared with all systolic messy arrays. An interlacing-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays but where the data on the portions is not shared. The data on the portions flows independently so that an interlacing-array can deal with each of its own calculations without interference. Several examples of the two kinds of merging are presented and their construction methods are illustrated.},
keywords={},
doi={10.1093/ietfec/e89-a.2.639},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Merging of Systolic Messy Arrays Based on Data Flows
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 639
EP - 643
AU - Makio ISHIHARA
AU - Hironori KIDA
AU - Minoru TANAKA
PY - 2006
DO - 10.1093/ietfec/e89-a.2.639
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2006
AB - This paper introduces a method of merging systolic messy arrays. A systolic messy array features data-triggered PEs placed in various directions in a 2-dimensional lattice plane. The two kinds of merging are described as Shared-array and Interlacing-array. A shared-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays and the data on the portions is shared with all systolic messy arrays. An interlacing-array is a systolic messy array where at least two systolic messy arrays share portions of their arrays but where the data on the portions is not shared. The data on the portions flows independently so that an interlacing-array can deal with each of its own calculations without interference. Several examples of the two kinds of merging are presented and their construction methods are illustrated.
ER -