Hierarchical Real-Time Scheduling Framework for Imprecise Computations

Hierarchical scheduling frameworks provide ways for composing large and complex real-time systems from independent sub-systems. In this paper, we consider the imprecise reward-based periodic task model in a compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability analysis of mandatory parts is analyzed to meet the minimum requirement of tasks. In addition, we provide a scheduling algorithm for guaranteeing a certain amount of reward, which makes it feasible to compose multiple imprecise components efficiently.