New method for scheduling heterogeneous multi-installment systems

Since the past decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computations is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is a proposed method for scheduling data distribution in parallel or distributed systems. Many studies have been done in this field but only a few articles about distributing data in a heterogeneous multi-installment system can be found. In this paper, we present some closed-form formulas for the different steps of scheduling jobs in a heterogeneous multi-installment system (finding the proper number of processors, the proper number of installments, closed-form formula for scheduling internal installments and closed-form formula for scheduling last installment). Two different systems are studied: Computation-Based Systems and Communication-Based Systems. The results of our experiments show that both methods gave better performances than the previous methods (Hsu et al.'s method and Beaumont et al.'s method) and the Communication-Based method has a smaller response time than the Computation-Based method.

[1]  Shang Mingsheng Optimal algorithm for scheduling large divisible workload on heterogeneous system , 2008 .

[2]  Maciej Drozdowski,et al.  Multi‐installment divisible load processing in heterogeneous distributed systems , 2007, Concurr. Comput. Pract. Exp..

[3]  Henri Casanova,et al.  Multiround algorithms for scheduling divisible loads , 2005, IEEE Transactions on Parallel and Distributed Systems.

[4]  DongWoo Lee,et al.  Inter-round Scheduling for Divisible Workload Applications , 2005, ICA3PP.

[5]  Shang Mingsheng,et al.  Optimal multi-installments algorithm for divisible load scheduling , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[6]  Pawel Wolniewicz,et al.  Optimum divisible load scheduling on heterogeneous stars with limited memory , 2006, Eur. J. Oper. Res..

[7]  Jitender S. Deogun,et al.  Multi-round real-time divisible load scheduling for clusters , 2008, HiPC'08.

[8]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[9]  Hamidah Ibrahim,et al.  A New Algorithm for Divisible Load Scheduling with Different Processor Available Times , 2010, ACIIDS.

[10]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[11]  Hyoung Joong Kim A Novel Optimal Load Distribution Algorithm for Divisible Loads , 2004, Cluster Computing.

[12]  Henri Casanova,et al.  UMR: a multi-round algorithm for scheduling divisible workloads , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[13]  Mohamed Othman,et al.  Categorizing DLT researches and its applications , 2009 .

[14]  Ching-Hsien Hsu,et al.  On improving resource utilization and system throughput of master slave job scheduling in heterogeneous systems , 2008, The Journal of Supercomputing.

[15]  Arnaud Legrand,et al.  On the Complexity of Multi-Round Divisible Load Scheduling , 2007 .

[16]  Hiroshi Yamamoto,et al.  Parallel Transferable Uniform Multi-round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload , 2005, HPCC.

[17]  Hiroshi Yamamoto,et al.  A Parallel Transferable Uniform Multi-Round Algorithm in Heterogeneous Distributed Computing Environment , 2006, HPCC.

[18]  Maciej Drozdowski,et al.  Scheduling multiple divisible loads in homogeneous star systems , 2008, J. Sched..

[19]  Yves Robert,et al.  The Master-Slave Paradigm with Heterogeneous Processors , 2001, CLUSTER.

[20]  Hamidah Ibrahim,et al.  A new method for job scheduling in a non-dedicated heterogeneous system , 2011, WCIT.