Interval assignment for periodic transactions in real-time database systems

Hidenori Nakazato*, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The problem of assigning execution intervals for periodic transactions in real-time databases is discussed. The object value evolution rate and the importance of the object are used as two factors for deciding transaction periods. Two different objective functions are defined to reflect different system design goals. Algorithms for optimizing each objective function are presented. The principle behind these algorithms is to allow the transactions which have higher weights to be executed more often. It is assumed that systems use the rate monotonic algorithm for scheduling transactions. Many other scheduling algorithms, like the earliest deadline first algorithm, can also be used. Some examples using the proposed algorithms are given.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Pages378-385
Number of pages8
ISBN (Print)0818621389
StatePublished - 04 1991
Externally publishedYes
EventProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
Duration: 08 04 199112 04 1991

Publication series

NameProceedings - International Conference on Data Engineering

Conference

ConferenceProceedings of the 7th International Conference on Data Engineering
CityKobe, Jpn
Period08/04/9112/04/91

Fingerprint

Dive into the research topics of 'Interval assignment for periodic transactions in real-time database systems'. Together they form a unique fingerprint.

Cite this