Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound

Authors:
Nan Guan;Martin Stigge;Wang Yi;Ge Yu
Affiliations:
-;-;-;-
Venue:
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Year:
2010

Citing 0
Cited 11

Multicore embedded systems: the timing problem and possible solutions

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Safety-critical Java with cyclic executives on chip-multiprocessors

Concurrency and Computation: Practice & Experience
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Resource sharing under server-based multiprocessor scheduling

ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Integrating independently developed real-time applications on a shared multi-core architecture

ACM SIGBED Review
Building timing predictable embedded systems

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.