Adaptive value-based scheduling policy for multiprocessor real-time database systems

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. In this paper, we 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 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.