Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/10495/9986
Título : Mapping and Scheduling in Heterogeneous NoC through Population-Based Incremental Learning
Autor : Aedo Cobo, José Edinson
Rivera Vélez, Fredy Alexander
Bagherzadeh, Nader
metadata.dc.subject.*: Aprendizaje Incremental Basado en la Población
Diseño con ayuda de computador
Multiprocesador
Computer-aided Design
Multiprocessors
Fecha de publicación : 2012
Editorial : Graz University of Technology, Institut für Informationssysteme und Computer Medien (IICM)
Citación : F. Bolaños-MartInez, J. E. Aedo-Cobo, F. A. Rivera-Vélez and N. Bagherzadeh, "Mapping and Scheduling in Heterogeneous NoC through Population-Based Incremental Learning," Journal of Universal Computer Science, vol. 18, no. 7, pp. 901-916, 2012.
Resumen : ABSTRACT: Network-on-Chip (NoC) is a growing and promising communication paradigm for Multiprocessor-System-On-Chip (MPSoC) design, because of its scalability and performance features. In designing such systems, mapping and scheduling are becoming critical stages, because of the increase of both size of the network and application’s complexity. Some reported solutions solve each issue independently. However, a conjoint approach for solving mapping and scheduling allows to take into account both computation and communication objectives simultaneously. This paper shows a mapping and scheduling solution, which is based on a Population-Based Incremental Learning (PBIL) algorithm. The simulation results suggest that our PBIL approach is able to find optimal mapping and scheduling, in a multi-objective fashion. A 2-D heterogeneous mesh was used as target architecture for implementation, although the PBIL representation is suited to deal with more complex architectures, such as 3-D meshes.
metadata.dc.identifier.eissn: 0948-6968
ISSN : 0948695X
Aparece en las colecciones: Artículos de Revista en Ingeniería

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
AedoJose_2005_MappingandScheduling.pdfArtículo de investigación267.27 kBAdobe PDFVisualizar/Abrir


Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons