Abstract
In dynamic real-time systems, value-based scheduling aims to achieve graceful degradation during overloads, in addition to maintaining a high schedulability during normal and underloads. The objective of this paper is twofold: (1) to propose an adaptive value-based scheduler for multiprocessor real-time systems aimed at maintaining a high system value with less deadline misses, and (2) to present the implementation of the proposed scheduler in a Linux based real-time operating system, RT-Linux, which in its current form does not employ a notion of task value. We evaluate the performance of the proposed scheduler in terms of two performance metrics, namely, “value ratio” and “success ratio” through both simulation and implementation.
This research was supported in part by the NSF under grant CCR-0098354.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Ramamrithnam, J. Stankovic, and P. F. Shiah, “Efficient scheduling algorithms for multiprocessor real-time systems”, IEEE Tran. Parallel and Distributed Systems, vol. 1, no. 2, pp. 184–194, Apr. 1990. 163, 165
A. Burns, D. Prasad, A. Bondavalli, F. Di Giandomenico, K. Ramamritham, J. Stankovic, and L. Strigini, “The meaning and role of value in scheduling flexible real-time systems,” Journal of Systems Architecture, vol. 46, pp. 305–325, 2000. 163, 164
S. A. Aldarmi and A. Burns, “Dynamic value-density for scheduling real-time systems,” In Proc. of 11th Euromicro Conference on Real-Time Systems, pp. 270–277, June 1999. 163, 164
S. A. Aldarmi, and A. Burns, “Time-cognizant value functions for scheduling realtime systems,” Technical Report #YCS-306, University of York, Oct. 1998. 163
S. Swaminathan and G. Manimaran, “Areliab ility-aware value-based scheduler for dynamic multiprocessor real-time systems,” in Proc. IEEE Intl. Workshop on Parallel and Distributed Real-Time Systems, 2002. 163
G. Buttazzo, M. Spuri and F. Sensini, “Value vs. deadline scheduling in overload conditions,” in Proc. IEEE Real-Time Systems Symposium, pp. 90–99, Dec. 1995. 164
G. Buttazzo, and John A. Stankovic, “RED: Robust Earliest Deadline scheduling,” in Proc. 3rd Intl. Workshop on Responsive Computing Systems, pp. 100–111, Sep. 1993. 164
Michael Barbanov and Victor Yodaiken, “Real-Time Linux,” Linux Journal, Mar. 1996. 168
S. Swaminathan, “Value-based scheduling in real-time systems,” M.S Thesis, Iowa State University, 2002. 170
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swaminathan, S., Manimaran, G. (2002). An Adaptive Value-Based Scheduler and Its RT-Linux Implementation. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive