Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms

ACM Transactions on Embedded Computing Systems ◽

10.1145/3064813 ◽

2017 ◽

Vol 16 (4) ◽

pp. 1-21 ◽

Cited By ~ 4

Author(s):

Tianyi Wang ◽

Soamar Homsi ◽

Linwei Niu ◽

Shaolei Ren ◽

Ou Bai ◽

...

Keyword(s):

Real Time ◽

Task Partitioning ◽

Priority Scheduling ◽

Fixed Priority ◽

Fixed Priority Scheduling

Modelling, Verification and Synthesis of Two-Tier Hierarchical Fixed-Priority Preemptive Scheduling

2011 23rd Euromicro Conference on Real-Time Systems ◽

10.1109/ecrts.2011.24 ◽

2011 ◽

Cited By ~ 7

Author(s):

Mikael Åsberg ◽

Paul Pettersson ◽

Thomas Nolte

Keyword(s):

Preemptive Scheduling ◽

Fixed Priority

Energy-efficient fixed-priority scheduling for real-time systems based on threshold work-demand analysis

Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis - CODES+ISSS '11 ◽

10.1145/2039370.2039397 ◽

2011 ◽

Cited By ~ 3

Author(s):

Linwei Niu ◽

Wei Li

Keyword(s):

Real Time ◽

Energy Efficient ◽

Demand Analysis ◽

Real Time Systems ◽

Priority Scheduling ◽

Fixed Priority ◽

Work Demand ◽

Fixed Priority Scheduling ◽

Time Systems

Energy efficient scheduling for hard real-time systems with fixed-priority assignment

International Performance Computing and Communications Conference ◽

10.1109/pccc.2010.5682315 ◽

2010 ◽

Cited By ~ 1

Author(s):

Linwei Niu

Keyword(s):

Real Time ◽

Energy Efficient ◽

Real Time Systems ◽

Priority Assignment ◽

Fixed Priority ◽

Hard Real Time ◽

Time Systems ◽

Energy Efficient Scheduling

Partitioned Fixed-Priority Real-Time Scheduling Based on Dependent Task-Split on Multicore Platform

2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications ◽

10.1109/trustcom.2013.151 ◽

2013 ◽

Cited By ~ 3

Author(s):

Guowei Wu ◽

Ying Li ◽

Jiankang Ren ◽

Chi Lin

Keyword(s):

Real Time ◽

Fixed Priority ◽

Real Time Scheduling ◽

Time Scheduling

An Efficient DVS Algorithm for Fixed-Priority Real-Time Applications

International Symposium on Parallel and Distributed Processing with Applications ◽

10.1109/ispa.2010.21 ◽

2010 ◽

Cited By ~ 3

Author(s):

Da-Ren Chen ◽

You-Shyang Chen

Keyword(s):

Real Time ◽

Fixed Priority ◽

Real Time Applications

Period adaptation of real-time control tasks with fixed-priority scheduling in cyber-physical systems

Journal of Systems Architecture ◽

10.1016/j.sysarc.2019.101691 ◽

2020 ◽

Vol 103 ◽

pp. 101691 ◽

Cited By ~ 3

Author(s):

Xiaotian Dai ◽

Alan Burns

Keyword(s):

Real Time ◽

Cyber Physical Systems ◽

Real Time Control ◽

Priority Scheduling ◽

Fixed Priority ◽

Physical Systems ◽

Fixed Priority Scheduling ◽

Time Control

Multi-Core Fixed-Priority Scheduling of Real-Time Tasks with Statistical Deadline Guarantee

Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015 ◽

10.7873/date.2015.0912 ◽

2015 ◽

Cited By ~ 9

Author(s):

Tianyi Wang ◽

Linwei Niu ◽

Shaolei Ren ◽

Gang Quan

Keyword(s):

Real Time ◽

Priority Scheduling ◽

Fixed Priority ◽

Fixed Priority Scheduling

Low power fixed priority scheduling sporadic task with shared resources in hard real time systems

Microprocessors and Microsystems ◽

10.1016/j.micpro.2016.04.010 ◽

2016 ◽

Vol 45 ◽

pp. 164-175 ◽

Cited By ~ 4

Author(s):

Yi-wen Zhang ◽

Chu-gui Xu

Keyword(s):

Low Power ◽

Real Time ◽

Real Time Systems ◽

Shared Resources ◽

Priority Scheduling ◽

Fixed Priority ◽

Fixed Priority Scheduling ◽

Hard Real Time ◽

Time Systems

Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

The Scientific World JOURNAL ◽

10.1155/2015/837472 ◽

2015 ◽

Vol 2015 ◽

pp. 1-14 ◽

Cited By ~ 1

Author(s):

Saehwa Kim

Keyword(s):

Real Time ◽

Empirical Evaluation ◽

Priority Assignment ◽

Fixed Priority ◽

Assignment Algorithm ◽

Optimal Priority Assignment ◽

A Performance

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.