Performance results of running parallel applications on the InteGrade

• Published in: Concurrency and computation Vol. 22; no. 3; pp. 375 - 393
• Main Authors: Cáceres, E. N., Mongelli, H., Loureiro, L., Nishibe, C., Song, S. W.
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Ltd 10-03-2010
• Subjects: 0-1 Knapsack Problem; Algorithms; chain matrix product; Chains; Clusters; Computing time; Grid computing; local sequence alignment problem; Middleware; parallel algorithms; Processors; Running; Wavefronts
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.1524

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 © 2009 John Wiley & Sons, Ltd.