An Approach to Improve Task Scheduling in a Decentralized Cloud Computing Environment

Cloud computing has emerged as a promising platform that grants users with direct yet shared access to computing resources and services without worrying about the internal complex infrastructure. As a cloud must provide services to many users at the same time and different users have different QoS requirements, the scheduling strategy should be developed for multiple workflows with different QoS requirements.Task scheduling problems are premier which relate to the efficiency of the whole cloud computing facilities. Task scheduling algorithm is an NP- completeness problem which play key role in cloud computing. The paper deals with Multiple QoS Constrained Scheduling Strategy of Multi-Workflows to address this problem. The proposed strategy can schedule multiple workflows which are started at any time and the QoS requirements are taken into account and are able to increase the scheduling success rate significantly in a decentralized environment.

[1]  Francine Berman,et al.  A study of deadline scheduling for client-server systems on the Computational Grid , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[2]  Xiao Zhi An Optimization Method of Workflow Dynamic Scheduling Based on Heuristic GA , 2007 .

[3]  Rajkumar Buyya,et al.  Workflow scheduling algorithms for grid computing , 2008 .

[4]  David P. Anderson,et al.  Local Scheduling for Volunteer Computing , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Hai Jin,et al.  A throughput maximization strategy for scheduling transaction‐intensive workflows on SwinDeW‐G , 2008, Concurr. Comput. Pract. Exp..

[7]  Subhash Saini,et al.  Agent-based grid load balancing using performance-driven task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[8]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

[9]  Larry Carter,et al.  Centralized versus Distributed Schedulers for Bag-of-Tasks Applications , 2008, IEEE Transactions on Parallel and Distributed Systems.

[10]  Dror G. Feitelson,et al.  On Simulation and Design of Parallel-Systems Schedulers: Are We Doing the Right Thing? , 2009, IEEE Transactions on Parallel and Distributed Systems.

[11]  Bobby Bhattacharjee,et al.  Trade-offs in matching jobs and balancing load for distributed desktop grids , 2008, Future Gener. Comput. Syst..

[12]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[13]  David Abramson,et al.  Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost–time optimization algorithm , 2005, Softw. Pract. Exp..

[14]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[15]  Albert Y. Zomaya,et al.  Observations on Using Genetic Algorithms for Dynamic Load-Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[16]  Jinjun Chen,et al.  A throughput maximization strategy for scheduling transaction-intensive workflows on SwinDeW-G , 2008 .

[17]  David Abramson,et al.  High performance parametric modeling with Nimrod/G: killer application for the global grid? , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[18]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[19]  Virginia Mary Lo,et al.  WaveGrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[20]  Arun K. Somani,et al.  CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[21]  Francisco Vilar Brasileiro,et al.  Bridging the High Performance Computing Gap: the OurGrid Experience , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[22]  Weisong Shi,et al.  A Planner-Guided Scheduling Strategy for Multiple Workflow Applications , 2008, 2008 International Conference on Parallel Processing - Workshops.

[23]  Dror G. Feitelson,et al.  A case for conservative workload modeling: Parallel job scheduling with daily cycles of activity , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

[24]  Yong Zhao,et al.  Falkon: a Fast and Light-weight tasK executiON framework , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).