Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

Authors:
Shinpei Kato;Nobuyuki Yamasaki
Affiliations:
-;-
Venue:
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Year:
2009

Citing 0
Cited 8

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

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of designing an algorithm with a high utilization bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterized by its minimum interarrival time and its execution time. Task preemption ...