DMCA
A Worst-Case Behaviour Analysis for Hard Real-Time Transactions
| Citations: | 1 - 0 self |
BibTeX
@MISC{Byun_aworst-case,
author = {Jeongyong Byun and Alan Burns and Andy Wellings},
title = {A Worst-Case Behaviour Analysis for Hard Real-Time Transactions},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Most hard real-time systems that incorporate database components assume that the data is resident in main memory. For these systems, priority ceiling protocols can be used to limit priority inversion. In this paper we consider disk resident data, additionally we assume optimistic concurrency control with abort and restart. Hence, when a high priority transaction requires access to the disk it will cause any lower level transactions that are accessing the disk to be aborted. Analysis is presented that allows the worst case response times of transactions to be calculated. A feature of this analysis is that the I/O channel and the CPU are considered separately. Thus while a high priority transaction is using the channel, a lower priority transaction may gain access to the CPU. 1 Introduction A data-intensive hard real-time system may require a real-time database system (RTDBS) which should be guaranteed to satisfy hard timing constraints. In order to deal with hard real-time transactions...
Keyphrases
hard real-time transaction worst-case behaviour analysis high priority transaction priority inversion level transaction disk resident data data-intensive hard real-time system main memory priority ceiling protocol real-time database system case response time optimistic concurrency control database component hard real-time system hard timing constraint priority transaction
