scholarly journals Application of a Task Stalling Buffer in Distributed Hybrid Cloud Computing

2021 ◽  
Vol 27 (6) ◽  
pp. 57-65
Author(s):  
Albertas Jurgelevicius ◽  
Leonidas Sakalauskas ◽  
Virginijus Marcinkevicius
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Future Research ◽  
Volunteer Computing ◽  
Hybrid Cloud ◽  
Actual Problem ◽  
Additional Information ◽  
Scheduling Method

The purpose of the research is to create a hybrid cloud platform that performs distributed computing tasks using high-performance servers and volunteer computing resources. The proposed platform uses a new task scheduling method, which is also presented in this paper. It uses a task stalling buffer to manage workload among the two grids without any additional information about the tasks. Since efficient task scheduling in these distributed systems is the actual problem, the system reliability issue is solved using a hybrid cloud architecture when both high-performance servers and volunteer computing resources are combined. The results of the experiment showed that the proposed solution solves the problem of balancing workload between two grids better than the standard scheduling algorithm. Computer study and experiments also showed that the proposed hybrid cloud tasks scheduling method with a task stalling buffer reduces up to 47.3 % of total task execution time. The outcome of this paper provides a background for future research on a task stalling buffer in hybrid cloud computing.

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

2017 ◽  
Vol 31 (19-21) ◽  
pp. 1740050 ◽  
Author(s):  
Wenzheng Zhai ◽  
Yue-Li Hu ◽  
Feng Ran
Keyword(s):  
Task Scheduling ◽  
High Performance ◽  
Directed Acyclic Graph ◽  
Scheduling Algorithm ◽  
Task Assignment ◽  
Distributed Environment ◽  
Computing Environment ◽  
Task Model ◽  
Scheduling Method ◽  
Earliest Finish Time

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

scholarly journals AVAILABILITY EVALUATION OF DIFFERENT PLANNING AND SCHEDULING ALGORITHMS IN HYBRID CLOUD SYSTEM

2020 ◽  
Vol 3 (4) ◽  
pp. 47-59
Author(s):  
Ahmed A. Hamed ◽  
Rabah A. Ahmed
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Hybrid Cloud ◽  
Computing Environment ◽  
Planning And Scheduling ◽  
Cloud Computing Environment ◽  
Individual Level ◽  
The Individual

The importance of hybrid cloud computing has become a reality in recent years for large and medium enterprises and even at the individual level, which increases the need for many improvements in its availability level. One of the most important things that affects availability is the task scheduling process. Task scheduling is subject to many scheduling algorithms and these algorithms differ in terms of performance and purpose, the most important aspects being improved by using an appropriate scheduling algorithm is the total execution time(makespane) and also the success rate and downtime live migration. Because working on a cloud computing environment is costly and complex, we have simulated a hybrid cloud environment using reliable and accurate simulation and used Directed acyclic graph(DAG) as a workflow application. In this paper we will compare scheduling and planning algorithms for cloud computing environment by implementing a framework using (workflowsim) based on (cloudsim) simulator in order to choose the best algorithm to verify the possibility of improving availability.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

scholarly journals ROA-CONS: Raccoon Optimization for Job Scheduling

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2270
Author(s):  
Sina Zangbari Koohi ◽  
Nor Asilah Wati Abdul Hamid ◽  
Mohamed Othman ◽  
Gafurjan Ibragimov
Keyword(s):  
User Satisfaction ◽  
High Performance ◽  
Job Scheduling ◽  
Response Times ◽  
Scheduling Algorithm ◽  
Desktop Computer ◽  
Network Heterogeneity ◽  
Parallel Job Scheduling ◽  
Scheduling Method ◽  
And Performance

High-performance computing comprises thousands of processing powers in order to deliver higher performance computation than a typical desktop computer or workstation in order to solve large problems in science, engineering, or business. The scheduling of these machines has an important impact on their performance. HPC’s job scheduling is intended to develop an operational strategy which utilises resources efficiently and avoids delays. An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. Another problem for parallel job scheduling is user fairness. One of the issues in this field of study is providing a balanced schedule that enhances efficiency and user fairness. ROA-CONS is a new job scheduling method proposed in this paper. It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. This algorithm also proposes a technique of selection that combines job waiting and response time optimisation with user fairness. It contributes to the development of a symmetrical schedule that increases user satisfaction and performance. In comparison with other well-known job scheduling algorithms, the simulation assesses the effectiveness of the proposed method. The results demonstrate that the proposed strategy offers improved schedules that reduce the overall system’s job waiting and response times.

scholarly journals Capacity Preserve Assignment Scheduling Algorithm in context of Determination System for Cloud Computing

2019 ◽  
Vol 8 (2S8) ◽  
pp. 647-650
Keyword(s):  
Cloud Computing ◽  
Information Systems ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Processing Condition ◽  
Feedback Mechanism ◽  
Determination System

Booking figuring is reliably a fervently issue in appropriated processing condition. Remembering the true objective to take out system bottleneck and modify stack logically. A stack changing endeavor booking count in light of weighted self-assertive and input frameworks was proposed in this paperFrom the outset the picked cloud masterminding host picked assets by necessities and made static estimation, and some time later coordinated them; other than the tally picked assets from which composed by weight self-confidently; by then it got standing out powerful data from effect burden to channel and sort the left. Finally it accomplished oneself adaptively to structure stack through information systems. The examination demonstrates that the calculation has stayed away from the framework bottleneck adequately and has accomplished adjusted burden and furthermore self-flexibility to it.keywords: Task Scheduling; Feedback Mechanism; Cloud Computing; Load Balancing

Sign in / Sign up

Export Citation Format

Share Document