Skip to search formSkip to main contentSkip to account menu

Fixed-priority pre-emptive scheduling

Known as: FPP, Fixed priority pre-emptive scheduling, Fixed-priority scheduling 
Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper discusses the open problem of priority assignment for systems using Fixed Priority Preemptive Scheduling (FPPS), where… 
2011
2011
For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in… 
2010
2010
This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task… 
Highly Cited
2010
Highly Cited
2010
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's… 
Review
2010
Review
2010
Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time (WCET) of each computational… 
2009
2009
In this paper, we present a conjecture for exact best-case response times of periodic released, independent real-time tasks with… 
2008
2008
In this paper, we present worst-case and best-case execution times and (absolute) execution jitter analysis of independent… 
Highly Cited
2002
Highly Cited
2002
Presents an application program interface (API) that enables applications to use application-defined scheduling algorithms in a… 
Highly Cited
2002
Highly Cited
2002
  • L. Lundberg
  • 2002
  • Corpus ID: 30346659
We consider a multiprocessor where hard real-time tasks are scheduled globally on in processors. Each task has a fixed priority… 
Highly Cited
2000
Highly Cited
2000
There is a growing interest in using the object paradigm for developing real time software. We believe that an approach that…