Adaptive Algorithm based on Renyi’s Entropy for Task Mapping in a Hierarchical Wireless Network-on-Chip Architecture

Authors

  • Maribell Sacanamboy Pontificia Universidad Javeriana Cali, Universidad del Valle
  • Freddy Bolaños Universidad Nacional de Colombia, Sede Medellín
  • Alvaro Bernal Universidad del Valle

DOI:

https://doi.org/10.13053/cys-22-3-2565

Keywords:

Renyi’s entropy, PBIL, Wireless network-on-chip (WiNoC), Mapping, Convergence time.

Abstract

This paper describes the use of Renyi’sentropy as a way to improve the convergence timeof the Population-Based Incremental Learning (PBIL)optimization algorithm. As a case study, the algorithmwas used in a hierarchical wireless network-on-chip(WiNoC) for the sake of performing the optimal taskmapping of applications. Two versions of Renyi’s entropyare used and compared to the more traditional Shannonformulation. The obtained results are promising andsuggest that Renyi’s entropy may help to reduce thePBIL convergence time, without degrading the quality ofthe found solutions.

Downloads

Additional Files

Published

2018-09-26