Abstract
Real-time systems often consist of a number of independent processes which operate under an age constraint. In such systems, the maximum time from the start process L i in cycle k to the end in cycle k+1 must not exceed the age constraint A i for that process. The age constraint can be met by using fixed priority scheduling and periods equal to A i /2. However, this approach restricts the number of process sets which are schedulable.
In this paper, we define a method for obtaining process periods other than A i /2. The periods are calculated in such a way that the age constraints are met. Our approach is better in the sense that a larger number of process sets can be scheduled compared to using periods equal to A i /2.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Albrecht, and R. Wisser, “Schedulers for Age Constraint Tasks and Their Performance Evaluation”, In Proceedings of the Third International Euro-Par Conference, Passau, Germany, August 1997.
N. C. Audsley, A. Burns, M.F. Richardson, and A.J. Wellings, “Absolute and Relative Temporal Constraints in Hard Real-Time Databases”, In Proceedings of IEEE Euromicro Workshop on Real-Time Systems, Los Alamitos, California, February 1992.
A. Burns, and A. Wellings, “Real-Time Systems and Programming Languages”, Addison-Wesley, 1996.
J.P. Lehoczky, L. Sha, and Y. Ding, “The rate monotone scheduling algorithm: exact characterization and average case behavior”, In Proceedings of IEEE 10th Real-Time Systems Symposium, December 1989.
X. Song, and J. Liu, “How Well can Data Temporal Consistency be Maintained”, In Proceedings of the 1992 IEEE Symposium on Computer Aided Control Systems design, Napa, California, USA, March 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lundberg, L. (1998). Fixed priority scheduling of age constraint processes. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057864
Download citation
DOI: https://doi.org/10.1007/BFb0057864
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive