Real-time task scheduling anomaly

Abstract

This research is motivated by the practical needs in the porting of embedded software over platforms and the well-known multiprocessor anomaly [2, 3]. In particular, we consider the task scheduling problem when the system configuration changes. We show that new violations of the timing constraints of tasks might occur even when a more powerful processor or device is adopted. The concept of scheduler stability and rules are then proposed to prevent scheduling anomaly from happening for task executions that might be involved with task synchronization or I/O access. Finally, we explore policies in bounding the the duration time of scheduling anomaly.