Communication-aware branch and bound with cluster-based latency-constraint mapping technique on network-on-chip

Abstract : Mapping intellectual properties (IPs) on Network-on-Chip (NoC) has a notable impact on the timing, performance, and energy consumption of NoC. In this paper, we present a novel performance and power aware task mapping technique based on mesh NoC that combines the latency constraint and branch and bound concepts. Our proposal for the definition of latency constraint helps intensify the bounds for pattern searching. With appropriate latency constraints, the best mapping solution can be achieved with less CPU time. This algorithm can be used with any NoC mesh shape. The mapping solutions are emulated on the FPGA-based NoC emulation platform. The experimental results demonstrate that the latency-constraint branch and bound technique can achieve better timing and lower energy consumption in nearly half the CPU time of the traditional branch and bound mapping algorithm
Type de document :
Article dans une revue
The Journal of Supercomputing, Springer, 2016
Liste complète des métadonnées

https://hal-auf.archives-ouvertes.fr/hal-01317477
Contributeur : Virginie Fresse <>
Soumis le : mercredi 18 mai 2016 - 13:50:04
Dernière modification le : jeudi 26 juillet 2018 - 01:10:38

Identifiants

  • HAL Id : hal-01317477, version 1

Citation

Ke Pang, Virginie Fresse, Suying Yao. Communication-aware branch and bound with cluster-based latency-constraint mapping technique on network-on-chip. The Journal of Supercomputing, Springer, 2016. 〈hal-01317477〉

Partager

Métriques

Consultations de la notice

102