Real-Time Access Control and Reservation on B-Tree IndexedData

  • Authors:

  • Tei-Wei Kuo;Chih-Hung Wei;Kam-Yiu Lam

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 621, ROC;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 621, ROC;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

  • Venue:
  • Real-Time Systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper proposes methodologiesto control the access of B ^+-tree-indexed datain a batch and firm real-time fashion. Algorithms are proposedto insert, query, delete, and rebalance B ^+-tree-indexeddata based on the non-real-time algorithms proposed in Kerttu,Eljas, and Tatu (1996) and the idea of priority inheritance (Sha,Rajkumar, and Lehoczky, 1990). We propose methodologies to reducethe number of disk I /O to improve the system performancewithout introducing more priority inversion. When the schedulabilityof requests with critical timing constraints is highly important,we propose a mechanism for data reservation based on the ideaof preemption level and the Stack Resource Policy (Baker, 1990).The performance of our methodologies was evaluated by a seriesof experiments, from which we have obtained encouraging results.