scholarly journals Quality of Service based Task Scheduling Algorithms in Cloud Computing

Author(s):  
Sirisha Potluri ◽  
Katta Subba Rao

<p>In cloud computing resources are considered as services hence utilization of the resources in an efficient way is done by using task scheduling and load balancing. Quality of service is an important factor to measure the trustiness of the cloud. Using quality of service in task scheduling will address the problems of security in cloud computing. This paper studied quality of service based task scheduling algorithms and the parameters used for scheduling. By comparing the results the efficiency of the algorithm is measured and limitations are given. We can improve the efficiency of the quality of service based task scheduling algorithms by considering these factors arriving time of the task, time taken by the task to execute on the resource and the cost in use for  the communication.</p>

2020 ◽  
Vol 178 ◽  
pp. 375-385
Author(s):  
Ismail Zahraddeen Yakubu ◽  
Zainab Aliyu Musa ◽  
Lele Muhammed ◽  
Badamasi Ja’afaru ◽  
Fatima Shittu ◽  
...  

2019 ◽  
Vol 16 (2) ◽  
pp. 764-767
Author(s):  
P. Chitra ◽  
Karthika D. Renuka ◽  
K. Senathipathi ◽  
S. Deepika ◽  
R. Geethamani

Cloud computing is the cutting edge technology in the information field to provide services to the users over the internet through web–based tools and applications. One of the major aspects of cloud computing is load balancing. Challenges like Quality of service (QoS) metrics and resource utilization can be improved by balancing the load in cloud environment. Specific scheduling criteria can be applied using load balancing for users prioritization. This paper surveys different load balancing algorithms. The approaches that are existing are discussed and analyzed to provide fair load balancing and also a comparative analysis was presented for the performance of the existing different load balancing schemes.


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


2021 ◽  
Author(s):  
Jianying Miao

This thesis describes an innovative task scheduling and resource allocation strategy by using thresholds with attributes and amount (TAA) in order to improve the quality of service of cloud computing. In the strategy, attribute-oriented thresholds are set to decide on the acceptance of cloudlets (tasks), and the provisioning of accepted cloudlets on suitable resources represented by virtual machines (VMs,). Experiments are performed in a simulation environment created by Cloudsim that is modified for the experiments. Experimental results indicate that TAA can significantly improve attribute matching between cloudlets and VMs, with average execution time reduced by 30 to 50% compared to a typical non-filtering policy. Moreover, the tradeoff between acceptance rate and task delay, as well as between prioritized and non-prioritized cloudlets, may be adjusted as desired. The filtering type and range and the positioning of thresholds may also be adjusted so as to adapt to the dynamically changing cloud environment.


2014 ◽  
Vol 538 ◽  
pp. 512-515
Author(s):  
Feng Song Li ◽  
Yuan Sheng Lou

For the issues of quality of service (QoS) in the cloud computing raised by users, this paper proposes a strategy for QoS classification and builds tasks' priority function modeling and through priority scheduling tasks, assigning tasks to the reasonable resources, and finally to complete the task efficiently, improve the utilization of resources.


Author(s):  
Er. Ruchi ◽  
Harish Kumar

Cloud computing is referred to as biggest technology of today’s environment that provide access to distributed resources on the basis of pay-per-use. Everyone try to use cloud to reduce the cost and maintenance of infrastructure due to which lots of load is increasing day by day. Therefore, there is need to balance that load since resources of cloud are limited but usage is increasing at every moment. This paper discuss how the resources are allocated and how the tasks are scheduled among those resources. Task scheduling mainly focuses on enhancing the utilization of resources and hence reduction in response time. There are various static and dynamic load balancing algorithms to balance the load, this paper discusses comparative study of these algorithms.


2020 ◽  
Vol 8 (5) ◽  
pp. 3193-3196

Task scheduling in cloud is the process of allocating a resource to a task at specific time. The allocation of limited cloud resources to large number of tasks to satisfy the required quality of service is the key challenge in cloud. Allocation of a resource with less capability to a task increases the response time, makespan of the task and waiting time of the entire tasks in the waiting queue. This problem will result to an unsatisfied Quality of Service. In this paper we proposed an efficient task scheduling that uses three threshold values to specify the resource to be allocated to a task at a given time. This method ensures that a capable resource is allocated to task such that the response time and makespan of the all task are minimized. The proposed method was simulated using CloudSim and the result shows a better response time and makespan than the well known Min-Min and Max-Min Method.


A distributed computing is one of the most amazing administration offered by means of web which makes a stage to store and recover information Since client's close to home information is being put away in a decoded arrangement on a remote machine worked by outsider merchants who give different administrations, the effect of client's personality and unapproved access or revelation of records are extremely high.In this proposed system is using Dependability of the Users,Privacy and Integrity of Data (DPI) algorithms using improve the Execution assessment of Cloud Computing foundations is required to anticipate and measure the money saving advantage of a technique portfolio and the relating Quality of Service (QoS) experienced by clients. Along these lines, concentrating on Load adjusting in the distributed computing condition importantly affects the presentation. This paper deals with multi target asset provisioning plan for taking care of different errand classes for different outstanding task at hand office. In this proposal, project is using a Best Partition Searching for distributing a file system to another cloud environment. This methodology gives a security regarding client verification for "approval" to enter the system which is made by means of Image Sequencing secret key to demonstrate that the personality is unique client, RSA calculation to encode the information to give information respectability, a profoundly parallel conveyed information the executives administration that empowers to peruse/compose and add gigantic informational collections that are divided and circulated at a huge scale. Subsequently this methodology gives a general security to the customer's close to home information and the issue of simultaneousness, volume of information can be settled with these procedures


Sign in / Sign up

Export Citation Format

Share Document