Deadline and Budget Distribution based Cost- Time Optimization Workflow Scheduling Algorithm for Cloud

نویسندگان

  • Amandeep Verma
  • Sakshi Kaushal
چکیده

Cloud computing is a rapidly growing area. Cloud Computing offers utility-oriented IT services to the users worldwide over the internet. As compared to grid computing, the problem of resource management is transformed into resource virtualization and allocations. Effective scheduling is a key concern for the execution of performance driven applications, such as workflows in dynamic and cost-driven environment including clouds. In case of Cloud computing, issues such as resource management and scheduling based on users' QoS constraints are yet to be addressed especially in the context of workflow management systems. In cloud, the users submit their workflows along with some QoS constraints like deadline, budget, trust, reliability etc. for computation. In this paper, we are considering the two constraints: deadline and budget. We propose Deadline and Budget distribution-based Cost-Time Optimization (DBD-CTO) workflow scheduling algorithm that minimizes execution cost while meeting

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints

One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...

متن کامل

On Optimal Budget-Driven Scheduling Algorithms for MapReduce Jobs in the Heterogeneous Cloud

In this paper, we consider task-level scheduling algorithms with res-pect to budget and deadline constraints for a bag of MapReduce jobs on a set of provisioned heterogeneous (virtual) machines in cloud platforms. Heterogeneity is manifested in the ”pay-as-you-go” charging model we use, where service machines with different performance have different service rates. We organize the bag of jobs a...

متن کامل

Score Based Deadline Constrained Workflow Scheduling Algorithm for Cloud Systems

Cloud Computing is the latest and emerging trend in information technology domain. It offers utilitybased IT services to user over the Internet. Workflow scheduling is one of the major problems in cloud systems. A good scheduling algorithm must minimize the execution time and cost of workflow application along with QoS requirements of the user. In this paper we consider deadline as the major co...

متن کامل

Robust and fault-tolerant scheduling for scientific workflows in cloud computing environments

CLOUD environments offer low-cost computing resources as a subscription-based service. These resources are elastically scalable and dynamically provisioned. Furthermore, new pricing models have been pioneered by cloud providers that allow users to provision resources and to use them in an efficient manner with significant cost reductions. As a result, scientific workflows are increasingly adopt...

متن کامل

A Knowledge-Based Ant Colony Optimization for a Grid Workflow Scheduling Problem

Service-oriented grid environment enables a new way of service provisioning based on utility computing models, where users consume services based on their QoS (Quality of Service) requirements. In such “pay-per-use” Grids, workflow execution cost must be considered during scheduling based on users’ QoS constraints. In this paper, we propose a knowledge-based ant colony optimization algorithm (K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012