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… (More)
Wikipedia

Related topics

Related topics

9 relations
Apollo Guidance ComputerCentral processing unitComputer multitaskingContext switch
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems
For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 2
Is this relevant?
2010
2010
Quantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling
This paper examines the relative effectiveness of fixed priority non-pre-emptive scheduling (FP-NP) in a uniprocessor system… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems
This paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
2009
2009
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Quantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines
This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an… (More)
Is this relevant?
2008
2008
Execution times and execution jitter analysis of real-time tasks under fixed-priority pre-emptive scheduling
In this paper, we present worst-case and best-case executio n times and (absolute) execution jitter analysis of indepen dent… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Hierarchical fixed priority pre-emptive scheduling
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Fixed priority pre-emptive scheduling: An historical perspective
From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling theory has progressed from the… (More)
Is this relevant?
1994
1994
Integrating Best-Effort Policies into Hard Real-Time Systems based on Fixed Priority Pre-emptive Scheduling
Analysis provided for fixed priority pre-emptive scheduling enables a priori guarantees to be given regarding the timing… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?