Scalable Run-time Task Mapping on BNoC Topology Focusing on Energy-efficiency

The current work demonstrates a run-time application mapping technique on the BNoC network. Crucial properties of the BNoC design like low diameter and high path diversity alleviate the mapping overhead of optimizing communication hop-count and resource utilization to a considerable extent. As a result, the mapping time decreases significantly. Rigorous experimentation is done on the varying application and network sizes with the prevalent mesh-based run-time mapping algorithms. A minimum gain of 18% is found on the deadline satisfaction rate across various applications. The minimum improvement on the overall energy budget remains 21 %.