Results 241 to 250 of about 7,260 (279)

FPGA-Accelerated Optimistic Concurrency Control for Transactional Memory

Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, 2019
Transactional Memory (TM) has been considered as a promising alternative to existing synchronization operations, which are often the largest stumbling block to unleashing parallelism of applications. Efficient implementations of TM, however, are challenging due to the tension between lowering performance overhead and avoiding unnecessary aborts.
Zhaoshi Li, Leibo Liu, Yangdong Deng, Jiawei Wang, Zhiwei Liu, Shouyi Yin, Shaojun Wei   +6 more
openaire   +1 more source

An optimistic approach in distributed database concurrency control

2013 5th International Conference on Computer Science and Information Technology, 2013
In this paper, we present an optimistic concurrency control solution. The proposed solution represents an excellent blossom in the concurrency control field. It deals with the concurrency control anomalies, and, simultaneously, assures the reliability of the data before read-write transactions and after successfully committed. It can be used within the
Obaidah A. Rawashdeh, Hiba A. Muhareb, Nedhal A. Al-Sayid   +2 more
openaire   +1 more source

Maintaining temporal consistency: pessimistic vs. optimistic concurrency control

IEEE Transactions on Knowledge and Data Engineering, 1995
We study the performance of concurrency control algorithms in maintaining temporal consistency of shared data in hard real time systems. In our model, a hard real time system consists of periodic tasks which are either write only, read only or update transactions. Transactions may share data. Data objects are temporally inconsistent when their ages and
null Xiaohui Song, J.W.S. Liu
openaire   +1 more source

Optimistic similarity-based real-time concurrency control

Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245), 2002
Serializability is unnecessarily strict for real-time systems because most transactions in such systems occur periodically and changes among data values over a few consecutive periods are often insignificant. Hence, data values produced within a short interval can be treated as "similar" and interchangeable.
openaire   +1 more source

Optimistic concurrency control protocol for real-time databases

Journal of Systems and Software, 1997
In recent years, the use of optimistic schemes for concurrency control in real-time database systems (RTDBS) has received more and more attention. Different real-time optimistic protocols have been proposed. They incorporate different priority conflict resolution methods into the validation phase of a transaction to give preferences for the commitment ...
Kwok-wa Lam, Kam-yiu Lam, Sheung-lun Hung   +2 more
openaire   +1 more source

XML Optimistic Concurrency Control Protocol for DOM API

2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming, 2014
XML concurrency control protocol ensures that transactions execute atomically in a XML database system. Existing concurrency control methods for XML are mainly based on locking. In this paper, we propose two optimistic concurrency control protocols for XML that use snapshot-based approach.
Weifeng Shan, Husheng Liao
openaire   +1 more source

Optimistic path-based concurrency control over XML documents

Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology - CSTST '08, 2008
We present a new approach for concurrency control over XML documents. Unlike most of other approaches, we use an optimistic scheme, since we believe that it is better suited for Web applications. The originality of our solution resides in the fact that we use path expressions associated with operations to detect conflicts between transactions.
Djamel Berrabah, Stéphane Gançarski, Sarah Kaddour Chikh, Cécile Le Pape   +3 more
openaire   +1 more source

An Efficient Real-Time Optimistic Concurrency Control Protocol

1996
In this paper, a new real-time optimistic concurrency control protocol, called OCC-DA, is proposed in which the number of transaction restarts is minimized by dynamically adjusting the serialization order of the conflicting transactions. Unlike other implementations of dynamic serialization order adjustment for optimistic schemes, it is no need to ...
Kwokwa Lam, Kamyiu Lam, Sheunglun Hung
openaire   +1 more source

Improving Conflict Detection in Optimistic Concurrency Control Models

2003
Configuration Management is required in all software development processes. To support 'agile' methodologies, an approach is desirable that allows developers to work as independently as possible and yet be aware of each other's activities. Optimistic concurrency control provides good support for independent working but is less supportive of ...
Ciaran O’Reilly, Philip Morrow, David Bustard   +2 more
openaire   +1 more source

Effective optimistic concurrency control in multiversion object bases

1994
The use of versioned data has proven its value in many areas of Computer Science including concurrency control. In this paper we examine the use of versioned objects in object bases for the purpose of enhancing concurrency. We provide a framework for discussing multi-version objects which includes fundamental definitions, the abstraction of objects as ...
Peter Graham, Ken Barker
openaire   +1 more source