Performance results of running parallel applications on the InteGrade

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.

[1]  Yves Robert,et al.  Algorithmes et architectures systoliques , 1989 .

[2]  S. B. Needleman,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 1989 .

[3]  David Connolly Knapsack Problems: Algorithms and Computer Implementations , 1991 .

[4]  Keqin Li,et al.  Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Jairo Panetta,et al.  Generating Parallel Algorithms for Cluster and Grid Computing , 2005, International Conference on Computational Science.

[6]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

[7]  Sadashiva S. Godbole,et al.  On Efficient Computation of Matrix Chain Products , 1973, IEEE Transactions on Computers.

[8]  Edson Cáceres,et al.  0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation , 2005, IASTED PDCS.

[9]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[10]  Afonso Ferreira,et al.  Fast and Scalable Parallel Algorithms for Knapsack-like Problems , 1996, J. Parallel Distributed Comput..

[11]  Maw-Sheng Chern,et al.  Pipeline architectures for dynamic programming algorithms , 1990, Parallel Comput..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  M. Hung,et al.  A hard knapsack problem , 1988 .

[14]  Torbjørn Rognes,et al.  Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors , 2000, Bioinform..

[15]  Henrique Mongelli,et al.  A Parallel Chain Matrix Product Algorithm on the InteGrade Grid ∗ , 2009 .

[16]  Siang Wun Song,et al.  Performance results of running parallel applications on the InteGrade , 2010 .

[17]  Artur Czumaj Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract) , 1993, STACS.

[18]  Shang-Hua Teng,et al.  Adaptive Parallel Algorithms for Integral Knapsack Problems , 1990, J. Parallel Distributed Comput..

[19]  Fabio Kon,et al.  InteGrade: object‐oriented Grid middleware leveraging the idle computing power of desktop machines , 2004, Concurr. Pract. Exp..

[20]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[21]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[22]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[23]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[24]  José Luis Roda García,et al.  Integral knapsack problems: parallel algorithms and their implementations on distributed systems , 1995, ICS '95.

[25]  Patrice Quinton,et al.  Dynamic programming parallel implementations for the knapsack problem , 1993 .

[26]  Dan I. Moldovan,et al.  Parallel processing - from applications to systems , 1993 .

[27]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[28]  Edson Cáceres,et al.  A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison , 2003, ICCSA.