LEAT research laboratory, University of Nice-Sophia Antipolis, Nice, France

---

Abstract—The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Scheduling Algorithm (2L-HiSA), to address this sub-optimality. 2L-HiSA algorithm divides the problem of multiprocessor scheduling into a two-level hierarchy of schedulers. This algorithm works in two phases: i- A taskpartitioning phase in which, each task from application task set is assigned to a specific processor by following simple bin-packing approach. If a task can not be partitioned on any processor in the platform, it qualifies as migrating task. ii- A processor-grouping phase in which, processors are clustered together such that, per cluster, the unused fragmented computation power equivalent to at most one processor is available. We provide schedulability analysis and experimental evaluation to support our proposition. Moreover, our simulation results show an average difference of 18-folds in the number of preemptions and 10-folds in the number of task migrations under 2L-HiSA and PD2 algorithm.

Index Terms—Real-time Systems, Multiprocessor, Scheduling, EDF, Partitioned scheduling, Global scheduling.

[PDF]

Cite: Muhammad Khurram Bhatti, C´ecile Belleudy, Michel Auguin, "Two-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems," Journal of Software vol. 6, no. 11, pp. 2308-2320, 2011.