By Topic

A QoS constrained dynamic priority scheduling algorithm for process engine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Li Li ; Green IT Team, IBM Res. - China, Beijing, China ; Qiming Tian ; Ruixiong Tian ; Liang Liu
more authors

In this paper, a task scheduling algorithm in process engine is proposed to not only maximize overall customer satisfaction but also guarantee QoS requirement. This new algorithm dynamically assigns priority to a task based on the weighted utility value considering the predicted business value and left time to execute the process instance the task belongs to. The business value of each kind of process instance is modeled as a utility function of response time which reflects the inverse proportional relationship between the customer satisfaction and response time. Experiments show that the proposed algorithm promotes the total value of utility function with better QoS achievement compared to traditional algorithms.

Published in:

Service Operations and Logistics and Informatics (SOLI), 2010 IEEE International Conference on

Date of Conference:

15-17 July 2010