EDF-Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real-Time. (13th December 2021)

• Record Type: Journal Article
• Authors: Huang, Shujuan; Li, Tiansen; Ma, Zhihao; Xiao, Feng; Zhang, Wenjuan
• Other Names: Sun Gengxin Academic Editor.
• Is Part Of: Journal of sensors. Volume 2021(2021)
• Publication Date: 2021-12-13
• Subjects: Detectors -- Periodicals; 681.205
• DOI: 10.1155/2021/6377024
• Languages: English
• ISSNs: 1687-725X

Abstract

Abstract : Most of the multiprocessor real-time scheduling algorithms follow the partitioned approach, the global approach, or the semipartitioned approach which is a hybrid of the first two by allowing a small subset of tasks to migrate. EDF-fm (Earliest Deadline First-based Fixed and Migrating) and EDF-os (Earliest Deadline First-based Optimal Semipartitioned) are semipartitioned approaches and were proposed for soft real-time sporadic task systems. Despite their desirable property that migrations are boundary-limited such as they can only occur at job boundaries, EDF-fm and EDF-os are not always optimal and have higher tardiness and cost of overheads due to task migration. To address these issues, in this paper, we classify the systems into different types according to the utilization of their tasks and propose a new semipartitioned scheduling algorithm, earliest deadline first-adaptive, dubbed as EDF-adaptive. Our experiments show that EDF-adaptive can achieve better performance than EDF-fm and EDF-os, in terms of system utilization and tardiness overhead. It is also proved that EDF-adaptive is able to lessen the task migration overhead, by reducing the number of migrating jobs and the number of processors to which a task is migrated.