Title
Scheduling for Absolute Temporal Consistency
Abstract
We address temporal consistency issues in a real-time system. The terms absolute and relative consistency characterize the temporal consistency. A function called age is introduced to express the temporal knowledge. It contains knowledge about the rate at which a process variable evolves. A scheduling problem with absolute temporal consistency as a scheduling constraint is formulated. For the dynamic scheduling in the occurrence of unpredictable events, the application of reactive scheduling techniques is briefly discussed. Problems that arise when such techniques are used in the presence of real-time constraints are highlighted.
Year
Venue
Keywords
1993
Knowledge-Based Reactive Scheduling
KNOWLEDGE REPRESENTATION FORMALISMS AND METHODS,ROBOTICS,MISCELLANEOUS
Field
DocType
Volume
Sequential consistency,Scheduling (computing),Computer science,Algorithm,Temporal consistency
Conference
15
ISSN
ISBN
Citations 
0926-5481
0-444-81814-6
0
PageRank 
References 
Authors
0.34
1
5
Name
Order
Citations
PageRank
Prasad Raja1237.33
L. Ruiz201.01
J. Hernandez300.34
Guevara Noubir488775.90
Marc Riese500.68