Distributed lock management for mobile transactions

We present a new lock management scheme which allows a read unlock for an item to be executed at any copy site of that item; the site may be different from the copy site on which the read lock is set. The scheme utilizes the replicated copies of data items to reduce the message costs incurred by the...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of 15th International Conference on Distributed Computing Systems pp. 118 - 125
Main Authors: Jin Jing, Bukhres, O., Elmagarmid, A.
Format: Conference Proceeding
Language:English
Published: IEEE 1995
Subjects:
Costs
ISBN:9780818670251, 0818670258
ISSN:1063-6927
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new lock management scheme which allows a read unlock for an item to be executed at any copy site of that item; the site may be different from the copy site on which the read lock is set. The scheme utilizes the replicated copies of data items to reduce the message costs incurred by the mobility of the transaction host. We demonstrate this idea in an optimistic locking algorithm called O2PL-MT (Optimistic Two Phase Locking for Mobile Transactions). Like its counterpart algorithm O2PL (Optimistic Two Phase Locking), O2PL-MT grants read locks immediately on demand and defers write locks until the commitment time. However, O2PL-MT requires the transmission of fewer messages than O2PL in a mobile environment in which data items are replicated.
ISBN:9780818670251
0818670258
ISSN:1063-6927
DOI:10.1109/ICDCS.1995.500010