info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/publishedVersion
Performance analysis of static constraint network partitioning algorithm using multithreads
Carregando...
Notas
Data
Orientadores
Editores
Coorientadores
Membros de banca
Título da Revista
ISSN da Revista
Título de Volume
Editor
Editora da UFLA
Faculdade, Instituto ou Escola
Departamento
Programa de Pós-Graduação
Agência de fomento
Tipo de impacto
Áreas Temáticas da Extenção
Objetivos de Desenvolvimento Sustentável
Dados abertos
Resumo
Abstract
Descrição
The multicore processors can have its processing capacity well used when the applications are implemented in parallel using multithread programming. So, problems which demand high performance capacity and high data quantity can be executed faster. This work presents a performance analyze of a static partitioning algorithm over applications modeled in constraint graphs, named Grouping-Sink [2], in different hardware and software platforms. The sequential algorithm was parallelized using multithreads. The experiments were done over constraint networks. The results show that the parallelization using multithreads can achieve speedups until 473.19, using Linux operating system, with high priority. Besides, the threads scheduling realized by the operating system and the hardware architecture characteristics can affect the execution time of a parallel application.
Área de concentração
Agência de desenvolvimento
Palavra chave
Marca
Objetivo
Procedência
Impacto da pesquisa
Resumen
Palavras-chave
ISBN
DOI
Citação
VEIGA, R. P.; PEREIRA, M. R.; LACERDA, W. S. Performance analysis of static constraint network partitioning algorithm using multithreads. INFOCOMP Journal of Computer Science, Lavras, v. 9, n. 6, p. 34-42, July 2010. Special Issue.