L0 Cluster Synthesis and Operation Shuffling

Jayapala, Murali; Aa, Tom Vander; Barat, Francisco; Catthoor, Francky; Corporaal, Henk

doi:10.1007/978-3-540-30205-6_33

Cited by 3 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This implies that the search space is local and hence the optimality is compromised. Note that in both our work as well as in Jayapala et al [2004] the dependencies between operations are still preserved. Furthermore, by applying the proposed method to each data cluster, VLIW architectures with multiple data clusters can also be treated as data clusters are common in wide VLIWs for energy efficiency.…”

Section: Motivation and Problemmentioning

confidence: 88%

“…We also propose heuristics to reduce the search space, which considers the influence of previously assigned operations, while the previous work ] assigns operations independently of other operations. In Jayapala et al [2004] the impact of an operation shuffle in one cycle is not taken into account for the next shuffle. This implies that the search space is local and hence the optimality is compromised.…”

Section: Motivation and Problemmentioning

confidence: 99%

“…However, the instruction clusters correspond directly to the data clusters, while we make an instruction cluster explicitly separated from a data cluster to increase the exploration freedom. This results in larger gains of up to energy reduction of 75% as demonstrated in Jayapala et al [2004]. A loop buffer or loop cache has been studied for years, which aims for energy reduction on instruction memory hierarchy as well as performance improvement.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Methodology for operation shuffling and L0 cluster generation for low energy heterogeneous VLIW processors

Kobayashi

Jayapala

Raghavan

et al. 2007

ACM Trans. Des. Autom. Electron. Syst.

Self Cite

View full text Add to dashboard Cite

Clustering L0 buffers is effective for energy reduction in the instruction memory hierarchy of embedded VLIW processors. However, the efficiency of the clustering depends on the schedule of the target application. Especially in heterogeneous or data clustered VLIW processors, determining energy efficient scheduling is more constraining.This article proposes a realistic technique supported by a tool flow to explore operation shuffling for improving generation of L0 clusters. The tool flow explores assignment of operations for each cycle and generates various schedules. This approach makes it possible to reduce energy consumption for various processor architectures. However, the computational complexity is large because of the huge exploration space. Therefore, some heuristics are also developed, which reduce the size of the exploration space while the solution quality remains reasonable. Furthermore, we also propose a technique to support VLIW processors with multiple data clusters, which is essential to apply the methodology to real world processors.The experimental results indicate potential gains of up to 27.6% in energy in L0 buffers, through operation shuffling for heterogeneous processor architectures as well as a homogeneous This work is supported by JSPS Grant-in-Aid for JSPS Fellows #17.9887. Based on Kobayashi, Y., Jayapala, M., Raghavan, P., Catthoor, F., and Imai, M. Operation shuffling for low energy L0 cluster generation on heterogeneous VLIW processors.

show abstract

Section: Motivation and Problemmentioning

confidence: 88%

Section: Motivation and Problemmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation