PRIORITY ASSIGNMENT IN DISTRIBUTED REAL-TIME DATABASES SUPPORTING TEMPORAL CONSISTENCY

Real-time database applications require not only logical consistency b ut also data temporal consistency in order to support transactions tha t have to respond to outside-world events in a timely fashion. Virtual ly, temporal constraints represent other deadlines for the transaction s. It becomes important to have an effective and efficient priority as signment mechanism co-operating with an appropriate scheduling algorit hm to satisfy both time and temporal constraints. In this paper, the i ssues associated with temporal consistency are addressed and two new p riority assignment policies are presented that can effectively help lo ng, global transactions meet their deadlines with a much lower probabi lity of temporal consistency violation.