Transaction Scheduling Technique Using Double Locking in a Soft Real-Time Database System


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 3, pp. 639-648, Mar. 1997
10.3745/KIPSTE.1997.4.3.639,   PDF Download:

Abstract

As the areas of computer application are expanded, the real-time application environments that must process as many transaction as possible within their deadlines have been increased recently. Conventional disk based database system is not appropriate in real-time transaction processing due to delaying time for disk I/O processing. When the system is overloaded, the performance of transaction scheduling technique using earliest deadline first deteriorates rapidly because it can assign the highest priority to a transaction that has already missed or is about to miss its deadline. Therefore, the performance of suggested transaction scheduling technique in made to be improved by proposing the double locking mechanism based on priority. Finally, in order to evaluate the performance of the proposed priority-based double locking techniques under single processor and main memory database system environments, the simulation model was developed using the SLAM II language.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. E. In and K. B. Oh, "Transaction Scheduling Technique Using Double Locking in a Soft Real-Time Database System," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 3, pp. 639-648, 1997. DOI: 10.3745/KIPSTE.1997.4.3.639.

[ACM Style]
Choi Eui In and Koh Byoung Oh. 1997. Transaction Scheduling Technique Using Double Locking in a Soft Real-Time Database System. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 3, (1997), 639-648. DOI: 10.3745/KIPSTE.1997.4.3.639.