Algorithm for priority based concurrency control without locking in mobile environments

In a mobile computing environment, clients can access shared data and update independently irrespective of their physical location. This leads to inconsistency of the data. Several concurrency control techniques are proposed in literature to prevent data inconsistency. In this paper we first analyze the existing scheme of concurrency control without locking and justify its Performance limitations. A new priority based scheme is proposed in which priority is given to the older transaction whenever conflict arises, there by decreasing current load of the database server. Experimental results show performance benefits and increase in commit rate of the transactions.