By Topic

Using lock-based checking protocol for efficient data broadcast in mobile environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wong, A.C.S. ; Dept. of Comput. Sci., City Univ. of Hong Kong, China ; Kwok-Wa Lam ; Ho, K.K.M. ; Lee, V.C.S.

We address, the issue of reading the entire database by the broadcast transaction for data broadcasting in mobile environments. The broadcast transaction is a long-lived read-only transaction which creates significant amount of data conflicts with other concurrent update transactions. Using conventional concurrency control to handle the broadcast transaction is inadequate. Recently, some algorithms are proposed for reading the entire database. However, they suffer from late detection of data conflicts. This leads to many data entities being locked unnecessarily, reducing the availability of data. To solve this problem, an effective protocol based on a data locking approach is devised. Data conflicts can be detected at the early stage of the execution of update transactions by a set of predefined rules. As a result, the lock holding time of data entities is effectively reduced and unnecessary acquisitions of data locks are avoided. The simulation results show that the system performance can be significantly improved.

Published in:

Distributed Computing Systems Workshops, 2004. Proceedings. 24th International Conference on

Date of Conference:

23-24 March 2004