Data Consistency in Hard Real-Time Systems

Neil C. Audsley; Alan Burns; Mike F. Richardson; Andy J. Wellings

Data Consistency in Hard Real-Time Systems

Neil C. Audsley, Alan Burns, Mike F. Richardson, Andy J. Wellings

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The incorporation of database technology into hard real-time systems presents an important but difficult challenge to any system designer. Notions of consistency and failure atomicity are attractive for architects of dependable hard real-time applications. Unfortunately the hard real-time requirements of bounded access times are not easily imposed upon the concurrency control methods usually found in current database models. The model of data consistency presented here uses temporal consistency constraints in order to ensure that data values are sufficiently recent to be usable. Blocking is avoided by imposing the restriction that only one type of transaction can write to a particular data object, and by using a nonblocking access mechanism. Data itself is considered to be either perishable or non-perishable.

Original language	Undefined/Unknown
Journal	Informatica (Slovenia)
Volume	19
Issue number	2
Publication status	Published - 1993

Access to Document

http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.7791

Cite this

@article{33e361e906dc4c35a284a885d1e789d9,

title = "Data Consistency in Hard Real-Time Systems",

abstract = "The incorporation of database technology into hard real-time systems presents an important but difficult challenge to any system designer. Notions of consistency and failure atomicity are attractive for architects of dependable hard real-time applications. Unfortunately the hard real-time requirements of bounded access times are not easily imposed upon the concurrency control methods usually found in current database models. The model of data consistency presented here uses temporal consistency constraints in order to ensure that data values are sufficiently recent to be usable. Blocking is avoided by imposing the restriction that only one type of transaction can write to a particular data object, and by using a nonblocking access mechanism. Data itself is considered to be either perishable or non-perishable. ",

author = "Audsley, {Neil C.} and Alan Burns and Richardson, {Mike F.} and Wellings, {Andy J.}",

year = "1993",

language = "Undefined/Unknown",

volume = "19",

journal = "Informatica (Slovenia)",

number = "2",

}

TY - JOUR

T1 - Data Consistency in Hard Real-Time Systems

AU - Audsley, Neil C.

AU - Burns, Alan

AU - Richardson, Mike F.

AU - Wellings, Andy J.

PY - 1993

Y1 - 1993

N2 - The incorporation of database technology into hard real-time systems presents an important but difficult challenge to any system designer. Notions of consistency and failure atomicity are attractive for architects of dependable hard real-time applications. Unfortunately the hard real-time requirements of bounded access times are not easily imposed upon the concurrency control methods usually found in current database models. The model of data consistency presented here uses temporal consistency constraints in order to ensure that data values are sufficiently recent to be usable. Blocking is avoided by imposing the restriction that only one type of transaction can write to a particular data object, and by using a nonblocking access mechanism. Data itself is considered to be either perishable or non-perishable.

AB - The incorporation of database technology into hard real-time systems presents an important but difficult challenge to any system designer. Notions of consistency and failure atomicity are attractive for architects of dependable hard real-time applications. Unfortunately the hard real-time requirements of bounded access times are not easily imposed upon the concurrency control methods usually found in current database models. The model of data consistency presented here uses temporal consistency constraints in order to ensure that data values are sufficiently recent to be usable. Blocking is avoided by imposing the restriction that only one type of transaction can write to a particular data object, and by using a nonblocking access mechanism. Data itself is considered to be either perishable or non-perishable.

M3 - Article

VL - 19

JO - Informatica (Slovenia)

JF - Informatica (Slovenia)

IS - 2

ER -