scholarly journals Task Scheduling Management for Load Balancing Using Task Grouping Based on Cloud Computing

2021 ◽  
Vol 9 (3) ◽  
Author(s):  
Ahmad Helmi Abdul Halim ◽  
Asif Iqbal Hajamydeen
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Turnaround Time ◽  
Task Management ◽  
Queuing Model ◽  
Context Switching ◽  
Scheduling Model ◽  
Complex Procedure ◽  
Scheduling Management ◽  
Better Than

Managing task scheduling management in cloud computing is an essential part for the landscape of complex procedure tasks based on various resources in a proficient and scalable path. The aim of this research is to dynamically optimize the aforesaid issue of task scheduling. The task management improvises the imperfection algorithm by pursue on weighted fair queuing model, which is significantly effective compared to the existing method. A task scheduling model has been created to demonstrate the proposed scheduler management. Study shows the improvement in the adaptation of round robin and shortest job first algorithm performing better than the existing algorithm according to the differentiate execution measurements such as, turnaround time, task size and average waiting time. In addition, context switches play an important role in algorithm by sharing between multiple tasks and running task in the scheduler. Altogether, a significant improvement between existing algorithm and proposed studies follows up accordingly to a specific context switching takes place.

scholarly journals Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling

Computers ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 63
Author(s):  
Fahd Alhaidari ◽  
Taghreed Zayed Balharith
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Role ◽  
Turnaround Time ◽  
Round Robin ◽  
Computing Systems ◽  
Time Quantum ◽  
Dynamic Time ◽  
High Level ◽  
Level Performance

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.

scholarly journals Enhancing the Distribution of Idle Cost for Scheduling Tasks without Setup Cost in Cloud Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Redwan A. Al-dilami ◽  
Ammar T. Zahary ◽  
Adnan Z. Al-Saqqaf
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Setup Time ◽  
Setup Cost ◽  
Idle State ◽  
The Cost ◽  
Computing Infrastructure ◽  
Better Than

Issues of task scheduling in the centre of cloud computing are becoming more important, and the cost is one of the most important parameters used for scheduling tasks. This study aims to investigate the problem of online task scheduling of the identified job of MapReduce on cloud computing infrastructure. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) that need to be activated earlier and run continuously, and booting a VM requires a constant setup time. A VM that remains running even though it is no longer used is considered an idle VM. Furthermore, this study aims to distribute the idle cost of the VMs rather than the cost of setting up them among tasks in a fair manner. This study also is an extension of previous studies which solved the problems that occurred when distributing the idle cost and setting up the cost of VMs among tasks. It classifies the tasks into three groups (long, mid, and short) and distributes the idle cost among the groups then among the tasks of the groups. The main contribution of this paper is the developing of a clairvoyant algorithm that addressed important factors such as the delay and the cost that occurred by waiting to setup VM (active VM). Also, when the VMs are run continually and some VMs become in idle state, the idle cost will be distributed among the current tasks in a fair manner. The results of this study, in comparison with previous studies, showed that the idle cost and the setup cost that was distributed among tasks were better than the idle cost and the setup cost distributed in those studies.

scholarly journals HAMM: A Hybrid Algorithm of Min-Min and Max-Min Task Scheduling Algorithms in Cloud Computing

2020 ◽  
Vol 9 (4) ◽  
pp. 209-218
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Hybrid Algorithm ◽  
Heuristic Algorithms ◽  
Scheduling Algorithms ◽  
Cloud Computing Environment ◽  
Concurrent Execution ◽  
Optimization Parameters ◽  
Better Than

Nowadays, with the huge development of information and computing technologies, the cloud computing is becoming the highly scalable and widely computing technology used in the world that bases on pay-per-use, remotely access, Internet-based and on-demand concepts in which providing customers with a shared of configurable resources. But, with the highly incoming user’s requests, the task scheduling and resource allocation are becoming major requirements for efficient and effective load balancing of a workload among cloud resources to enhance the overall cloud system performance. For these reasons, various types of task scheduling algorithms are introduced such as traditional, heuristic, and meta-heuristic. A heuristic task scheduling algorithms like MET, MCT, Min-Min, and Max-Min are playing an important role for solving the task scheduling problem. This paper proposes a new hybrid algorithm in cloud computing environment that based on two heuristic algorithms; Min-Min and Max-Min algorithms. To evaluate this algorithm, the Cloudsim simulator has been used with different optimization parameters; makespan, average of resource utilization, load balancing, average of waiting time and concurrent execution between small length tasks and long size tasks. The results show that the proposed algorithm is better than the two algorithms Min-Min and Max-Min for those parameters

scholarly journals Dynamic PSO for Task Scheduling Optimization in Cloud Computing

2019 ◽  
Vol 8 (2S11) ◽  
pp. 332-338
Keyword(s):  
Cloud Computing ◽  
Particle Swarm Optimization ◽  
Task Scheduling ◽  
Execution Time ◽  
Pso Algorithm ◽  
Turnaround Time ◽  
Bandwidth Utilization ◽  
Scheduling Optimization ◽  
Swarm Optimization ◽  
Memory Utilization

