Efficient semi-partitioning and rate-monotonic scheduling hard real-time tasks on multi-core systems

Naghibzadeh, Mahmoud; Neamatollahi, Peyman; Ramezani, Reza; Rezaeian, Amin; Dehghani, Toktam

doi:10.1109/sies.2013.6601476

Cited by 13 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In some other research, the processor utilization is raised up to the well-known L&L bound (L&L bound = n*(2 1/n -1)) [7,9,10]. The distinctive points of these papers are the allocation method and definition of tasks.…”

Section: Related Workmentioning

confidence: 99%

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

Senobary¹,

Naghibzadeh

2014

Journal of Computing Science and Engineering

Self Cite

View full text Add to dashboard Cite

Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

show abstract

Section: Related Workmentioning

confidence: 99%

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

Senobary¹,

Naghibzadeh

2014

Journal of Computing Science and Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…With respect to Figure 1, the proposed scheduling model has a segmented shared memory for the set of tasks of each component. It can be used to take the advantage of simultaneous sharing of memory by multiple tasks [24].…”

Section: Scheduler Modelmentioning

confidence: 99%

A super scheduler model for hierarchical real-time systems with capability of urgent tasks scheduling

Dependable

Sedaghat

2014

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)

View full text Add to dashboard Cite

The design of real-time systems for safety-critical applications depends heavily on the normal operation of system, in critical conditions. In these applications, among of real-time tasks, a critical task must be immediately scheduled at its arrival time immediately; otherwise, it leads to a system failure and disasters in safety-critical applications. A major problem in real-time systems included critical tasks, is unpredictable arrival of these tasks. To resolve the problem, a kind of scheduler, called "super scheduler", is employed. The problem can be more complex, in a hierarchical real-time system. A hierarchical real-time system consists of several realtime sub-systems, called "components" .Hence, using super scheduler for each component of the system, needs to special considerations. On the arrival of a critical task, the super scheduler preempts the currently running tasks and alters the priority of all existence tasks. When the critical task is completed, the preempted tasks are executed in their new priority order. This guarantees the completion of the critical and almost all other non-critical tasks before their deadlines, and therefore the stability of the component. To guarantee the stability of a hierarchical real-time system, all its components should be stable. This paper presents a model to guarantee the stability of a hierarchical real-time system included a critical task in each component. Moreover, a fault tolerance method has been applied for all components. Evaluation results show that the proposed technique improves the stability of a hierarchical real-time system included critical tasks by decreasing the number of tasks which miss their deadline.

show abstract

“…Because task migration to another processor is prohibited which have enough capacity for executing the tasks, this causes a reduction of schedulable workload utilization. In semipartitioned approach, few tasks are splitted into sub tasks, which can utilize the unused capacity of processors to increase the utilization of processors [5]. But this approach increases the number of preemptions and preemption overhead of tasks, and decrease the schedulable utilization of a task set.…”

Section: Introductionmentioning

confidence: 99%

Overhead Based Cluster Scheduling of Mixed Criticality Systems on Multicore Platform

Ali,

Khattak,

Iqbal

et al. 2023

IEEE Access

View full text Add to dashboard Cite

The cluster-based technique is gaining focus for scheduling tasks of mixed-criticality (MC) real-time multicore systems. In this technique, the cores of the MC system are distributed in groups known as clusters. When all cores are distributed in clusters, the tasks are partitioned into clusters, which are scheduled on the cores within each cluster using a global approach. In this study, a cluster-based technique is adopted for scheduling tasks of real-time mixed-criticality systems (MCS). The Decreasing Criticality Decreasing Utilization with the worst-fit (DCDU-WF) technique is used for partitioning of tasks to clusters, whereas a novel mixed-criticality cluster-based boundary fair (MC-Bfair) scheduling approach is used for scheduling tasks on cores within clusters. The MC-Bfair scheduling algorithm reduces the number context switches and migration of tasks, which minimizes the overhead of mixed-criticality tasks. The migration and context switch overhead time is added at the time of each migration and context switch respectively for a task. In low critical mode, the low mode context switch and migration overhead time is added to task execution time, while the high mode overhead time of migration and context switch is added to the execution time of a task in high critical mode. The results obtained from experiments show the better schedulablity performance of proposed cluster-based technique as compared to cluster-based fixed priority (CB-FP), MC-EKG-VD-1, global and partitioned scheduling techniques e.g., for target utilization U=0.6, the proposed technique schedule 66.7% task sets while MC-EKG-VD-1, CB-FP, partitioned and global techniques schedule 50%, 33.3%, 16.7% and 0% task sets respectively.

show abstract

Efficient semi-partitioning and rate-monotonic scheduling hard real-time tasks on multi-core systems

Cited by 13 publications

References 8 publications

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

A super scheduler model for hierarchical real-time systems with capability of urgent tasks scheduling

Overhead Based Cluster Scheduling of Mixed Criticality Systems on Multicore Platform

Contact Info

Product

Resources

About