Results 291 to 300 of about 1,772,274 (338)

Efferent control of hair cells mechanically coupled by artificial membranes. [PDF]

Sci Rep
Toderi MA, Muñoz-Hernandez G, Faber J, Bozovic D.   +3 more
europepmc   +1 more source

Cortical oscillations predict auditory grouping in listeners with various hearing configurations. [PDF]

Neuroimage
Alsabbagh N, McMurray B, Griffiths TD, Berger JI, Lee K, Gander PE, Choi I.   +6 more
europepmc   +1 more source

Dynamics of h-Shaped Pulse to GHz Harmonic State in a Mode-Locked Fiber Laser. [PDF]

Micromachines (Basel)
Wang L, Hu G, Wang Y, Chen G, Xuan L, Zhou Z, Yu J.   +6 more
europepmc   +1 more source

A Two-Phase Locking Mechanism Avoiding Deadlock for Read-Write Confliction

A Two-Phase Locking Mechanism Avoiding Deadlock for Read-Write Confliction
openaire  

Beyond two-phase locking

Journal of the ACM, 1985
Many database systems maintain the consistency of the data by using a locking protocol to restrict access to data items. It has been previously shown that if no information is known about the method of accessing items in the database, then the two-phase protocol is optimal.
Buckley, G. N., Silberschatz, A.
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Lock Conversion in Non-Two-Phase Locking Protocols

IEEE Transactions on Software Engineering, 1985
A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind.
C. Mohan, D. Fussell, Z.M. Kedem, A. Silberschatz   +3 more
openaire   +2 more sources

A secure two phase locking protocol

Proceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems, 2002
A secure concurrency control algorithm must, in addition to maintaining consistency of the database, be free from covert channels arising due to data conflicts between transactions. The existing secure concurrency control approaches are unfair to transactions at higher access classes.
R. David, S. Son
openaire   +2 more sources

Releasing Locks As Early As You Can: Reducing Contention of Hotspots by Violating Two-Phase Locking

Proceedings of the 2021 International Conference on Management of Data, 2021
Hotspots, a small set of tuples frequently read/written by a large number of transactions, cause contention in a concurrency control protocol. While a hotspot may comprise only a small fraction of a transaction's execution time, conventional strict two-phase locking allows a transaction to release lock only after the transaction completes, which leaves
Zhihan Guo, Kan Wu, Cong Yan, Xiangyao Yu   +3 more
openaire   +2 more sources

Performance analysis of two-phase locking

IEEE Transactions on Software Engineering, 1991
A straightforward analytic solution method is developed which takes into account the variability of transaction size (the number of lock requests). The authors first obtain analytic expressions for the probability of lock conflict, probability of deadlock, and the waiting time per lock conflict.
A. Thomasian, I.K. Ryu
openaire   +2 more sources