Multi-core partitioned scheduling for fixed-priority periodic real-time tasks with enhanced RBound

Fan, Ming; Han, Qiushi; Quan, Gang; Ren, Shangping

doi:10.1109/isqed.2014.6783338

Cited by 5 publications

(13 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Monotonic Scheduling (RMS) [86,44,73,43] is a popular fixed-priority scheduling method for periodic real-time tasks where task priorities are directly related to the periods. The larger the period is, the lower the priority is.…”

Section: Priority-driven Vs Non-priority-drivenmentioning

confidence: 99%

“…First Fit (FF), Best Fit (BF), and Worst Fit (WF) have been evaluated in [87], and how the ordering of tasks can affect the taskallocation results is investigated in [94]. Later, the characteristics of real-times tasks were exploited to develop more effective task partitioning schemes in [23,44,43].…”

Section: Related Work On Real-time Schedulingmentioning

confidence: 99%

“…When we group and allocate real-time tasks to different cores, we simply employ the standard bin-packing heuristics such as such as First-fit (FF), Best-fit (FF), Worst-fit (WF), which does not take real-time tasks characteristics into considerations. Existing work [43,73] has clearly shown that, by appropriately incorporating real-time task characteristics such as periods into task partitioning phase, the performance of real-time scheduling on multi-core platforms can be greatly improved. Therefore, we intend to study the problem on how to take task specifications into considerations when scheduling real-time tasks with fault-tolerance constraints on multi-core platforms.…”

Section: Chapter 6 Enhanced Fixed-priority Fault-tolerant Scheduling mentioning

confidence: 99%

“…Task partitioning under multiple resource constraints was studied in [32] and efficient heuristics were proposed to improve system schedulability considering resource assignment. Fan [43] et al exploited the fact that harmonic tasks (tasks that have periods being integer multiples of each other) can achieve higher system utilization and developed a metric to quantify how harmonic a task set is.…”

Section: Related Workmentioning

confidence: 99%

“…It is a well-known fact that, when real-time tasks are scheduled according to RMS, allocating the harmonic tasks to the same processor can achieve the maximum utilization of 1. As shown in [43], algorithm HAPS takes advantage of this fact and, by grouping harmonic tasks together, it can significantly improve the system schedulability. Note that the sub task set {τ 3 , τ 4 , τ 5 } and {τ 1 , τ 2 } are perfect harmonic.…”

Section: Problem Formulationmentioning

confidence: 99%

See 4 more Smart Citations

Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems

Han¹

Self Cite

View full text Add to dashboard Cite

Section: Priority-driven Vs Non-priority-drivenmentioning

confidence: 99%

Section: Related Work On Real-time Schedulingmentioning

confidence: 99%

Section: Chapter 6 Enhanced Fixed-priority Fault-tolerant Scheduling mentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Problem Formulationmentioning

confidence: 99%

See 3 more Smart Citations

Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems

Han¹

Self Cite

View full text Add to dashboard Cite

Enhanced Fault-Tolerant Fixed-Priority Scheduling of Hard Real-Time Tasks on Multi-core Platforms

Han

Wang

Quan

2015

2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

A Weakly Hard Scheduling Approach of Partitioned Scheduling on Multiprocessor Systems

Ismail

Jawawi

2015

Jurnal Teknologi

View full text Add to dashboard Cite

Real-time systems or tasks can be classified into three categories, based on the “seriousness” of deadline misses – hard, soft and weakly hard real-time tasks. The consequences of a deadline miss of a hard real-time task can be prohibitively expensive because all the tasks must meet their deadlines whereas soft real-time tasks tolerate “some” deadline misses. Meanwhile, in a weakly hard real-time task, the distribution of its met and missed deadlines is stated and specified precisely. As real-time application systems increasingly come to be implemented upon multiprocessor environments, thus, this study applies multiprocessor scheduling approach for verification of weakly hard real-time tasks and to guaranteeing the timing requirements of the tasks. In fact, within the multiprocessor, the task allocation problem seem even harder than in uniprocessor case; thus, in order to cater that problem, the sufficient and efficient scheduling algorithm supported by accurate schedulability analysis technique is present to provide weakly hard real-time guarantees. In this paper, a weakly hard scheduling approach has been proposed and schedulability analysis of proposed approach consists of the partitioned multiprocessor scheduling techniques with solutions for the bin-packing problem, called R-BOUND-MP-NFRNS (R-BOUND-MP with next-fit-ring noscaling) combining with the exact analysis, named hyperperiod analysis and deadline models; weakly hard constraints and µ-pattern under static priority scheduling. Then, Matlab simulation tool is used in order to validate the result of analysis. From the evaluation results, it can be proven that the proposed approach outperforms the existing approaches in terms of satisfaction of the tasks deadlines.

show abstract

Multi-core partitioned scheduling for fixed-priority periodic real-time tasks with enhanced RBound

Cited by 5 publications

References 18 publications

Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems

Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems

Enhanced Fault-Tolerant Fixed-Priority Scheduling of Hard Real-Time Tasks on Multi-core Platforms

A Weakly Hard Scheduling Approach of Partitioned Scheduling on Multiprocessor Systems

Contact Info

Product

Resources

About