Dissemin is shutting down on January 1st, 2025

Links

Tools

Export citation

Search in Google Scholar

Algoritmo K-means para Mapeamento Estático de Processos em Redes-em-Chip

Proceedings article published in 2014 by Cíntia P. Avelar, Pedro Henrique Penna ORCID, Henrique Cota Freitas
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

Performance is an important issue for many-core architectures supported by networks-on-chip. One alternative for improving it is to map processes onto cores so as to mitigate the overall interprocess communication cost. In this context, this paper proposes the Kmeans algorithm as an alternative strategy to DRB and Greedy heuristics. For some communication patterns, our results pointed that Kmeans performs better than the other heuristics, thus being a good option for mapping processes on many-core architectures with networks-on-chip support.