Dynamic application mapping on CTH network
Avik Bose, Prasun Ghosal · 2021
Communication cost in terms of energy consumption and network latency, along with the dynamic allocation time of the tasks and their execution time, is the primary design concern of a run-time mapping and scheduling strategy that may significantly affect the overall performance of an application. The present work proposes a dynamic mapping and scheduling algorithm based on the Cube-Tree-Hybrid (CTH) topology. The CTH network can integrate a large number of IP cores under significantly low network diameter, as opposed to mesh. Moreover, the design of CTH comes with considerable path diversity. For the above properties, mapping on CTH becomes simpler than mesh, which successfully minimizes the communication hop distance amongst various tasks of an application. Extensive experimentation has been done across several synthetic and real application workloads. Compared to the prevalent mesh-based mapping techniques, the proposed algorithm achieves a minimum gain of 56% on communication latency, whereas it is 36% in total power consumption. Minimum 14% improvement on applications' deadline satisfaction is achieved.