Scheduling and Priority Mapping for Static Real-Time Middleware

摘要

This paper presents a middleware real-time scheduling technique for static, distributed, real-time applications. The technique uses global deadline monotonic priority assignment to clients and the Distributed Priority Ceiling protocol to provide concurrency control and priorities for server execution. The paper presents A new algorithm for mapping the potentially large number of unique global priorities required by this scheduling Technique to the restricted set of priorities provided by commercial real-time operating systems.