RSDC (RELIABLE SCHEDULING DISTRIBUTED IN CLOUD COMPUTING

Asian Journal of Research in Computer Science, 2018

Cloud computing is an information technology archetype which has been used significantly for providing various services through Internet. It ensures easier access to resources and high-level services. The working procedure of cloud systems must be scheduled, so as to efficiently provide services to people. The goal of task scheduling is to acquire best system throughput and to allocate various computing resources to applications. The unpredictable situation increases with the size of the task and becomes high potential to solve effectively. Numerous intellectual methods are recommended to clarify this situation in the territory of scheduling of cloud computing. In this research, a comparative analysis has been conducted for different types of existing scheduling algorithms in the cloud environment with their respective parameters.

Cloud computing is a paradigm that focuses on sharing of data and computation over a scalable network of nodes like end users, computers, data centers, and web services. Task scheduling is one of the most famous combinatorial optimization problems, and plays a key role to improve the performance of flexible and reliable systems. Cloud-based application services like social networking, web hosting, and content delivery, deal with large amount of data processing. These applications require large amount of network bandwidth because traffics between nodes are tremendous. As network bandwidth is a limited resource, scheduling policies that reduce bandwidth usage is essential in cloud computing. Task scheduling algorithms based on data locality will reduce the network access, thus reducing bandwidth usage and the job completion time. Balance Reduce Algorithm (BAR) is a heuristic algorithm based on data locality, and minimizes makespan (job completion time) of a job. This paper proposes an improved balance reduce algorithm, an enhancement of BAR algorithm for handling machine failure. For this purpose, we propose an algorithm which is similar to primary backup approach. Compared to existing BAR algorithm, this proposed algorithm will reduce the job completion time effectively when failure happens.

2018

Cloud computing is one of the upcoming latest new computing paradigm where applications and data services are provided over the Internet. Cloud computing is attractive to business owners as it eliminates the requirement for users to plan ahead for provisioning, and allows enterprises to start from the small and increase resources only when there is a rise in service demand. While dealing with cloud computing, a number of issues are confronted like heavy load or traffic while computation. Job scheduling is one of the answers to these issues. The main advantage of job scheduling algorithm is to achieve a high performance computing and the best system throughput. Job scheduling is most important task in cloud computing environment because user have to pay for resources used based upon time. This paper aims to do the insight study of various existing job scheduling algorithms and proposes a hybrid job scheduling algorithm for enhancing the performance in cloud computing environment.

Ciência e Natura

Cloud computing is the latest distributed technology providing a rich environment of dynamically shared resources through virtualization, which can fulfill the requirements of users by allocating resources to programs. Any program in a cloud environment is delivered by workflows which are a series of interlinked tasks to accomplish a goal. One of the most important tasks in cloud computing is correct mapping of tasks onto resources. It is essential to schedule processes in distributed systems such as cloud, since it leaves a tremendous impact on the system performance. This is done by scheduling algorithms. Therefore, it is crucial to present and adopt an efficient algorithm in the cloud environment. This article attempted to examine the parameters effective in the efficiency of scheduling algorithms including deadline, cost constraint, balanced loading, power consumption and fault tolerance. Additionally, the performances of several algorithms were briefly discussed.

International Journal of Advanced Research in Computer Science, 2014

Cloud computing is an emerging technique that describes new class of network. Cloud computing share resources connected to each other via a link and uses concept of distributed computing, grid computing, utility computing and virtualization. Scheduling in cloud computing is interest of area to schedule processes that is a difficult task. Scheduling in cloud computing is to manage and control processes. Basically selection of scheduling method depends on user requirement, choosing the right scheduling method can cause maximum packet transmission, can control packet loss and can increase CPU utilization. This paper describes different scheduling method used in cloud computing such that First Come First Serve (FCFS), Priority Queue (PQ), Round Robin (RR), Multi Level Feedback Queue (MLFQ), Multi Level Queue (MLQ). Keywords: Cloud Computing, Scheduling, Job, Resources, Processes, Task.

International Journal of Scientific Research in Science, Engineering and Technology, 2021

The current era of an emerging technology is cloud computing. It is internet based computing, works as pay-per-use model and process large data. The cloud Service provider goal is to manage resources efficiently, So, in cloud computing the mechanism of Scheduling has an important function. The revised scheduling technique is meant to improve the server performance and decrease the switching time to increase the use of resources. Different sorts of scheduling algorithms have been studied and analysed in this research to deliver efficient cloud services. The improved Scheduling algorithm prioritises the task, which improves computer performance and does my best possible efforts to limit the duration and duration of waiting. A CloudSim tool is used to simulate the suggested approach.

Cloud computing environments facilitate applications by providing virtualized resources that can be provisioned dynamically. Computing resources are delivered by Virtual Machines (VMs). In such a scenario, resource scheduling algorithms play an important role where the aim is to schedule applications effectively so as to reduce the turn-around time and improve resource utilization. The problem of this paper is how to dynamically allocate the submitted jobs to the available resources in order to complete the tasks within a minimum turn-around time as well as utilizing cloud resources effectively. The objective of this paper is to propose new scheduling algorithm on cloud computing environment using Shortest Remaining Job First (SRJF) algorithm. The methodology of this paper depends on simulation using cloudsim. The results of this paper revealed that the proposed algorithm (SRJF) performed better than the default scheduling algorithm.

International Journal of Science and Research (IJSR), 2016

Cloud computing is a general term used to describe a new class of network based computing that takes place over the internet. Cloud computing is the new paradigm for delivering on demand services over internet and can be described as internet amiable software. Job scheduling is one of the major activities performed in all the computing environments. Cloud computing is one the upcoming latest technology. To increase the working of cloud computing environments, job scheduling is one the tasks performed in order to gain maximum profit. In this paper, we introduce multiple scheduling research works to address this area. This review work provides acumen sight on the introduction of cloud computing to understand it and then focus on the various strategies for job scheduling in cloud computing. This paper also provides the base to the new researchers in cloud computing. This paper also takes a few techniques. Our priority bases upon some factors including same number of jobs for execution at each node. This paper provides the survey on scheduling algorithms. There working with respect to the resource sharing. We systemize the scheduling problem in cloud computing, and present a cloud scheduling hierarchy.

Cloud computing is the requirement based on clients that this computing which provides software, infrastructure and platform as a service as per pay for use norm. The scheduling main goal is to achieve the accuracy and correctness on task completion. The scheduling in cloud environment which enables the various cloud services to help framework implementation. Thus the far reaching way of different type of scheduling algorithms in cloud computing environment surveyed which includes the workflow scheduling and grid scheduling. The survey gives an elaborate idea about grid, cloud, workflow scheduling to minimize the energy cost, efficiency and throughput of the system.

International Journal of Grid and Distributed Computing

Cloud Computing is a business model that based on "pay as you go" principle. It is used to provide the IT services to the user in the flexible and dynamic manner with minimal management effort. The most important feature of the Cloud Computing is the ability to dynamically schedule the application on the best resource according to the load. According to the work in this paper, a task schedule on the Cloud environment has been proposed. The principle of the proposed algorithm is to allocate the incoming task on the best resource during the runtime of some tasks based on measuring the current situation of each resource with respect to its availability level according to its processing power, cost, and the number of running tasks to know its fitness to receive the incoming task, then choosing the best one to the incoming task. To evaluate the performance of the proposed algorithm, a comparative study has been done between this proposed algorithm, Round Ribbon (RR) algorithm, and Minimum Completion Time (MCT) algorithm. The experimental results show that the proposed algorithm outperforms the RR, and MCT algorithms by reducing make-span and the cost of the running tasks.

2013

Cloud Computing (CC) is emerging as the next generation platform which would facilitate the user on pay as you use mode as per requirement. It provides a number of benefits which could not otherwise be realized. The primary aim of CC is to provide efficient access to remote and geographically distributed resources. A scheduling algorithm is needed to manage the access to the different resources. There are different types of resource scheduling technologies in CC environment. These are implemented at different levels based on different parameters like cost, performance, resource utilization, time, priority, physical distances, throughput, bandwidth, resource availability etc. In this research paper various types of resource allocation scheduling algorithms that provide efficient cloud services have been surveyed and analyzed. Based on the study of different algorithms, a classification of the scheduling algorithms on the basis of selected features has been presented. 2013 Elixir All ...

Cloud computing is an on demand service in which shared resources, information, software and other devices are provided according to the clients requirement at specific time. In such a scenario, resource scheduling algorithms play an important role where the aim is to schedule applications effectively so as to reduce the turnaround time and improve resource utilization. The problem of this paper is how to dynamically allocate the submitted jobs to the available resources in order to complete the tasks within a minimum turnaround time as well as utilizing cloud resources effectively. The objective of this paper is to propose new scheduling algorithm on cloud computing environment using Shortest Remaining Job First (SRJF) algorithm. The methodology of this paper depends on simulation using cloudsim. The results of this paper revealed that the proposed algorithm (SRJF) performed better than the default scheduling algorithm.

Cloud computing is a technology that provides data storage, pool of resources and online access to computer services. Scheduling defines the order in which the set of tasks to be completed. Though large number of resource is available in cloud computing the user tasks should be properly allocated to the resources so that maximum tasks can be executed by utilizing minimum resources. Cloud computing provides various scheduling algorithms considering various parameters that can increase the performance of the system. This review paper focuses on various Scheduling algorithms in detail and the issues and the challenges faced by those scheduling algorithms.

Cloud computing comes in focus development of grid computing, virtualization and web technologies. The cloud computing is a mingle of technologies where a large number of systems are connected in private or public networks. This technology offers dynamically scalable infrastructure for data, file storage, and application. Scheduling is a main task in a cloud computing environment. In cloud computing environment datacenters take care of this task. The selection of a exacting scheduling algorithm depends upon various factors like the parameter to be optimized (cost or time), quality of service to be provided and information available regarding various aspects of job. Workflow applications are the applications which need various sub-tasks to be executed in a particular fashion in order to complete the whole task. Various scheduling algorithms surveyed in this paper. The goal of cloud task scheduling is to achieve high system throughput and to assign various computing resources to applications. The Complexness of scheduling trouble increases with the size of the task and becomes very difficult to solve effectively. Min-Min algorithm is used to lessen the make span of tasks by assuming the task length. Keeping this in mind, cloud providers should achieve user satisfaction Keywords: Cloud Computing, Scheduling in cloud computing, Main Entities in cloud computing, Types of Scheduling.

International Journal of Science and Research (IJSR) , 2016

Cloud computing is a general term used to describe a new class of network based computing that takes place over the internet. Cloud computing is the new paradigm for delivering on demand services over internet and can be described as internet amiable software. Job scheduling is one of the major activities performed in all the computing environments. Cloud computing is one the upcoming latest technology. To increase the working of cloud computing environments, job scheduling is one the tasks performed in order to gain maximum profit. In this paper, we introduce multiple scheduling research works to address this area. This review work provides acumen sight on the introduction of cloud computing to understand it and then focus on the various strategies for job scheduling in cloud computing. This paper also provides the base to the new researchers in cloud computing. This paper also takes a few techniques. Our priority bases upon some factors including same number of jobs for execution at each node. This paper provides the survey on scheduling algorithms. There working with respect to the resource sharing. We systemize the scheduling problem in cloud computing, and present a cloud scheduling hierarchy.