Scheduling Adaptive Transactions in Real-Time Databases
نویسنده
چکیده
A new transaction model, called the Adaptive Transaction Model, is proposed for Real-Time Database Management Systems (RTDBMSs) applications. The Adaptive Transaction Model is an extended transaction model with a nested structure containing optional and required subtransactions. Adaptive Transactions (ATs) have time constraints to support real-time database applications. Optional substransactions can be omitted during the execution if time does not permit. Scheduling issues for a special case of adaptive transactions, called chain-structured adaptive transactions, are discussed. Several priority-based scheduling policies are proposed and experimental results are reported under lock-based and timestamp-ordering concurrency control protocols. A priority assignment policy (MSF-MES) is found to provide superior (low) miss ratios compared to other policies.
منابع مشابه
Adaptive Co-Scheduling for Periodic Update and User Transactions in Real-Time Database Systems
In this paper, we study the co-scheduling problems of periodic user transactions and update transactions in real-time database systems for surveillance of critical events. To perform the surveillance functions effectively, it is important to meet the deadlines of all the periodic user transactions and at the same time to maintain the quality of the real-time data objects accessed by them. Unfor...
متن کاملAdaptive co-scheduling for periodic application and update transactions in real-time database systems
In this paper, we study the co-scheduling problem of periodic application transactions and update transactions in real-time database systems for surveillance of critical events. To perform the surveillance functions effectively, it is important to meet the deadlines of the application transactions while maintaining the quality of the real-time data objects accessed by them. Unfortunately, these...
متن کاملIncorporating load factor into the scheduling of soft real-time transactions for main memory databases
| Many real-time applications have very tight time constraints which couldn't be met by disk resident databases. For those applications, main memory database where entire database is stored in main memory is the proper choice. It has been shown that coarse-granule locking is better than ne-granule locking for main-memory databases. Coarse-granule locking makes it easy to extract data access pat...
متن کاملA Novel Disk Scheduling Algorithm in Real-time Database Systems
Conventional databases are mainly characterized by their strict data consistency requirements. Database systems for real-time applications must satisfy timing constraints associated with transactions. In this paper a novel disk scheduling algorithm for real-time database system is proposed. The main objective of this paper is to initiate an enquiry in Disk scheduling for real time database syst...
متن کاملCombined Locking Approach for Scheduling Hard Real-Time Transactions in Real-Time Databases
Previous work has shown the superiority of the optimistic protocols over the lock-based protocols for scheduling soft or firm real-time transactions. However, optimistic protocols cannot provide schedulability analysis for hard real-time transactions because of uncertain transaction restarts. In this paper, we develop new combined locking approach for using optimistic concurrency control to sch...
متن کامل