A new multi-dynamic priority real-time database scheduling algorithm

In view of the traditional priority real-time transaction scheduling algorithms take into account all matters the same characteristic parameters. It can not be dynamically scheduled different types of real-time transactions to meet the key requirements of real-time transactions completed on time in the power control system. A new multi-dynamic priority real-time scheduling algorithm named MDTS is proposed, it considerates various characteristic parameters of transactions, and hard and soft real-time transactions are treated differently. Simulated result show, compared with the traditional EDF and LSF algorithm, MDTS algorithm is effective in ensuring the hard real-time transactions to meet the deadline and also decreases missed deadline percentage of soft real-time transaction.