A study of the concurrent execution of parallel and sequential applications on a non-dedicated cluster

Computers of a non-dedicated cluster are often idle (users attend meetings, have lunch or coffee breaks) or lightly loaded (users carry out simple computations to support problem solving activities). These underutilised computers can be employed to execute parallel applications. Thus, these computers can be shared by parallel and sequential applications, which could lead to the improvement of their execution performance. However, there is a lack of experimental study showing the applications' performance and the system utilization of executing parallel and sequential applications concurrently and concurrent execution of multiple parallel applications on a non-dedicated cluster. Here we present the result of an experimental study into load balancing based scheduling of mixtures of NAS Parallel Benchmarks and BYTE sequential applications on a very low cost non-dedicated cluster. This study showed that the proposed sharing provided performance boost as compared to the execution of the parallel load in isolation on a reduced number of computers and better cluster utilization. The results of this research were used not only to validate other researchers' result generated by simulation but also to support our research mission of widening the use of non-dedicated clusters. Our promising results obtained could promote further research studies to convince universities, business and industry, which require a large amount of computing resources, to run parallel applications on their already owned non-dedicated clusters.

[1]  Larry Rudolph,et al.  Gang Scheduling Performance Benefits for Fine-Grain Synchronization , 1992, J. Parallel Distributed Comput..

[2]  Adam K. L. Wong,et al.  The performance of a parallel communication-bound application and sequential applications executing concurrently on a cluster -a case study , 2004 .

[3]  Andrzej M. Goscinski,et al.  Concurrent Execution of Multiple NAS Parallel Programs on a Cluster , 2005, International Conference on Computational Science.

[4]  Wolfgang Becker.  Dynamic balancing complex workload in workstation networks - challenge, concepts and experience , 1995, HPCN Europe.

[5]  Richard P. Brent,et al.  Effective scheduling in a mixed parallel and sequential computing environment , 1998, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -.

[6]  Greg Burns,et al.  LAM: An Open Cluster Environment for MPI , 2002 .

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

[8]  Andrzej M. Goscinski,et al.  Scheduling of a Parallel Computation-Bound Application and Sequential Applications Executing Concurrently on a Cluster - A Case Study , 2004, ISPA.

[9]  Amnon Barak,et al.  The MOSIX Distributed Operating System: Load Balancing for UNIX , 1993 .

[10]  Joel H. Saltz,et al.  The utility of exploiting idle workstations for parallel computation , 1997, SIGMETRICS '97.

[11]  Andrea C. Arpaci-Dusseau,et al.  Building MPI for Multi-Programming Systems Using Implicit Information , 1999, PVM/MPI.

[12]  Cosimo Anglano.  A comparative evaluation of implicit coscheduling strategies for networks of workstations , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[13]  Andrzej M. Goscinski,et al.  Distributed operating systems - the logical design , 1991 .

[14]  Mauricio Hanzich,et al.  A Space and Time Sharing Scheduling Approach for PVM Non-dedicated Clusters , 2005, PVM/MPI.

[15]  Robert P. Colwell.  Benchmarketing competition , 2003, Computer.

[16]  Andrzej M. Goscinski,et al.  Performance evaluation of the concurrent execution of NAS parallel benchmarks with BYTE sequential benchmarks on a cluster , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[17]  Peter Strazdins,et al.  Local Scheduling out-performs Gang Scheduling on a Beowulf Cluster , 2004 .

[18]  Mauricio Hanzich,et al.  Coscheduling and Multiprogramming Level in a Non-dedicated Cluster , 2004, PVM/MPI.

[19]  Jeffrey K. Hollingsworth,et al.  Fine-Grain Cycle Stealing for Networks of Workstations , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[20]  Ahmad Faraj,et al.  Communication Characteristics in the NAS Parallel Benchmarks , 2002, IASTED PDCS.

[21]  Jaspal Subhlok,et al.  Characterizing NAS benchmark performance on shared heterogeneous networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[22]  Nian-Feng Tzeng,et al.  A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers , 1992, IEEE Trans. Computers.

[23]  Jack Dongarra,et al.  Recent Advances in Parallel Virtual Machine and Message Passing Interface, 15th European PVM/MPI Users' Group Meeting, Dublin, Ireland, September 7-10, 2008. Proceedings , 2008, PVM/MPI.

[24]  Yahui Zhu,et al.  Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..

[25]  Andrea C. Arpaci-Dusseau,et al.  The interaction of parallel and sequential workloads on a network of workstations , 1995, SIGMETRICS '95/PERFORMANCE '95.

[26]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..