scholarly journals An approximate analysis of a real-time database concurrency control protocol via Markov modeling

1993 ◽  
Vol 20 (3) ◽  
pp. 36-48 ◽  
Author(s):  
Özgür Ulusoy
Keyword(s):  
Real Time ◽  
Concurrency Control ◽  
Markov Modeling ◽  
Approximate Analysis ◽  
Control Protocol ◽  
Real Time Database

Embedded Real-Time Database System Concurrency Control Protocol AC-Based OCC-FV

2012 ◽  
Vol 263-266 ◽  
pp. 1402-1406 ◽  
Author(s):  
Zhi Cheng Liu ◽  
Dong Sheng Lin ◽  
Yun Zhi Ning
Keyword(s):  
Real Time ◽  
Concurrency Control ◽  
The Body ◽  
Suitable Alternative ◽  
Optimistic Concurrency Control ◽  
Control Protocol ◽  
Safe State ◽  
Real Time Database ◽  
Basic Characteristics ◽  
Ready Queue

Alternative and compensation are not only two basic characteristics of the real-time transaction but also the body of the concurrency control. At the same time, new problems are brought. AC-Based OCC-FV protocol associates alternative and compensation with optimistic concurrency control protocol OCC-FV. For each transaction in accepted queue, an alternative which causes no conflict can be chosen to join the ready queue as soon as possible. This is just a kind of ideal circumstance. If the conflict is inevitable, it is necessary to choose a suitable alternative to join the concurrency control, but also ensures the system to be in a safe state when conflicts take place. In conflict resolution, the optimistic concurrency control protocol OCC-FV is extended in combination with the compensation characteristic, when the transaction failed, immediate dispatch of corresponding compensation transactions is taken to prevent the system from disaster.

Concurrency Control Protocol for Real-Time Database and the Analysis Base on Petri Net

2010 ◽  
Vol 143-144 ◽  
pp. 12-17
Author(s):  
Jun Chen ◽  
Yu Fen Wang ◽  
Jian Ping Wang
Keyword(s):  
Real Time ◽  
Petri Net ◽  
Concurrency Control ◽  
The Other ◽  
Time Limits ◽  
Control Protocol ◽  
Other Hand ◽  
Congestion Problems ◽  
Real Time Database ◽  
The One

In the article a new concurrency control protocol for real-time database (RTCC) is proposed. The protocol based on the traditional speculative concurrency control protocol (SCC). It dynamically establish the maximum of shadow to reasonably use the resources of system and add the quasi-commit phase to avoid many unnecessary restarting and enhance the concurrency of transaction. The theory of Petri net proof and results of experiment show that this protocol is feasible and effective , and it can meet the needs of real-time transaction. Speculative Concurrency Control is suitable especially for real-time database[1]. On the one hand, SCC is similar to PCC, to detect potentially harmful conflict as early as possible, so as to start a replacement schedule, thereby increasing the opportunities for transactions to meet time limits. On the other hand, SCC is similar to OCC, it allows the concurrency of conflict transaction and, therefore, avoids unnecessary matters that may affect the timely submission of delay. As a result, it alleviates the congestion problems and PCC restart OCC's problems, in order to better meet the transaction deadline. Based on the fact above mentioned, we propose a suitable real-time database concurrency control protocol [2,3] (RTCC: Concurrency Control protocol for Real-Time). The protocol of the SCC protocol on the traditional basis with a series of improvements can avoid a large number of unnecessary transaction restart and improve concurrency. Finally, by Petri net theory it can be proved feasible and correct.

Sign in / Sign up

Export Citation Format

Share Document