A Scheduling algorithm for Multi-Tenants Instance- Intensive Workflows

نویسندگان

  • Lizhen Cui
  • Tiantian Zhang
  • Guangquan Xu
  • Dong Yuan
چکیده

As a key service model in cloud computing, SaaS applications are becoming increasingly popular. Multi-tenancy is a key characteristics of SaaS applications. Business processes play a key role in SaaS applications because of the composability and reusability of software services. This paper focuses on multi-tenants instance-intensive workflows system, in which workflows have a large number of instances belonging to multiple tenants in a SaaS environment, and further proposes a scheduling algorithm for multitenants workflow instances. This algorithm improves the quality of service (QoS) for tenants and saves the execution cost of workflows. The simulation results demonstrate that the proposed algorithm guarantees the workflow execution conforming to the deadline set by tenants, and reduces the mean execution time for tenants in high priority whilst saves the execution cost for service providers.

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

ثبت نام

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

منابع مشابه

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

A Throughput Maximisation Strategy for Scheduling Transaction Intensive Workflows on SwinDeW-G

With the rapid development of e-business, workflow systems now have to deal with transaction intensive workflows whose main characteristic is the huge number of concurrent workflow instances. For such workflows, it is important to maximise the overall throughput to provide good quality of service. However, most existing scheduling algorithms are designed for scheduling of a single complex scien...

متن کامل

A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on Cloud Computing Platform

The concept of cloud computing continues to spread widely, as it has been accepted recently. Cloud computing has many unique advantages which can be utilised to facilitate workflow execution. Instance-intensive costconstrained cloud workflows are workflows with a large number of workflow instances (i.e. instance intensive) bounded by a certain budget for execution (i.e. cost constrained) on a c...

متن کامل

A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on a Cloud Computing Platform

The concept of cloud computing continues to spread widely, as it has been accepted recently. Cloud computing has many unique advantages which can be utilized to facilitate workflow execution. Instance-intensive cost-constrained cloud workflows are workflows with a large number of workflow instances (i.e. instance intensive) bounded by a certain budget for execution (i.e. cost constrained) on a ...

متن کامل

A throughput maximization strategy for scheduling transaction-intensive workflows on SwinDeW-G

With the rapid development of e-business, workflow systems now have to deal with transaction-intensive workflows whose main characteristic is the huge number of concurrent workflow instances. For such workflows, it is important to maximize the overall throughput to provide good quality of service. However, most of the existing scheduling algorithms are designed for scheduling of a single comple...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2013