Performance results of running parallel applications on the InteGrade


Autoria(s): CACERES, E. N.; MONGELLI, H.; LOUREIRO, L.; NISHIBE, C.; SONG, S. W.
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

20/10/2012

20/10/2012

2010

Resumo

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of running parallel applications with communication among processors on the InteGrade grid. As costly communication on a grid can be prohibitive, we explore the so-called systolic or wavefront paradigm to design the parallel algorithms in which no global communication is used. To evaluate the InteGrade middleware we considered three parallel algorithms that solve the matrix chain product problem, the 0-1 Knapsack Problem, and the local sequence alignment problem, respectively. We show that these three applications running under the InteGrade middleware and MPI take slightly more time than the same applications running on a cluster with only LAM-MPI support. The results can be considered promising and the time difference between the two is not substantial. The overhead of the InteGrade middleware is acceptable, in view of the benefits obtained to facilitate the use of grid computing by the user. These benefits include job submission, checkpointing, security, job migration, etc. Copyright (C) 2009 John Wiley & Sons, Ltd.

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

FAPESP[2004/08928-3]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[55.0895/07-8]

CNPq[30.5362/06-2]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[30.2942/04-1]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[62.0123/04-4]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[48.5460/06-8]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[62.0171/06-5]

FUNDECT[41/100.115/2006]

FUNDECT

Identificador

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, v.22, n.3, Special Issue, p.375-393, 2010

1532-0626

http://producao.usp.br/handle/BDPI/30376

10.1002/cpe.1524

http://dx.doi.org/10.1002/cpe.1524

Idioma(s)

eng

Publicador

JOHN WILEY & SONS LTD

Relação

Concurrency and Computation-practice & Experience

Direitos

restrictedAccess

Copyright JOHN WILEY & SONS LTD

Palavras-Chave #Grid computing #middleware #parallel algorithms #chain matrix product #0-1 Knapsack Problem #local sequence alignment problem #ALGORITHMS #COMPUTATION #SEQUENCE #Computer Science, Software Engineering #Computer Science, Theory & Methods
Tipo

article

original article

publishedVersion