Conference Paper

Concurrency control for real-time database systems with mixedtransactions

Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon;
DOI: 10.1109/RTCSA.1997.629179 Conference: Proceedings - Fourth International Workshop on Real-Time Computing Systems and Applications
Source: IEEE Xplore

ABSTRACT This paper proposes a real-time concurrency control protocol called Reduced Ceiling Protocol (RCP) for database systems consisting of hard and soft real-time transactions. In the RCP, the schedulability of hard real-time transactions is guaranteed by reserving the data items for them and by eliminating the blocking time from soft real-time transactions. Different concurrency control strategies are used to resolve the data conflicts between different combinations of hard and soft real-time transactions. We have shown the characteristics of the schedules generated from the RCP. Simulation experiments have been performed to study the performance of the RCP as compared with the optimistic concurrency control with broadcast commit (OCC-BC). It has been found that the RCP can guarantee the performance of the hard real-time transactions and at the same time reduce the number of deadline missing of the soft real-time transactions

0 Bookmarks
 · 
62 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Although many efficient concurrency control protocols have been proposed for real-time database systems, they are mainly designed for those systems with a single type of real-time transaction. Due to the very different performance requirements of each type of real-time transaction, these proposed protocols may not be suitable for mixed real-time database systems (MRTDBSs), where different types of real-time transactions, and even non-real-time transactions, may co-exist in the systems at the same time. In this paper, we propose strategies for resolving data conflicts between different types of transactions in a MRTDBS so that their different performance requirements can be achieved and, at the same time, the overall system performance can be improved. The performance of the proposed strategies is evaluated and compared with a real-time optimistic approach. The performance of our proposed conflict resolution methods has also been investigated in a more realistic environment with a limited number of priority levels and disk-resident data items
    Real-Time Systems, 2000. Euromicro RTS 2000. 12th Euromicro Conference on; 02/2000
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Although many efficient concurrency control protocols have been proposed for real-time database systems, they are mainly restricted for systems with a single type of real-time transactions or a mixed set of soft real-time and non-real-time transactions only. Their performance objective usually aims at the minimization of the number of missed deadlines of soft real-time transactions or to guarantee the deadline satisfaction of hard real-time transactions. So far, it is still lack of any good study on the design of concurrency control strategies for mixed real-time database systems (MRTDBS), which consist of both hard and soft real-time transactions, and together with non-real-time transactions. Due to the very different performance requirements of hard and soft real-time transactions, existing real-time concurrency control protocols may not be suitable to MRTDBS. In this paper, we propose strategies for resolving data conflicts between different types of transactions in an MRTDBS so that the performance requirements of each individual transaction type can be satisfied and, at the same time, the overall system performance can be improved. The performance of the proposed strategies is evaluated and compared with a real-time optimistic approach, which has been shown to give a better performance than the lock-based protocols for soft and firm real-time transactions.
    Journal of Systems and Software. 01/2002;
  • 01/2001