By Topic

An adaptive value-based scheduling policy for multiprocessor real-time database systems

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
$33 $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

3 Author(s)
Shin-Mu Tseng ; Inst. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Y. H. Chin ; Wei-Ping Yang

In a real-time application, a transaction may be assigned a value to reflect the profit of completing the transaction before its deadline. Satisfying both goals of maximizing the totally obtained profit and minimizing the number of missed transactions at the same time is a challenge. The authors present an adaptive real-time scheduling policy named value-based processor allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. Using the VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of total processors are dynamically allocated to execute the urgent transactions. Through simulation experiments, VPA-k is shown to outperform other scheduling policies substantially in both maximizing the totally obtained profit and minimizing the number of missed transactions under various system environments.

Published in:

Database and Expert Systems Applications, 1997. Proceedings., Eighth International Workshop on

Date of Conference:

1-2 Sept. 1997