Earliest Deadline Message Scheduling with Limited PriorityInversionAntonio


This paper presents an innovative approach for scheduling network messages with real-time dynamic algorithms. The solution described in this work takes advantage of the increased network utilization allowed by dynamic scheduling methods and bounds at the same time the priority invertion phenomena caused by the lack of a suucient number of priority levels. We give a very simple formula for checking the schedulability of a set of real-time packetized messages, and we show that the penalty introduced by priority inversion can be bounded within a satisfactory predictable range.


0 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)