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)

Related topics

Related topics

9 relations
Apollo Guidance ComputerCentral processing unitComputer multitaskingContext switch

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm
Audsley’s optimal priority assignment (OPA) algorithm can be applied to multiprocessor scheduling provided that three conditions… 
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… 
Review
2009
Review
2009
Extending RTA/Linux with fixed-priority scheduling with deferred preemption
Fixed-Priority Scheduling with Deferred Preemption (FPDS) is a middle ground between Fixed-Priority Pre-emptive Scheduling and… 
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 execution times and (absolute) execution jitter analysis of independent… 
2008
2008
Synthesis of Optimal Interfaces for Hierarchical Scheduling with Resources
This paper presents algorithms that (1) facilitate system-independent synthesis of timing-interfaces for subsystems and (2… 
Highly Cited
2004
Highly Cited
2004
Reducing the number of preemptions in fixed priority scheduling
  • R. DobrinG. Fohler
  • Proceedings. 16th Euromicro Conference on Real…
  • 2004
  • Corpus ID: 18964314
Fixed priority scheduling (FPS) has been widely studied and used in a number of applications, mostly due to its flexibility… 
Highly Cited
2002
Highly Cited
2002
Analyzing fixed-priority global multiprocessor scheduling
  • L. Lundberg
  • Proceedings. Eighth IEEE Real-Time and Embedded…
  • 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
Designing for schedulability: integrating schedulability analysis with object-oriented design
There is a growing interest in using the object paradigm for developing real time software. We believe that an approach that… 
1999
1999
An approach to task attribute assignment for uniprocessor systems
  • I. BateA. Burns
  • Proceedings of 11th Euromicro Conference on Real…
  • 1999
  • Corpus ID: 368050
The purpose of this paper is to investigate the issues related to task attribute assignment on an individual processor. The… 
1995
1995
Fixed Priority Scheduling with Limited Priority Levels
This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)