ScholarLens Back to search
2014•Jisuanji yingyong yanjiuRequires access

Real-time scheduling algorithm based on priority table

Yuncong C. Li

Open publisher page 0 citations

Abstract

Focused on dynamic scheduling of single-processor real-time system,this paper defined and analyzed the sensitivity and influence of task attributes including arrival time,execution time,deadline and laxity,then it proposed a scheduling algorithm PTBM based on priority table,which made that a task with small deadline and large laxity had higher priority.Compared with PTBM with EDF,LLF and PTD,simulated results verify CMRN of the sensitivity and influence,and show PTBM outperforming on scheduling success ratio.The proposed algorithm can be applied to dynamically schedule real-time tasks in realtime systems.

About this research paper

What this paper is about

Focused on dynamic scheduling of single-processor real-time system,this paper defined and analyzed the sensitivity and influence of task attributes including arrival time,execution time,deadline and laxity,then it proposed a scheduling algorithm PTBM based on priority table,which made that a task with small deadline and large laxity had higher priority.Compared with PTBM with EDF,LLF and PTD,simulated results verify CMRN of the sensitivity and influence,and show PTBM outperforming on scheduling success ratio.The proposed algorithm can be applied to dynamically schedule real-time tasks in realtime systems.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Focused on dynamic scheduling of single-processor real-time system,this paper defined and analyzed the sensitivity and influence of task attributes including arrival time,execution time,deadline and laxity,then it proposed a scheduling algorithm PTBM based on priority table,which made that a task with small deadline and large laxity had higher priority.Compared with PTBM with EDF,LLF and PTD,simulated results verify CMRN of the sensitivity and influence,and show PTBM outperforming on scheduling success ratio.The proposed algorithm can be applied to dynamically schedule real-time tasks in realtime systems.

Key concepts: Computer science, Earliest deadline first scheduling, Scheduling (production processes), Fixed-priority pre-emptive scheduling, Dynamic priority scheduling, Real-time computing, Schedule, Rate-monotonic scheduling

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Real-time scheduling algorithm based on priority table — Research Paper | ScholarLens