Results 11 to 20 of about 7,260 (279)
Dodo: A scalable optimistic deterministic concurrency control protocol
Future Generation Computer Systems, 2023 Xinyuan Wang +3 more
openalex +2 more sources
Extensions to optimistic concurrency control with time intervals [PDF]
Proceedings Seventh International Conference on Real-Time Computing Systems and Applications, 2002 Although an optimistic approach has been shown to be better suited than locking protocols for real time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. The article identifies the unnecessary restart problem in OCC-TI (Optimistic Concurrency Control with Time Intervals), proposes a solution to this ...
Jan Lindström
openalex +2 more sources
A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The Lax Logical Framework, LLFP, was introduced, by a team including the last two authors, to provide a conceptual framework for integrating different proof development tools, thus allowing for external evidence and for postponing, delegating, or ...
Fabio Alessi +4 more
doaj +1 more source
Visualizing Concurrency Control Algorithms for Real-Time Database Systems
Data Science Journal, 2008 This paper describes an approach to visualizing concurrency control (CC) algorithms for real-time database systems (RTDBs). This approach is based on the principle of software visualization, which has been applied in related fields.
Olusegun Folorunso +2 more
doaj +1 more source
Dynamic real-time optimistic concurrency control [PDF]
[1990] Proceedings 11th Real-Time Systems Symposium, 1990 The authors (1990) have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking. Although the optimistic algorithm used in that study, OPT-BC, did not factor in transaction deadlines in making data conflict resolution decisions, it still outperformed a deadline-cognizant locking ...
J.R. Haritsa, M.J. Carey, M. Livny
openaire +1 more source
A Concurrency Control Method Based on Commitment Ordering in Mobile Databases [PDF]
, 2011 Disconnection of mobile clients from server, in an unclear time and for an unknown duration, due to mobility of mobile clients, is the most important challenges for concurrency control in mobile database with client-server model.
Baraani-Dastjerdi, Ahmad, Karami, Ali
core +2 more sources
LF+ in Coq for "fast and loose" reasoning
Journal of Formalized Reasoning, 2019 We develop the metatheory and the implementation of LF+, and discuss several applications. LF+ capitalizes on research work, carried out by the authors over more than a decade, on Logical Frameworks.
Fabio Alessi +5 more
doaj +1 more source
Distributed optimistic concurrency control with reduced rollback [PDF]
Distributed Computing, 1987 Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described which is particularly advantageous in a query-dominant environment.
Divyakant Agrawal +3 more
openaire +1 more source
Improving transaction abort rates without compromising throughput through judicious scheduling [PDF]
, 2013 Althought optimistic concurrency control protocols have increasingly been used in distributed database management systems, they imply a trade-of between the number of transactions that can be executed concurrently, hence, the peak throughput, and ...
Nunes, Ana, Pereira, José
core +1 more source
Proving Opacity of Transactional Memory with Early Release
Foundations of Computing and Decision Sciences, 2015 Transactional Memory (TM) is an alternative way of synchronizing concurrent accesses to shared memory by adopting the abstraction of transactions in place of low-level mechanisms like locks and barriers.
Siek Konrad, Wojciechowski Paweł T.
doaj +1 more source