Task partitioning, scheduling and load balancing strategy for mixed nature of tasks

Load balancing and task partitioning are important components of distributed computing. The optimum performance from the distributed computing system is achieved by using effective scheduling and load balancing strategy. Researchers have well explored CPU, memory, and I/O-intensive tasks scheduling, and load balancing techniques. But one of the main obstacles of the load balancing technique leads to the ignorance of applications having a mixed nature of tasks. This is because load balancing strategies developed for one kind of job nature are not effective for the other kind of job nature. We have proposed a load balancing scheme in this paper, which is known as Mixed Task Load Balancing (MTLB) for Cluster of Workstation (CW) systems. In our proposed MTLB strategy, pre-tasks are assigned to each worker by the master to eliminate the worker’s idle time. A main feature of MTLB strategy is to eradicate the inevitable selection of workers. Furthermore, the proposed MTLB strategy employs Three Resources Consideration (TRC) for load balancing (CPU, Memory, and I/O). The proposed MTLB strategy has removed the overheads of previously proposed strategies. The measured results show that MTLB strategy has a significant improvement in performance.

[1]  Marianne Winslett,et al.  Exploiting local data in parallel array I/O on a practical network of workstations , 1997, IOPADS '97.

[2]  Jingwen Wang,et al.  Utopia: A load sharing facility for large, heterogeneous distributed computer systems , 1993, Softw. Pract. Exp..

[3]  Haroon Rasheed,et al.  Optimal job packing, a backfill scheduling optimization for a cluster of workstations , 2009, The Journal of Supercomputing.

[4]  Peter Scheuermann,et al.  File Assignment in Parallel I/O Systems with Minimal Variance of Service Time , 2000, IEEE Trans. Computers.

[5]  Volker Strumpen,et al.  Efficient Parallel Computing in Distributed Workstation Environments , 1993, Parallel Comput..

[6]  Xiao Qin,et al.  Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters , 2008, J. Netw. Comput. Appl..

[7]  Noah Treuhaft,et al.  Cluster I/O with River: making the fast case common , 1999, IOPADS '99.

[8]  Kalim Qureshi,et al.  A COMPARATIVE STUDY OF PARALLELIZATION STRATEGIES FOR FRACTAL IMAGE COMPRESSION ON A CLUSTER OF WORKSTATIONS , 2008 .

[9]  Paul D. Manuel,et al.  Empirical performance evaluation of schedulers for cluster of workstations , 2010, Cluster Computing.

[10]  Marianne Winslett,et al.  Faster collective output through active buffering , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[11]  Anand Sivasubramaniam,et al.  Gang Scheduling Extensions for I/O Intensive Workloads , 2003, JSSPP.

[12]  D. W. Duke,et al.  Research toward a heterogeneous networked computing cluster , 1998 .

[13]  Xiao Qin,et al.  Dynamic Load Balancing for I/O- and Memory-Intensive Workload in clusters Using a Feedback Control Mechanism , 2003, Euro-Par.