IEICE TRANSACTIONS on Information
Value-Based Scheduling for Multiprocessor Real-Time Database Systems
Summary :
We present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.1 pp.137-143
- Publication Date
- 1998/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Databases
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shin-Mu TSENG, Y. H. CHIN, Wei-Pang YANG, "Value-Based Scheduling for Multiprocessor Real-Time Database Systems" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 1, pp. 137-143, January 1998, doi: .
Abstract: We present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_1_137/_p
Copy
@ARTICLE{e81-d_1_137,
author={Shin-Mu TSENG, Y. H. CHIN, Wei-Pang YANG, },
journal={IEICE TRANSACTIONS on Information},
title={Value-Based Scheduling for Multiprocessor Real-Time Database Systems},
year={1998},
volume={E81-D},
number={1},
pages={137-143},
abstract={We present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Value-Based Scheduling for Multiprocessor Real-Time Database Systems
T2 - IEICE TRANSACTIONS on Information
SP - 137
EP - 143
AU - Shin-Mu TSENG
AU - Y. H. CHIN
AU - Wei-Pang YANG
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1998
AB - We present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.
ER -
English
