Name
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 |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/ICDCS.1995.500010 | ICDCS |
Keywords | Field | DocType |
counterpart algorithm o2pl,new lock management scheme,o2pl-mt grant,fewer message,o2pl-mt,read lock,data item,concurrency control,replicated copies,mobile transaction,commitment time,mobile transactions,distributed lock management,phase locking,read unlock,message costs,distributed databases,copy site | Double-checked locking,Concurrency control,Computer science,Lock (computer science),Computer network,Two-phase locking,Distributed lock manager,Record locking,Readers–writer lock,Optimistic concurrency control,Distributed computing | Conference |
ISSN | ISBN | Citations |
1063-6927 | 0-8186-7025-8 | 34 |
PageRank | References | Authors |
3.09 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Jing | 1 | 34 | 3.09 |
| O. Bukhres | 2 | 47 | 4.18 |
| Ahmed K. Elmagarmid | 3 | 3720 | 626.92 |