Filters








16,273 Hits in 3.7 sec

Observations on optimistic concurrency control schemes

Theo Härder
1984 Information Systems  
Two different optimistic concurrency control schemes are introduced and compared to each other.  ...  A number of general properties of optimistic concurrency control schemes is derived, and their advantages and drawbacks w.r.t. two-phase locking approaches are discussed. 111  ...  Hence, these schemes rely on transaction backout as a control mechanism.  ... 
doi:10.1016/0306-4379(84)90020-6 fatcat:jlufqdimxzfxlohh2iwbry7npm

Evaluating database-oriented replication schemes in Software Transactional Memory systems

Roberto Palmieri, Francesco Quaglia, Paolo Romano, Nuno Carvalho
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applications.  ...  Our results point out the limited efficiency and scalability of these schemes, highlighting the need for redesigning ad-hoc solutions well fitting the requirements of STM environments.  ...  This has been actuated in combination with a lock-based concurrency control scheme where each optimistically delivered transaction gets activated on the transactional system only in case it is deterministically  ... 
doi:10.1109/ipdpsw.2010.5470866 dblp:conf/ipps/PalmieriQRC10 fatcat:25wjgssls5ey7b6b4dokuqyfrm

A New Approach To Real-time Transaction

Sang H. Son, Juhnyoung Lee
1992 Fourth Euromicro workshop on Real-Time Systems  
Various real-time transaction scheduling algorithms have been proposed which employ either a pessimistic or an optimistic approach to concurrency control.  ...  Our experimental results indicate that hybrid protocols outperform other real-time concurrency control protocols in certain performance metrics.  ...  They pointed out the fact that the physical implementation schemes have a significant impact on the performance of real-time optimistic concurrency control.  ... 
doi:10.1109/emwrt.1992.637490 dblp:conf/ecrts/SonL92 fatcat:25eyiezqijbqbhnjhkrkbdsiya

Pulsating STM – The in-memory Optimistic Concurrency Control Technique for Multi Core Systems

2019 International Journal of Engineering and Advanced Technology  
The results show significant improvement in throughput with the increasing number of threads over the existing lock-based techniques as well as other STM techniques based on optimistic concurrency control  ...  This paper presents a novel Software Transactional Memory (STM) based optimistic concurrency control technique that is deadlock free for threads accessing the in-memory data structure for the purpose of  ...  Cicada is optimistic, multi version and multi clock concurrency control scheme.  ... 
doi:10.35940/ijeat.a9525.109119 fatcat:nhmqgac2brd6td3swao2oo4woq

On being optimistic about real-time constraints

Jayant R. Haritsa, Michael J. Carey, Miron Livny
1990 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '90  
Performance studies of concurrency control algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic techniques.  ...  the relative performance of the concurrency control algorithms.  ...  In their work, they focus primarily on the scheduling issue, and use locking as the underlying concurrency control mechanism.  ... 
doi:10.1145/298514.298585 dblp:conf/pods/HaritsaCL90 fatcat:rvphujoq5ncatf5gkxeuylspci

Optimistic concurrency control for abstract data types

Maurice Herlihy
1986 Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86  
A concurrency control technique is optimistic if it allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability.  ...  This paper describes several new optimistic concurrency control techniques for objects in distributed systems, proves their correctness and optimality properties, and characterizes the circumstances under  ...  Introduction Informally, optimistic concurrency control is based on the premise that it is more effective to apologize than to ask permission.  ... 
doi:10.1145/10590.10608 dblp:conf/podc/Herlihy86 fatcat:u4aycrohbjaqlj4dmlqgplnkpe

Optimistic concurrency control for abstract data types

Maurice Herlihy
1987 ACM SIGOPS Operating Systems Review  
A concurrency control technique is optimistic if it allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability.  ...  This paper describes several new optimistic concurrency control techniques for objects in distributed systems, proves their correctness and optimality properties, and characterizes the circumstances under  ...  Introduction Informally, optimistic concurrency control is based on the premise that it is more effective to apologize than to ask permission.  ... 
doi:10.1145/24601.24604 fatcat:gmgh7fv5j5ho3kvhzipxixwg3y

Apologizing versus asking permission: optimistic concurrency control for abstract data types

M. Herlihy
1990 ACM Transactions on Database Systems  
An optimistic concurrency control technique is one that allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability.  ...  Several new optimistic concurrency control techniques for objects in decentralized distributed systems are described here, their correctness and optimality properties are proved, and the circumstances  ...  INTRODUCTION Optimistic concurrency control is based on the premise that it is sometimes easier to apologize than to ask permission.  ... 
doi:10.1145/77643.77647 fatcat:esgrws2w5vayfnv6g44vmpq4fi

