Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

Authors:
Kenji Funaoka;Shinpei Kato;Nobuyuki Yamasaki
Affiliations:
-;-;-
Venue:
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Year:
2008

Citing 0
Cited 11

Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Multiprocessor real-time scheduling considering concurrency and urgency

ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
A new fair scheduling algorithm for periodic tasks on multiprocessors

Information Processing Letters
On best-effort utility accrual real-time scheduling on multiprocessors

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended T-N Plane Abstraction (E-TNPA) proposed inthis paper realizes work-conserving and efficient optimalreal-time scheduling on multiprocessors relative to the originalT-N Plane Abstraction (TNPA). Additionally a schedulingalgorithm named NVNLF (No Virtual Nodal LaxityFirst) is presented for E-TNPA. E-TNPA and NVNLF relaxthe restrictions of TNPA and the traditional algorithmLNREF, respectively. Arbitrary tasks can be preferentiallyexecuted by both tie-breaking rules and time apportionmentpolicies in accordance with various system requirementswith several restrictions. Simulation results show that E-TNPAsignificantly reduces the number of task preemptionsas compared to TNPA.