Abstract
Since mobile transactions are long-lived, in case of a conflict, the waiting transactions are either blocked for longer durations or aborted if two-phase locking is employed for concurrency control. In this paper, we propose mobile speculative locking (MSL) protocol to reduce the blocking of transactions. MSL allows a transaction to release a lock on a data object whenever it produces corresponding after-image value. By accessing both before- and after-images, the waiting transaction carries out speculative executions at the mobile host. Before the end of commit processing, the transaction that has carried out speculative executions retains appropriate execution based on the termination decisions of preceding transactions. The MSL approach requires extra resources at the mobile host to carry out speculative executions. Since mobile host is operated by single user, we assume that it can support a reasonable number of speculative executions. Through analysis it has been shown that MSL increases concurrency with limited resources available at mobile host.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Agrawal, A. El Abbadi, and A.E. Lang, The performance of protocols based on locks with ordered sharing, IEEE Transactions on Knowledge and Data Engineering, vol.6,no.5, October 1994, pp. 805–818.
R. Alonso and H.F. Korth, Database system issues in nomadic computing, Proc. of the 1993 ACM SIGMOD, pp. 388–392, 1993.
A. Burger and P. Thanisch, Branching transactions: a transaction model for parallel database systems, Lecture Notes in Computer Science 826.
Azer Bestavros and Spyridon Braoudakis, Value-cognizant speculative concurrency control, proc. of the 21th VLDB Conference, pp.122–133, 1995.
B.R. Badrinath and K. Ramamritam, Semantics based concurrency control: Beyond commutativity, ACM Transactions on Database Systems, vol.17,no.1, March 1992, pp. 163–199.
P.A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency control and recovery in database systems (Addison-Wesley, 1987).
M.H. Dunham, A. Helal, and S. Balakrishnan, A mobile transaction model that captures both the data and movement behavior, Mobile Networks and Applications, vol. 2, pp. 147–162, 1997.
A.K. Elmagarmid, A survey of distributed deadlock detection algorithms, ACM SIGMOD RECORDS, 15(3), September 1986, pp. 37–45.
T. Imielinksi, and B.R. Badrinath, Wireless mobile computing: Challenges in Data Management, Communications of ACM, 37(10), October 1994.
H.V. Jagadish, and O. Shmueli, A proclamation-based model for cooperation transactions, proceedings of the 18th VLDB Conference, Canada, 1992.
J. Jing, O. Bukhres, and A. Elmagarmid, Distributed lock management for mobile transactions, in proceedings of 15th International Conference on Distributed Computing Systems, pp. 118–125, June 1995.
E. Knapp. Deadlock detection in distributed databases, ACM Computing Surveys, 19(4), December 1987, pp.303–328.
P. Krishna Reddy and Masaru Kitsuregawa, Improving performance in distributed database systems using speculative transaction processing, in proceedings of The Second European Parallel and Distributed Systems conference (Euro-PDS’98), 1998, Vienna, Austria.
E. Pitoura, and B. Bhargawa, Maintaining Consistency of Data in Mobile Computing Environments, in proceedings of 15th International Conference on Distributed Computing Systems, pp. 404–413, June 1995.
K. Salem, H. Garciamolina and J. Shands, Altruistic locking, ACM Transactions on Database Systems, vol. 19,no.1, March 1994, pp. 117–165.
S.K. Madira, S.N. Maheswari, B. Chandra and Bharat Bhargawa, Crash Recovery algorithm in open and safe nested transaction model, Lecture Notes in Computer Science, vol. 1308, Springer-Verlag, 1997, pp. 440–451.
G.D. Walborn, and P.K. Chrysanthis, Supporting semantics-based transaction processing in mobile database applications, in proceedings of 14th IEEE Symposium on Reliable Distributed Systems, pp. 31–40, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reddy, P.K., Kitsuregawa, M. (1999). Speculative Lock Management to Increase Concurrency in Mobile Environments. In: Leong, H.V., Lee, WC., Li, B., Yin, L. (eds) Mobile Data Access. MDA 1999. Lecture Notes in Computer Science, vol 1748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46669-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-46669-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66878-7
Online ISBN: 978-3-540-46669-7
eBook Packages: Springer Book Archive