Priority assignment in distributed real-time databases supporting temporal consistency

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

2 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)245-259
Journal / PublicationIntegrated Computer-Aided Engineering
Volume5
Issue number3
Publication statusPublished - 1998

Abstract

Real-time database applications require not only logical consistency but also data temporal consistency in order to support transactions that have to respond to outside-world events in a timely fashion. Virtually, temporal constraints represent other deadlines for the transactions. It becomes important to have an effective and efficient priority assignment mechanism co-operating with an appropriate scheduling algorithm to satisfy both time and temporal constraints. In this paper, the issues associated with temporal consistency are addressed and two new priority assignment policies are presented that can effectively help long, global transactions meet their deadlines with a much lower probability of temporal consistency violation.