The Impact of Timestamp Granularity in Optimistic Concurrency Control [article]

Yihe Huang, Hao Bai, Eddie Kohler, Barbara Liskov, Liuba Shrira
2018 arXiv   pre-print
control schemes.  ...  Contention managers, mixed optimistic/pessimistic concurrency control algorithms, and novel optimistic-inspired concurrency control algorithms, such as TicToc, aim to address this problem, but these mechanisms  ...  Optimistic concurrency control (OCC) [11] obeys this principle.  ... 
arXiv:1811.04967v1 fatcat:r3gxwv2l5bczfi7jkqc45ukmem

Data access scheduling in firm real-time database systems

Jayant R. Haritsa, Michael J. Carey, Miron Livny
1992 Real-time systems  
(We consider here only concurrency control algorithms based exclusively on locking r optimistic concurrency control; hybrid algorithms (e.g.  ...  Based on some preliminary results in s i [Hari90a] , we expect the relative performance of locking and optimistic concurrency control algorithm n the soft-deadline framework to be similar to those observed  ... 
doi:10.1007/bf00365312 fatcat:wtaihezvljgtrjntj47i2f4cpm

Handling Conflicts with Compiler's Help in Software Transactional Memory Systems

Sandya Mannarswamy, R. Govindarajan
2010 2010 39th International Conference on Parallel Processing  
In this paper we propose a scheme based on compiler analysis, which can identify static atomic sections whose instances, when executed concurrently by more than one thread always conflict.  ...  Atomic sections are supported in software through the use of optimistic concurrency by using Software Transactional Memory (STM).  ...  We showed that our scheme can reduce aborts and improve application performance from 1.24% to 19.31% for certain benchmarks.  ... 
doi:10.1109/icpp.2010.56 dblp:conf/icpp/MannarswamyG10 fatcat:fk5foy7u7fcn5j3ulbbsthxma4

Dynamic real-time optimistic concurrency control

J.R. Haritsa, M.J. Carey, M. Livny
1990 [1990] Proceedings 11th Real-Time Systems Symposium  
In a recent study, we have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking.  ...  We present a new real-time optimistic concurrency control algorithm, WAlT-50, that monitors transaction conflict states and gives precedence to urgent transactions in a controlled manner.  ...  In this paper, we report on our efforts to develop such an algorithm, and present a new optimistic concurrency control algorithm, called WAIT-50.  ... 
doi:10.1109/real.1990.128734 dblp:conf/rtss/HaritsaCL90 fatcat:o3h3ydjicndj3c6p5m63vvs47i

Performance Analysis of Concurrency Control Mechanisms for OLTP Databases

Samuel Kaspi, Sitalakshmi Venkatraman
2014 International Journal of Information and Education Technology  
The three CC mechanisms investigated are, two phase locking (2PL), wait depth limited (WDL) and optimistic concurrency control. These CC mechanisms have been studied well in disk-based systems.  ...  Index Terms-Concurrency control, online transaction processing (OLTP), in-memory databases, performance.  ...  Concurrency Control Subsystems Three basic concurrency control subsystems are used in this chapter these are 2PL, wait depth limited (WDL) and optimistic.  ... 
doi:10.7763/ijiet.2014.v4.420 fatcat:xt7otnchnjebtf56iggjqyic6u

Efficient optimistic concurrency control using loosely synchronized clocks

Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari
1995 SIGMOD record  
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and  ...  It stores only a single version of each object, and avoids maintaining any concurrency control information on a perobject basis; instead, it tracks recent invalidations on a per-client basis, an approach  ...  This paper presents an efficient concurrency control scheme for use in such a system.  ... 
doi:10.1145/568271.223787 fatcat:neificuocbcajbpylw7uafwj5a

Efficient optimistic concurrency control using loosely synchronized clocks

Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari
1995 Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95  
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and  ...  It stores only a single version of each object, and avoids maintaining any concurrency control information on a perobject basis; instead, it tracks recent invalidations on a per-client basis, an approach  ...  This paper presents an efficient concurrency control scheme for use in such a system.  ... 
doi:10.1145/223784.223787 dblp:conf/sigmod/AdyaGLM95 fatcat:lifnzw47e5hjbefuyfi7lpxhwq
« Previous Showing results 1 — 15 out of 16,273 results