A design pattern-based approach for automatic choice of semi-partitioned and global scheduling algorithms

Magdich, Amina; Kacem, Yessine Hadj; Kerboeuf, Mickaël; Mahfoudhi, Adel; Abid, Mohamed

doi:10.1016/j.infsof.2018.01.002

Cited by 9 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Semipartitioned scheduling extends the partitioned scheduling by allowing a (usually small) subset of tasks to migrate, and these tasks cannot be feasibly assigned to two or more processors by a partitioned scheduling algorithm [23][24][25][26]. This type of approach is different from the global ones as the former use push migrations which are planned before execution whereas the latter use pull migrations which are reactive in nature and more difficult to account for and implement efficiently.…”

Section: Introductionmentioning

confidence: 99%

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

Section: Introductionmentioning

confidence: 99%

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

show abstract

“…In RTOS, selecting the scheduling algorithm is a critical task, and it will be decided based on the characteristics of the RTOS and the process type [2]. The scheduler can be divided into two categories, static and dynamic, which depends on the priority they follow in selecting the process for execution.…”

mentioning

confidence: 99%

Hybrid Scheduler (S_LST) for Soft Real-Time System based on Static and Dynamic Algorithm

Teraiya¹,

Shah²

2019

IJEAT

View full text Add to dashboard Cite

In the Soft Real-Time System scheduling process with the processor is a critical task. The system schedules the processes on a processor in a time interval, and hence the processes get chance to executes on the processor. Priority-driven scheduling algorithms are sub-categorized into mainly two categories called Static Priority and Dynamic Priority Scheduler. Critical Analysis of more static and dynamic priority scheduling algorithms have been discussed in this paper. This paper has covered the static priority algorithms like Rate Monotonic (RM) and Shortest Job First (SJF) and the dynamic priority algorithms like Earliest Deadline First (EDF) and Least Slack Time First (LST). These all algorithms have been analyzed with preemptive process set and this paper has considered all the process set are periodic. This paper has also proposed a hybrid approach for efficient scheduling. In a critical analysis, it has been observed that while scheduling in underload situation dynamic priority algorithms perform well and even EDF also make sure that all process will meet their deadline. However, in an overload situation, the performance of dynamic priority algorithms reduce quickly, and most of the task will miss its deadline, whereas static priority scheduling algorithms miss a few deadlines, even it is possible to schedule all processes in underload situation, whereas in an overload situation, the static algorithms perform well compared to the dynamic scheduler. This paper is proposing one Hybrid algorithm call S_LST which uses the concept of LST and SJF scheduling algorithm. This algorithm has been applied to the periodic task set, and observations are registered. We have observed the Success Ratio (SR) & Effective CPU Utilization (ECU) and compared all algorithms in the same conditions. It is noted that instead of using LST and SJF as an independent algorithm, Hybrid algorithm S_LST performs well in underload and overload scenario. Practical investigations have been led on a huge dataset. Data Set consists of the 7000+ process set, and each process set has one to nine processes and load varies between 0.5 to 5. It has been tried on 500-time unit to approve the rightness everything being equal.

show abstract

A Thermal-Aware Scheduling Algorithm for Reducing Thermal Risks in DAG-Based Applications in Cyber-Physical Systems

Ali

Shehzad

Bashir

et al. 2023

Communications in Computer and Information Science

View full text Add to dashboard Cite

A design pattern-based approach for automatic choice of semi-partitioned and global scheduling algorithms

Cited by 9 publications

References 9 publications

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

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

Hybrid Scheduler (S_LST) for Soft Real-Time System based on Static and Dynamic Algorithm

A Thermal-Aware Scheduling Algorithm for Reducing Thermal Risks in DAG-Based Applications in Cyber-Physical Systems

Contact Info

Product

Resources

About