ScholarLens Back to search
2009•Unpublished venueRequires access

A Real-Time Task Scheduling Algorithm Based on Dynamic Priority

Hui Chen, Jiali Xia

Open publisher page 7 citations

Abstract

By studying the dynamic value density and urgency of a task, a preemptive scheduling strategy based on dynamic priority assignment is proposed. In the strategy, two parameters p and q are used to adjust the weight that the value density and urgency of a task impact on its priority, and a parameter beta is used to avoid the possible system thrashing. Finally, the simulations show that our algorithm is prior to the analogous algorithms, such as EDF, HVF and HVDF, on gained-value of the system, deadline miss ratio and preemptive number. .

About this research paper

What this paper is about

By studying the dynamic value density and urgency of a task, a preemptive scheduling strategy based on dynamic priority assignment is proposed. In the strategy, two parameters p and q are used to adjust the weight that the value density and urgency of a task impact on its priority, and a parameter beta is used to avoid the possible system thrashing. Finally, the simulations show that our algorithm is prior to the analogous algorithms, such as EDF, HVF and HVDF, on gained-value of the system, deadline miss ratio and preemptive number. .

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

By studying the dynamic value density and urgency of a task, a preemptive scheduling strategy based on dynamic priority assignment is proposed. In the strategy, two parameters p and q are used to adjust the weight that the value density and urgency of a task impact on its priority, and a parameter beta is used to avoid the possible system thrashing. Finally, the simulations show that our algorithm is prior to the analogous algorithms, such as EDF, HVF and HVDF, on gained-value of the system, deadline miss ratio and preemptive number. .

Key concepts: Thrashing, Computer science, Dynamic priority scheduling, Earliest deadline first scheduling, Deadline-monotonic scheduling, Priority inversion, Scheduling (production processes), Priority inheritance

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Real-Time Task Scheduling Algorithm Based on Dynamic Priority — Research Paper | ScholarLens