Real-Time Access Control and Reservation on B-Tree Indexed Data
Resource
Real-Time Systems 19 (3): 245-281
Journal
Real-Time Systems
Journal Volume
19
Journal Issue
3
Pages
245-281
Date Issued
2000
Date
2000
Author(s)
Abstract
This paper proposes methodologies to control the access of B+-tree-indexed data in a batch and firm real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B+-tree-indexed data based on the non-real-time algorithms proposed in Kerttu, Eljas, and Tatu (1996) and the idea of priority inheritance. We propose methodologies to reduce the number of disk I/O to improve the system performance without introducing more priority inversion. When the schedulability of requests with critical timing constraints is highly important, we propose a mechanism for data reservation based on the idea of preemption level and the Stack Resource Policy. The performance of our methodologies was evaluated by a series of experiments, from which we have obtained encouraging results.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
03.pdf
Size
408.48 KB
Format
Adobe PDF
Checksum
(MD5):4f48f5fb39d715b6fbdd742a0dc53a79