A Priority Heuristic Policy in Mobile Distributed Real-Time Database System

In fast processing new technology, to provide priority scheduling among different running transactions is a challenging part of research in wireless environment. It incorporates a mechanism to assign priority among transaction to maintain a sequence of execution. Priority heuristics are the backbone of a transaction scheduling approach in real-time systems. It is one of the sophisticated tasks which heavily affect the overall performance of mobile distributed real-time database system (MDRTDBS). Priority heuristics have been developed for centralized and distributed real-time database systems where cohorts or sub-transaction executed in sequential/parallel manner; however, these heuristics may not fit well for the MDRTDBS where sub-transactions are performing parallel execution and face a lot of wireless environment challenges. In this paper, a priority heuristic has proposed which integrates the concept of number of write locks and the variable size of data items. Further, simulation study has been done to evaluate performance of proposed priority heuristics with earliest deadline first and heuristic based on number of locks required.