Value-Based Scheduling for Multiprocessor Real-Time Database Systems
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1998-01-25
著者
-
YANG Wei-Pang
the Institute of Computer and Information Science National Chiao Tung University
-
TSENG Shin-Mu
The Institute of Computer and Information Science, National Chiao Tung University
-
CHIN Y.H.
The Institute of Computer Science, National Tsing Hua University
-
Chin Y.h.
The Institute Of Computer Science National Tsing Hua University
-
Tseng Shin-mu
The Institute Of Computer And Information Science National Chiao Tung University
関連論文
- Two Efficient Server-Aided RSA Secret Computation Protocols Against Active Attacks
- Value-Based Scheduling for Multiprocessor Real-Time Database Systems