You are here: TUCS > PUBLICATIONS > Publication Search > Tree-Model Based Contention-Aw...
Tree-Model Based Contention-Aware Task Mapping on Many-Core Network-on-Chips
Bo Yang, Liang Guang, Tero Säntti, Juha Plosila, Tree-Model Based Contention-Aware Task Mapping on Many-Core Network-on-Chips. In: Bo Yang, Liang Guang, Tero Säntti, Juha Plosila (Eds.), The 3rd International Conference on Information Science and Engineering (ICISE2011), 731-736, IEEE, 2011.
Abstract:
The many-core Network-on-Chip (NoC) has become a widely-used platform for future massive parallel computing. One major design concern on such platforms is how to decrease the contentions resulted from numerous concurrent communications on the NoC. Contention-aware task-mapping is needed in order to alleviate the contention on the network and improve the system performance. In this work, we propose a tree-model task-mapping algorithm taking the bandwidth constraints on the channels into consideration. A new model is employed in the algorithm with the purpose of balancing the weighted communication volume and bandwidth occupancy on the NoC. The quantitative comparison shows that the proposed contention-aware algorithm significantly reduces the bandwidth requirement and balances the work load on the communication channels, while the overhead of the weighted communication volume is minimized.
BibTeX entry:
@INPROCEEDINGS{iYaGuS_Pl11a,
title = {Tree-Model Based Contention-Aware Task Mapping on Many-Core Network-on-Chips},
booktitle = {The 3rd International Conference on Information Science and Engineering (ICISE2011)},
author = {Yang, Bo and Guang, Liang and Säntti, Tero and Plosila, Juha},
editor = {Yang, Bo and Guang, Liang and Säntti, Tero and Plosila, Juha},
publisher = {IEEE},
pages = {731-736},
year = {2011},
}
Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)