Transition scheduling in [multiclass real-time database systems

Author

Pang, HweeHwa ; Livny, Miron ; Carey, Michael J.

Author_Institution

Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA

fYear

1992

fDate

2-4 Dec 1992

Firstpage

23

Lastpage

34

Abstract

The issue of priority assignment is addressed, in firm multiclass real-time database systems (RTDBSs) where classes are distinguished by their mean sizes. It is shown that the earliest deadline scheduling principle, upon which a number of existing priority assignment policies are based, discriminates significantly against longer transactions. This observation has motivated the development of a novel dynamic priority assignment scheme that improves the chances for long transactions to meet their time constraints, thereby providing a fairer mechanism for use in multiclass RTDBS transaction scheduling

Keywords

concurrency control; distributed databases; real-time systems; scheduling; transaction processing; earliest deadline scheduling principle; existing priority assignment policies; firm multiclass real-time database systems; long transactions; multiclass RTDBS transaction scheduling; novel dynamic priority assignment scheme; priority assignment; time constraints; Concurrency control; Database systems; Displays; Real time systems; Resource management; Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1992

Conference_Location

Phoenix, AZ

Print_ISBN

0-8186-3195-3

Type

conf

DOI

10.1109/REAL.1992.242679

Filename

242679