An Heuristic for Bag-of-Tasks Scheduling Problems with Resource Demands and Budget Constraints to Minimize Makespan on Hybrid Clouds

2017 ◽  
Author(s):  
Yi Zhang ◽  
Jin Sun ◽  
Zebin Wu
Keyword(s):  
Budget Constraints ◽  
Scheduling Problems ◽  
Hybrid Clouds ◽  
Tasks Scheduling

Effective Metaheuristic Algorithms for Bag-of-Tasks Scheduling Problems Under Budget Constraints on Hybrid Clouds

2020 ◽  
pp. 2150091
Author(s):  
Linhua Ma ◽  
Chunshan Xu ◽  
Haoyang Ma ◽  
Yujie Li ◽  
Jiali Wang ◽  
...  
Keyword(s):  
Initial Solution ◽  
Metaheuristic Algorithms ◽  
Initial Population ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Task Sequence ◽  
Hybrid Clouds ◽  
Data Intensive ◽  
Communication Time ◽  
The Impact

Cloud computing is an ideal platform for executing bag-of-task (BoT) applications due to its capability of delivering high-quality and pay-per-use computing services. This paper presents a family of genetic algorithm (GA)-based metaheuristics for scheduling the tasks of data-intensive BoT applications on hybrid clouds. The scheduling objective is to minimize the flowtime of BoT applications under a specified budget constraint. We take into account the impact of communication time and communication cost to formulate the optimization model for the data-intensive BoT scheduling problem. By using a task sequence to represent the scheduling solution, the proposed algorithms start with using a low-complexity strategy to generate an initial solution. The generated initial solution is identified as the best chromosome in the initial population of GA framework. We improve the standard crossover operator in GA’s evolutionary procedure by incorporating a probabilistic model. In addition, we design an efficient task dispatching method to evaluate the scheduling quality of each chromosome. Built upon the improved crossover scheme and task dispatching method, the proposed metaheuristic algorithms employ three crossover operators to solve the BoT scheduling problem considered in this work. Extensive experiments are performed to verify the performance of the proposed algorithms in scheduling data-intensive BoT applications.

scholarly journals A Novel Firefly Algorithm for Scheduling Bag-of-Tasks Applications Under Budget Constraints on Hybrid Clouds

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 151888-151901 ◽  
Author(s):  
Yi Zhang ◽  
Junlong Zhou ◽  
Lulu Sun ◽  
Jingjing Mao ◽  
Jin Sun
Keyword(s):  
Firefly Algorithm ◽  
Budget Constraints ◽  
Hybrid Clouds

A Survey of Tasks Scheduling Algorithms in Distributed Computing Systems

2021 ◽  
pp. 1269-1281
Author(s):  
Nutan Kumari Chauhan ◽  
Harendra Kumar
Keyword(s):  
Distributed Computing ◽  
Scheduling Algorithms ◽  
Computing System ◽  
Communication Link ◽  
Scheduling Problems ◽  
Distributed Computing Systems ◽  
Computing Systems ◽  
Tasks Scheduling ◽  
Scheduling Strategies ◽  
User Tasks

Distributed computing system (DCS) is a very popular field of computer science. DCS consists of various computers (processors) located at possibly different sites and connected by a communication link in such a manner that it appears as one system to the user. Tasks scheduling is a very interesting field of research in DCS. The main objectives of tasks scheduling problems are load balancing of processors, maximization of system reliability, minimizing the system cost, and minimizing the response time. Obviously, it is very complicated to satisfy all of the above objectives simultaneously. So, most of the researchers have solved the tasks scheduling problem with one or more objectives. The purpose of this chapter is to produce an overview of much (certainly not all) of tasks scheduling algorithms. The chapter is covering the little much valuable survey, tasks scheduling strategies, and different approaches used for tasks scheduling with one or more objectives.

A Survey of Tasks Scheduling Algorithms in Distributed Computing Systems

2021 ◽  
pp. 233-244
Author(s):  
Nutan Kumari Chauhan ◽  
Harendra Kumar
Keyword(s):  
Distributed Computing ◽  
Scheduling Algorithms ◽  
Computing System ◽  
Communication Link ◽  
Scheduling Problems ◽  
Distributed Computing Systems ◽  
Computing Systems ◽  
Tasks Scheduling ◽  
Scheduling Strategies ◽  
User Tasks

Distributed computing system (DCS) is a very popular field of computer science. DCS consists of various computers (processors) located at possibly different sites and connected by a communication link in such a manner that it appears as one system to the user. Tasks scheduling is a very interesting field of research in DCS. The main objectives of tasks scheduling problems are load balancing of processors, maximization of system reliability, minimizing the system cost, and minimizing the response time. Obviously, it is very complicated to satisfy all of the above objectives simultaneously. So, most of the researchers have solved the tasks scheduling problem with one or more objectives. The purpose of this chapter is to produce an overview of much (certainly not all) of tasks scheduling algorithms. The chapter is covering the little much valuable survey, tasks scheduling strategies, and different approaches used for tasks scheduling with one or more objectives.

Sign in / Sign up

Export Citation Format

Share Document