Performance Analysis of Static Constraint Network Partitioning Algorithm using Multithreads
Main Article Content
Abstract
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.
Article Details
How to Cite
Veiga, R. P., Pereira, M. R., & Lacerda, W. S. (2010). Performance Analysis of Static Constraint Network Partitioning Algorithm using Multithreads. INFOCOMP Journal of Computer Science, 9(6), 34–42. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/382
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.