Advertisement

An Adaptive Value-Based Scheduler and Its RT-Linux Implementation

  • S. Swaminathan
  • G. Manimaran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2552)

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.

Keywords

Success Ratio Heuristic Function Task Queue Propose Schedule Scheme Branch Function 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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, 165CrossRefGoogle Scholar
  2. [2]
    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, 164CrossRefGoogle Scholar
  3. [3]
    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, 164Google Scholar
  4. [4]
    S. A. Aldarmi, and A. Burns, “Time-cognizant value functions for scheduling realtime systems,” Technical Report #YCS-306, University of York, Oct. 1998. 163Google Scholar
  5. [5]
    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. 163Google Scholar
  6. [6]
    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. 164Google Scholar
  7. [7]
    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. 164Google Scholar
  8. [9]
    Michael Barbanov and Victor Yodaiken, “Real-Time Linux,” Linux Journal, Mar. 1996. 168Google Scholar
  9. [10]
    S. Swaminathan, “Value-based scheduling in real-time systems,” M.S Thesis, Iowa State University, 2002. 170Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • S. Swaminathan
    • 1
  • G. Manimaran
    • 1
  1. 1.Dependable Computing & Networking Laboratory Department of Electrical and Computer EngineeringIowa State UniversityAmesUSA

Personalised recommendations