Heuristics for Greedy Transport Triggered Architecture Interconnect Exploration
Viitanen, Timo; Kultala, Heikki; Jääskeläinen, Pekka; Takala, Jarno (2014)
Viitanen, Timo
Kultala, Heikki
Jääskeläinen, Pekka
Takala, Jarno
ACM
2014
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tty-201412081609
https://urn.fi/URN:NBN:fi:tty-201412081609
Kuvaus
Peer reviewed
Tiivistelmä
Most power dissipation in Very Large Instruction Word (VLIW) processors occurs in their large, multi-port register files. Transport Triggered Architecture (TTA) is a VLIW variant whose exposed datapath reduces the need for RF accesses and ports. However, the comparative advantage of TTAs suffers in practice from a wide instruction word and complex interconnection network (IC). We argue that these issues are at least partly due to suboptimal design choices. The design space of possible TTA architectures is very large, and previous automated and ad-hoc design methods often produce inefficient architectures. We propose a reduced design space where efficient TTAs can be generated in a short time using execution trace-driven greedy exploration. The proposed approach is evaluated by optimizing the equivalent of a 4-issue VLIW architecture. The algorithm finishes quickly and produces a processor with 10% reduced core energy compared to a fully-connected TTA. Since the generated processor has low IC power and a shorter instruction word than a typical 4-issue VLIW, the results support the hypothesis that these drawbacks of TTA can be worked around with efficient IC design.
Kokoelmat
- TUNICRIS-julkaisut [16951]