ARQ Supportive EDF Scheduling for Wireless Networks Servicing Real-Time Applications

Chung, Jong-Moon; Jo, Sung-Woong; Ahn, Myong Hwan

doi:10.1109/lcomm.2013.052013.130261

Cited by 2 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we evaluate the performance of EDFadaptive by generating task sets for the SRT system and 𝜏 3 (3,4) 𝜏 4 (2,3) 𝜏 5 (3,5) 𝜏 6 (1,2) Journal of Sensors compare it with EDF-fm and EDF-os against five criteria as follows:…”

Section: Discussionmentioning

confidence: 99%

“…For example, τ 2 is assigned to P 1 and P 2 , and its utilization has been divided into two parts: u 2,1 = 1/10 and u 2,2 = u 2 − u 2,1 = 29/60; that means, τ 2 is a migrating task. 𝜏 3 (3,4) 𝜏 4 (2,3) 𝜏 5 (3,5) 𝜏 6 (1,2)…”

Section: Taskmentioning

confidence: 99%

“…Because the former assigns tasks statically to processors and does not allow the tasks to migrate, it cannot achieve higher system utilization whereas the latter schedules tasks from a single run queue and the task hence can be migrated [1]. Although the global approach can attain higher system utilization but migrating tasks entails higher run-time overheads, especially in soft real-time (SRT) systems, many approaches have been proposed, based on these two algorithms [2][3][4][5][6] or the hybrid of the two [7][8][9][10][11][12][13][14][15][16][17][18]. Some approaches are aimed at reducing the switch context or preemption overheads and achieving higher system utilization [19][20][21][22].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

EDF‐Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real‐Time

Huang

et al. 2021

Journal of Sensors

View full text Add to dashboard Cite

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.

show abstract