Task scheduling is an important component of parallel and distributed computing. Therefore, it is of theoretical significance and practical value to develop an effective task scheduling algorithm and implement it. For the task scheduling in cloud computing environment, it means that a group of tasks consisting a working load are distributed to a number of computational nodes as per certain implementing time sequence based on scheduling discipline and strategy to short the time needed by the whole task scheduling and to achieve good implementation performance. Divisible task scheduling is one of the important roles in the parallel computation and distributed computation. In this paper, we studies on a classical algorithm: Uniform Multi-Round (UMR), based on which an improved multi-path divisible task scheduling algorithm: MSUMR (Master Service Uniform Multi-Round) Algorithm is proposed. Such an algorithm could not only ensure the scheduling efficiency when the bandwidth is sufficient but also maximizes the computing efficiency of working node when the available bandwidth is limited. According to the experimental result, this algorithm, compared with such scheduling algorithms as UMR, Multi-Installment (MI) and eXtended Multi-Installment (XMI), is improved in the two aspects of dividing algorithm and task allocation principles, thus short down the number of unused computing nodes during task implementation and making full use of computing resources, indicating batter practical application value.
LiK., TangX. and LiK., Energy-efficient stochastic task scheduling on heterogeneous computing systems, IEEE Transactions on Parallel and Distributed Systems25(11) (2014), 2867–2876.
2.
XuY., LiK., HeL. and ZhangL., A hybrid chemical reaction optimization scheme for task scheduling on heterogeneous computing systems, IEEE Transactions on Parallel and Distributed Systems26(12) (2014), 1–1.
3.
ZhangL., LiK., XuY., MeiJ., ZhangF. and LiK., Maximizing reliability with energy conservation for parallel task scheduling in a heterogeneous cluster, Information Sciences319 (2015), 113–131.
4.
LinW., LiangC., WangJ.Z. and BuyyaR., Bandwidth-aware divisible task scheduling for cloud computing, Software Practice and Experience44(2) (2014), 163ĺC174.
IosupA., OstermannS., YigitbasiN., ProdanR., FahringerT. and EpemaD., Performance analysis of cloud computing services for many-tasks scientific computing, IEEE Transactions on Parallel and Distributed Systemspp(6) (2011), 931–945.
7.
ShihC.-S., ChenJ., WangY.-H. and ChangN., Heterogeneous and elastic computation framework for mobile cloud computing, International Journal of Software Engineering and Knowledge Engineering24(7) (2014), 1013–1037.
8.
WangQ., WangC., RenK., LouW. and LiJ., Enabling public auditability and data dynamics for storage security in cloud computing, IEEE Transactions on Parallel and Distributed Systems22(5) (2010), 847–859.
9.
TongZ., XiaoZ., LiK. and LiK., Proactive scheduling in distributed computing a¸ła reinforcement learning approach, Journal of Parallel and Distributed Computing74(7) (2014), 2662–2672.
10.
GargS.K., YeoC.S., AnandasivamA. and BuyyaR., Environment-conscious scheduling of hpc applications on distributed cloud-oriented data centers, Journal of Parallel and Distributed Computing71(6) (2011), 732–749.
11.
KenliL.I., TongZ., LiuD., TesfazghiT. and LiaoX., A ptspgats based approach for data-intensive scheduling in data grids, Frontiers of Computer Science in China5(4) (2011), 513–525.
12.
CastilloC., RouskasG.N. and HarfoushK., On the design of online scheduling algorithms for advance reservations and qos in grids, in Parallel and Distributed Processing Symposium, 2007 IPDPS 2007 IEEE International, 2007, p. 36–.
13.
LiC. and LiL., Utility-based qos optimisation strategy for multi-criteria scheduling on the grid,, Journal of Parallel and Distributed Computing67(2) (2007), 142ĺC153.
14.
TongZ., LiK., XiaoZ. and QinX., A qos scheduling scheme with availability constraint in distributed systems, in Proceedings of the 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2012, pp. 481–486.
15.
KhiyaitaA., ZbakhM., El BakkaliH. and El KettaniD, Load balancing cloud computing: State of art, pp, in Network Security and Systems (JNS2), 2012 National Days of (2012), 106–109.
16.
PaulM., SamantaD. and SanyalG., Dynamic job scheduling in cloud computing based on horizontal load balancing, International Journal of Computer Technology and Applications2(5) (2011), 220–224.
17.
DhineshB.L.D. and KrishnaP.V., Honey bee behor inspired load balancing of tasks in cloud computing environments, Applied Soft Computing13(5) (2013), 2292–2303avi.
18.
LiK., WangY. and LiuM., A non-cooperative game model for reliability-based task scheduling in cloud computing, Eprint Arxiv (2014), 1–20.
19.
BelalemG. and BouamamaS., The new economic environment to manage resources in cloud computing, Journal of Information Technology Research8(2) (2015), 34–49.
20.
IansitiM. and RichardsG.L., A study of economic impact of cloud computing, International Journal of Technology Policy and Management12(29) (2012), 344–372.
21.
YangY., RaadtK.V.D. and CasanovaH., Multiround algorithms for scheduling divisible loads, IEEE Transactions on Parallel and Distributed Systems16(11) (2005), 1092–1102.
22.
WarnekeD. and KaoO., Exploiting dynamic resource allocation for efficient parallel data processing in the cloud, IEEE Transactions on Parallel and Distributed Systems22(6) (2011), 985–997.
23.
KansalN.J. and ChanaI., Artificial bee colony based energyaware resource utilization technique for cloud computing, Concurrency and Computation Practice and Experience27 (2014), 1207–1225.
24.
KhazaeiH., MisicJ. and MisicV.B., Performance analysis of cloud computing centers using m/g/m/m+r queuing systems, IEEE Transactions on Parallel and Distributed Systems23(5) (2012), 1–1.
25.
LuoJ., RosenbergC. and GirardA., Engineering wireless mesh networks: Joint scheduling, routing, power control, and rate adaptation, Networking IEEE/ACM Transactions on18(5) (2010), 1387–1400.
26.
Adler, Rosenberg, Sitaramanand Unger, Scheduling timeconstrained communication in linear networks, Theory of Computing Systems35(6) (2008), 599–623.
27.
BharadwajV., GhoseD. and RobertazziT.G., Divisible load theory: A new paradigm for load scheduling in distributed systems, Cluster Computing6(1) (2003), 7–17.
28.
LiK., TangX., VeeravalliB. and LiK., Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems, IEEE Transactions on Computers64(1) (2015), 191–204.
29.
XiaoyongT., LiK., ZengZ. and VeeravalliB., A novel security-driven scheduling algorithm for precedenceconstrained tasks in heterogeneous distributed systems, IEEE Transactions on Computers60(7) (2011), 1017–1029.
30.
WangL., Von LaszewskiG., KunzeM and TaoJ, Schedule distributed virtual machines in a service oriented environment, in IEEE International Conference on Advanced Information Networking and Applications. 2010, pp. 230–236.
31.
BeaumontO., EyraudduboisL. and AgrawalS.K., Broadcasting on large scale heterogeneous platforms under the bounded multi-port model, Parallel and Distributed Systems IEEE Transactions on25(10) (2011), 173–180.
32.
BeaumontO., BonichonN. and Eyraud-DuboisL., Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model, in Parallel and Distributed Processing Symposium, International, 2008, pp. 1–7.
