TY - JOUR
T1 - Overcoming chip-to-chip delays and clock skews
AU - Even, Guy
AU - Litman, Ami
N1 - Funding Information:
* Corresponding author. Tel.: +972 3 6407769; fax: +972 3 6407095; e-mail: [email protected]. Research conducted while in the Computer Science Dept., Technion, Haifa 32000, Israel, and supported by the Miriam and Aaron Gutwirth Memorial Fellowship.
PY - 1997/12
Y1 - 1997/12
N2 - In general, mapping a circuit onto several chips incurs a physical setting which differs from the physical setting within a chip. Specifically, the delay of chip-to-chip interconnections is much longer than on-chip delays of wires and gates. This delay effects the bandwidth as well. In addition, the clock skew between chips is larger than the clock skew within a chip. One may mistakenly conclude that the feasible clock period of a systolic array cannot be smaller than the maximal delay of an interconnection in a realization of the circuit. This paper proposes a technique for mapping large systolic linear arrays and systolic two-dimensional arrays onto several chips while almost maintaining the clock rates which are obtainable when these circuits are small enough to fit into a single chip. Our solution does not rely on special analogue techniques. It is described by a sequence of transformations (logic duplication and retiming), reductions, and an implementation of interconnections which have a required behavior in a given physical setting. It is shown that each step preserves functionality, and subsequently, the correctness of the proposed solution is implied.
AB - In general, mapping a circuit onto several chips incurs a physical setting which differs from the physical setting within a chip. Specifically, the delay of chip-to-chip interconnections is much longer than on-chip delays of wires and gates. This delay effects the bandwidth as well. In addition, the clock skew between chips is larger than the clock skew within a chip. One may mistakenly conclude that the feasible clock period of a systolic array cannot be smaller than the maximal delay of an interconnection in a realization of the circuit. This paper proposes a technique for mapping large systolic linear arrays and systolic two-dimensional arrays onto several chips while almost maintaining the clock rates which are obtainable when these circuits are small enough to fit into a single chip. Our solution does not rely on special analogue techniques. It is described by a sequence of transformations (logic duplication and retiming), reductions, and an implementation of interconnections which have a required behavior in a given physical setting. It is shown that each step preserves functionality, and subsequently, the correctness of the proposed solution is implied.
KW - Chip-to-chip delays
KW - Clock skews
KW - Systolic array
UR - http://www.scopus.com/inward/record.url?scp=0031339749&partnerID=8YFLogxK
U2 - 10.1016/S0167-9260(97)00028-X
DO - 10.1016/S0167-9260(97)00028-X
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0031339749
SN - 0167-9260
VL - 24
SP - 119
EP - 133
JO - Integration, the VLSI Journal
JF - Integration, the VLSI Journal
IS - 2
ER -