Proceedings of 15th International Conference on Distributed Computing Systems (1995)
May 30, 1995 to June 2, 1995
Jin Jing , Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
O. Bukhres , Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
A. Elmagarmid , Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
Abstract: 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.
concurrency control; distributed databases; distributed lock management; mobile transactions; read unlock; read lock; replicated copies; message costs; O2PL-MT
J. Jing, O. Bukhres and A. Elmagarmid, "Distributed lock management for mobile transactions," Proceedings of 15th International Conference on Distributed Computing Systems(ICDCS), Vancouver, Canada, 1995, pp. 0118.