Adapting Market-Oriented Scheduling Policies for Cloud Computing

Author(s):  
Mohsen Amini Salehi ◽  
Rajkumar Buyya
2014 ◽  
Vol 644-650 ◽  
pp. 1801-1804
Author(s):  
Hui Suo ◽  
He Hua Yan

.Resource scheduling is the core technology to provide efficient and reliable services in cloud computing, and it is the basis of cloud computing to implement quick deploy and rapid response and save money. This article firstly introduces the research status of the resource scheduling in cloud computing including resource scheduling policies, replica technology and metadata management. Next we analyze the issues of Hadoop platform in resource scheduling including high latency, small files I/O, single point of failure and hot data. On the basis of these, the effective resource scheduling and management mechanisms are given including dynamic replica management, metadata management and horizontal scalability.


2019 ◽  
Vol 20 (3) ◽  
pp. 527-540
Author(s):  
Walid Kadri ◽  
Belabbas Yagoubi

Cloud Computing refers to the use of the computing capabilities of remote computers, where the user has considerable computing power without having powerful units. Scientific applications, usually represented as Directed Acyclic Graphs (DAGs), are an important class of applications that lead to challenging problems for resource management in distributed computing. With the advent of Cloud Computing, particularly the IaaS offers for on demand virtual machines leasing, multiple jobs execution, consisting of a large number of DAGs, needs an elaborated scheduling and resource provisioning policies, for efficient use of resources. Only few works exists that consider this problem in the context of clouds environment. In goal of optimization and fault tolerance, DAGs applications are generally partitioned into multiple parallel DAGs using clustering algorithm and assigned to VM (Virtual Machine) resources independently. In this work, we investigate through simulation, the impact of clustering for both provisioning and scheduling policies in the total makespan and financial costs for execution of user's application. We implemented four scheduling policies well-known in grid computing systems, and adapted clustering algorithm to our resource management policy that leases and destroys dynamically VMs. We show that dynamic policies can achieve equal or even better performance than static management policies.


Author(s):  
Jyoti Thaman ◽  
Manpreet Singh

Workflow scheduling has been around for more than two decades. With growing interest in service oriented computing architecture among researchers and corporate users, different platform like clusters computing, grid computing and most recent cloud computing, appeared on computing horizon. Cloud computing has attracted a lot of interest from all types of users. It gave rise to variety of applications and tasks with varied requirements. Heterogeneity in application's requirement catalyzes the provision of customized services for task types. Representation of tasks characteristics and inter-task relationship through workflows is in use since the ages of automation. Scheduling of workflows not only maintain the hierarchical relationship between the tasks but also dictates the requirement of dynamic scheduling. This paper presents a variance based extensions of few promising dynamic scheduling policies supported by WorkflowSim. An exhaustive performance analysis presents strength and weakness of the authors' proposal.


Sign in / Sign up

Export Citation Format

Share Document