Adaptive Algorithm Based on Renyi’s Entropy for Task Mapping in a Hierarchical Wireless Network-on-Chip Architecture
Document title: Adaptive Algorithm Based on Renyi’s Entropy for Task Mapping in a Hierarchical Wireless Network-on-Chip Architecture
Journal: Computación y sistemas
Database:
System number: 000560365
ISSN: 1405-5546
Authors: 1
2
3
Institutions: 1Pontificia Universidad Javeriana, Electronics and Computer Sciences Department, Cali, Bogotá. Colombia
2Universidad Nacional de Colombia, Electrical Energy and Automation Department, Medellín. Colombia
3Universidad del Valle, Electrical and Electronics Engineering School, Cali, Valle del Cauca. Colombia
Year:
Season: Jul-Sep
Volumen: 22
Number: 3
Pages: 985-996
Country: México
Language: Inglés
English abstract 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.
Keyword: Renyi’s entropy,
PBIL,
Wireless network-on-chip (WiNoC),
Mapping,
Convergence time
Full text: Texto completo (Ver HTML) Texto completo (Ver PDF)