A Hierarchical Scheme for Open System Environments Review

Abstract

This paper focus on hierarchical scheduling for real-time applications for open embedded system environments constructed by the total bandwidth server, according to its algorithms, when a job at the head of the server's ready queue completes, the server budget is replenished immediately if the ready queue is not empty. This paper gives some examples to the solutions proposed by Deng et al for a two-level hierarchical scheduling model in which the global level of the system is earliest deadline first, and the local scheduler could be any algorithm. The scheduling algorithms and schedulability analysis for the tasks are reviewed in an open system where the applications could be modeled as executing on a slow processor.