Servicios Personalizados
Revista
Articulo
Indicadores
Citado por SciELO
Accesos
Links relacionados
Similares en SciELO
Compartir
Computación y Sistemas
versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546
Resumen
SACANAMBOY, Maribell; BOLANOS, Freddy y BERNAL, Alvaro. Adaptive Algorithm Based on Renyi’s Entropy for Task Mapping in a Hierarchical Wireless Network-on-Chip Architecture. Comp. y Sist. [online]. 2018, vol.22, n.3, pp.985-996. ISSN 2007-9737. https://doi.org/10.13053/cys-22-3-2565.
This paper describes the use of Renyi’s entropy as a way to improve the convergence time of the Population-Based Incremental Learning (PBIL) optimization algorithm. As a case study, the algorithm was used in a hierarchical wireless network-on-chip (WiNoC) for the sake of performing the optimal task mapping of applications. Two versions of Renyi’s entropy are used and compared to the more traditional Shannon formulation. The obtained results are promising and suggest that Renyi’s entropy may help to reduce the PBIL convergence time, without degrading the quality of the found solutions.
Palabras llave : Renyi’s entropy; PBIL; wireless network-on-chip (WiNoC); mapping; convergence time.