Task scheduling is still a challenge in cloud computing as no existing scheduling algorithms are not effectively provisioning and scheduling the resources in the cloud. Existing authors considered only metrics like makespan, execution time and turnaround time etc. and the previous authors concentrated only to optimize the above mentioned metrics. But no existing authors were considered about the effective provisioning of the resources in the cloud i.e, compute, storage and network capacities and still many resources in the cloud were underutilized. In this paper, we want to propose an algorithm which can effectively utilize the resources in the cloud by extending Particle Swarm Optimization by addressing the metrics Bandwidth utilization and Memory utilization particularly. We have simulated this algorithm by using cloudsim and compared the modified Dynamic PSO with the PSO algorithm and it outperforms in terms of Bandwidth and Memory utilization and the makespan is also optimized.

scholarly journals Task scheduling algorithm based on multi criteria decision making method for cloud computing environment: TSABMCDMCCE

2019 ◽  
Vol 9 (1) ◽  
pp. 279-291 ◽  
Author(s):  
Proshikshya Mukherjee ◽  
Prasant Kumar Pattnaik ◽  
Tanmaya Swain ◽  
Amlan Datta
Keyword(s):  
Decision Making ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Multi Criteria Decision Making ◽  
Cloud Environment ◽  
Computing Environment ◽  
Queuing Model ◽  
Cloud Computing Environment ◽  
Task Scheduling Algorithm

AbstractThis Paper focuses on multi-criteria decision making techniques (MCDMs), especially analytical networking process (ANP) algorithm to design a model in order to minimize the task scheduling cost during implementation using a queuing model in a cloud environment and also deals with minimization of the waiting time of the task. The simulated results of the algorithm give better outcomes as compared to other existing algorithms by 15 percent.

scholarly journals A Parallel Particle Swarm Optimisation for Selecting Optimal Virtual Machine on Cloud Environment

2020 ◽  
Vol 10 (18) ◽  
pp. 6538
Author(s):  
Ahmed Abdelaziz ◽  
Maria Anastasiadou ◽  
Mauro Castelli
Keyword(s):  
Cloud Computing ◽  
Execution Time ◽  
Virtual Machines ◽  
Particle Swarm ◽  
Healthcare Services ◽  
Turnaround Time ◽  
Particle Swarm Optimisation ◽  
Medical Applications ◽  
Implementation Time ◽  
Better Than

Cloud computing has a significant role in healthcare services, especially in medical applications. In cloud computing, the best choice of virtual machines (Virtual_Ms) has an essential role in the quality improvement of cloud computing by minimising the execution time of medical queries from stakeholders and maximising utilisation of medicinal resources. Besides, the best choice of Virtual_Ms assists the stakeholders to reduce the total execution time of medical requests through turnaround time and maximise CPU utilisation and waiting time. For that, this paper introduces an optimisation model for medical applications using two distinct intelligent algorithms: genetic algorithm (GA) and parallel particle swarm optimisation (PPSO). In addition, a set of experiments was conducted to provide a competitive study between those two algorithms regarding the execution time, the data processing speed, and the system efficiency. The PPSO algorithm was implemented using the MATLAB tool. The results showed that the PPSO algorithm gives accurate outcomes better than the GA in terms of the execution time of medical queries and efficiency by 3.02% and 37.7%, respectively. Also, the PPSO algorithm has been implemented on the CloudSim package. The results displayed that the PPSO algorithm gives accurate outcomes better than default CloudSim in terms of final implementation time of medicinal queries by 33.3%. Finally, the proposed model outperformed the state-of-the-art methods in the literature review by a range from 13% to 67%.

scholarly journals Dynamic Security Exchange Scheduling Model for Business Workflow Based on Queuing Theory in Cloud Computing

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Rongbin Xu ◽  
Jianguo Wu ◽  
Yongliang Cheng ◽  
Zhiqiang Liu ◽  
Yuanmo Lin ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Dynamic Process ◽  
Queuing Theory ◽  
Business Processes ◽  
Virtual Machines ◽  
Service Discipline ◽  
Security Issue ◽  
Queuing Model ◽  
Scheduling Model ◽  
Cloud Resources

With the rapid development of e-business, large volume of business processes need to be handled in a constrained time. There is always a security issue related to on-time completion in many applications in the economic fields. So, how to effectively manage and organize business processes became very important. By using cloud computing, instance-intensive processes can be handled more effectively by applying just-right virtual machines. Hence, the management of cloud resources became an important issue that many researchers focus on to fully utilize the advantage of cloud. In this paper, we mainly discuss the queuing theory and put forward our novel dynamic process scheduling model based on queuing theory, which is named M/G/k/l-P for business processes. This model can solve the issue of allocating appropriate number of cloud resources based on the number of tasks and execution stages to ensure whether the numbers of cloud resources are sufficient and adequate or not, which can improve the security issue for business process. The service discipline in our model can provide a dynamic process by setting different priorities to improve the experience of users. Evaluations prove that the queuing model of M/G/k/l-P can work very well for business workflow scheduling.

Sign in / Sign up

Export Citation Format

Share Document