Similarity-based load adjustment for real-time data-intensive applications

Authors:
Shao-Juen Ho;Tei-Wei Kuo;A. K. Mok
Affiliations:
-;-;-
Venue:
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Year:
1997

Citing 0
Cited 10

Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics

IEEE Transactions on Knowledge and Data Engineering
Dynamic on-demand updating of data in real-time database systems

Proceedings of the 2004 ACM symposium on Applied computing
Deriving Deadlines and Periods for Real-Time Update Transactions

IEEE Transactions on Computers
Real-Time Databases and Data Services

Real-Time Systems
Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions

IEEE Transactions on Knowledge and Data Engineering
On earliest deadline first scheduling for temporal consistency maintenance

Real-Time Systems
DESH: overhead reduction algorithms for deferrable scheduling

Real-Time Systems
Adaptive co-scheduling for periodic application and update transactions in real-time database systems

Journal of Systems and Software
Maintaining data temporal consistency in distributed real-time systems

Real-Time Systems
An effective fixed priority co-scheduling algorithm for periodic update and application transactions

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

How to exploit application semantics to improve the performance of a real-time data-intensive application has been an active research topic in the past few years. Weaker correctness criteria and semantics-based concurrency control algorithms were proposed to provide more flexibility in reordering read and write events. Distinct from the past work, this paper exploits the tradeoff between data consistency and system workload. The definition of similarity is combined with the idea of transaction skipping to provide a theoretical foundation for reducing the workload of a transaction system. We also propose guidelines to adjust the execution frequencies of a static set of transactions and prove their correctness. The strengths of this work were verified by simulation experiments on an air traffic control example (Peng et al., 1997).