Optimal scheduling strategies for real-time computers

  • Authors:
  • U. Herzog

  • Affiliations:
  • Institute for Switching Techniques and Data Processing, University of Stuttgart, West Germany

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to fulfill response time constraints in real-time systems, demands are often handled by means of sophisticated scheduling strategies. This paper first shows how to describe and analyze arbitrary combinations of preemptive and non-preemptive (head-of the-line) priority strategies and, second, presents an algorithm that yields the optimal priority strategy, taking into consideration constraints on the response time.