Skip to Main Content
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.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.