Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,297 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Apollo Guidance Computer
Central processing unit
Computer multitasking
Context switch
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Priority Assignment in Fixed Priority Pre-emptive Systems with Varying Context Switch Costs
Robert I. Davis
,
S. Altmeyer
,
A. Burns
2018
Corpus ID: 49405439
This paper discusses the open problem of priority assignment for systems using Fixed Priority Preemptive Scheduling (FPPS), where…
Expand
2011
2011
Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems
D. Zmaranda
,
G. Gabor
,
D. Popescu
,
C. Vancea
,
F. Vancea
International Journal of Computers Communications…
2011
Corpus ID: 15520440
For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in…
Expand
2010
2010
On Optimal Priority Assignment for Response Time Analysis of Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Hard Real-Time Systems
Robert I. Davis
,
A. Burns
2010
Corpus ID: 15213935
This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task…
Expand
Highly Cited
2010
Highly Cited
2010
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Nan Guan
,
Martin Stigge
,
W. Yi
,
Ge Yu
16th IEEE Real-Time and Embedded Technology and…
2010
Corpus ID: 1599561
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's…
Expand
Review
2010
Review
2010
Comparative evaluation of limited preemptive methods
Gang Yao
,
G. Buttazzo
,
M. Bertogna
IEEE 15th Conference on Emerging Technologies…
2010
Corpus ID: 11595645
Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time (WCET) of each computational…
Expand
2009
2009
Exact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines
R. Bril
2009
Corpus ID: 2466601
In this paper, we present a conjecture for exact best-case response times of periodic released, independent real-time tasks with…
Expand
2008
2008
Execution times and execution jitter analysis of real-time tasks under fixed-priority pre-emptive scheduling
R. Bril
,
G. Fohler
,
W. Verhaegh
2008
Corpus ID: 14880300
In this paper, we present worst-case and best-case execution times and (absolute) execution jitter analysis of independent…
Expand
Highly Cited
2002
Highly Cited
2002
POSIX-compatible application-defined scheduling in MaRTE OS
M. A. Rivas
,
M. G. Harbour
Proceedings 14th Euromicro Conference on Real…
2002
Corpus ID: 224838
Presents an application program interface (API) that enables applications to use application-defined scheduling algorithms in a…
Expand
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…
Expand
Highly Cited
2000
Highly Cited
2000
Designing for schedulability: integrating schedulability analysis with object-oriented design
M. Saksena
,
Panagiota Karvelas
Proceedings 12th Euromicro Conference on Real…
2000
Corpus ID: 12311768
There is a growing interest in using the object paradigm for developing real time software. We believe that an approach that…
Expand
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)
ACCEPT & CONTINUE