A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
IEEE Transactions on Computers
MPI: a message passing interface
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
The interaction of parallel and sequential workloads on a network of workstations
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A worldwide flock of Condors: load sharing among workstation clusters
Future Generation Computer Systems - Special issue: resource management in distributed systems
The utility of exploiting idle workstations for parallel computation
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
Linger Longer: fine-grain cycle stealing for networks of workstations
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Distributed Operating Systems: The Logical Design
Distributed Operating Systems: The Logical Design
The MOSIX Distributed Operating System: Load Balancing for UNIX
The MOSIX Distributed Operating System: Load Balancing for UNIX
Batrun: Utilizing Idle Workstations for Large-Scale Computing
IEEE Parallel & Distributed Technology: Systems & Technology
Dynamic balancing complex workload in workstation networks - challenge, concepts and experience
HPCN Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A Comparative Evaluation of Implicit Coscheduling Strategies for Networks of Workstations
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Computer
| Hi-index | 0.02 |
Although individual PCs of a cluster are used by their owners to run sequential applications (local jobs), the cluster as a whole or its subset can also be employed to run parallel applications (cluster jobs) even during working hours. This implies that these computers have to be shared by parallel and sequential applications, which could lead to the improvement of the execution performance and resource utilization. However, there is a lack of experimental study showing the behavior and performance of executing parallel and sequential applications concurrently on a non-dedicated cluster. The result of such research would be beneficial for the development of new global scheduling algorithms. We present the result of an experimental study into scheduling of a mixture of parallel and sequential applications on a non-dedicated cluster. The aim of this study is to learn how the concurrent execution of a communication intensive parallel application and sequential applications influences their execution performance and utilization of the cluster.