Efficient scheduling of MPI applications on networks of workstations

Abstract The availability of a large number of workstations connected through a network can represent an attractive option for high-performance computing for many applications. The message-passing interface (MPI) software environment is an effort from many organisations to define a de facto message-passing standard. In other words, the original specification was not designed as a comprehensive parallel programming environment and some researchers agree that the standard should be preserved as simple and clean as possible. Nevertheless, a software environment such as MPI should have somehow a scheduling mechanism for the effective submission of parallel applications on network of workstations. This paper presents an alternative lightweight approach called Selective-MPI (S-MPI), which was designed to enhance the efficiency of the scheduling of applications on an MPI implementation environment.

[1]  Dirk Roose,et al.  The Argonne/GMD macros in FORTRAN for portable parallel programming and their implementation on the Intel iPSC/2 , 1990, Parallel Comput..

[2]  Mario Gerla,et al.  Queueing Network Models for Load Balancing in Distributed Systems , 1991, J. Parallel Distributed Comput..

[3]  F. Tandiary,et al.  Batrun: utilizing idle workstations for large scale computing , 1996, IEEE Parallel Distributed Technol. Syst. Appl..

[4]  Ewing Lusk,et al.  Studying parallel program behavior with upshot , 1991 .

[5]  Alexander Reinefeld,et al.  MARS - A framework for minimizing the job execution time in a metacomputing environment , 1996, Future Gener. Comput. Syst..

[6]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[7]  Jehoshua Bruck,et al.  The IBM External User Interface for Scalable Parallel Systems , 1994, Parallel Comput..

[8]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[9]  M. J. Quinn,et al.  Parallel Computing: Theory and Practice , 1994 .

[10]  Ed Zaluska,et al.  Enhanced MPI on Workstation Clusters , 1997 .

[11]  Marvin Theimer,et al.  Finding Idle Machines in a Workstation-Based Distributed System , 1989, IEEE Trans. Software Eng..

[12]  Peter M. A. Sloot,et al.  A dynamic load balancing system for parallel cluster computing , 1996, Future Gener. Comput. Syst..

[13]  Anthony Skjellum,et al.  Using MPI - portable parallel programming with the message-parsing interface , 1994 .

[14]  Miron Livny,et al.  Interfacing Condor and PVM to harness the cycles of workstation clusters , 1996, Future Gener. Comput. Syst..

[15]  D. Freedman Experience Building a Process Migration Subsystem for UNIX , 1991, USENIX Winter.

[16]  Miron Livny,et al.  Experience with the Condor distributed batch system , 1990, IEEE Workshop on Experimental Distributed Systems.

[17]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[18]  Jonathan Walpole,et al.  MPVM: A Migration Transparent Version of PVM , 1995, Comput. Syst..

[19]  Nicholas Carriero,et al.  Matching Language and Hardware for Parallel Computation in the Linda Machine , 1988, IEEE Trans. Computers.