Optimal virtual cluster-based multiprocessor scheduling

DOI10.1007/S11241-009-9073-XzbMath1186.68063arXiv2004.02439OpenAlexW2051607127MaRDI QIDQ1039304

Insup Lee, Insik Shin, Arvind Easwaran

Publication date: 27 November 2009

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.02439

zbMATH Keywords

multiprocessor schedulinghierarchical schedulingcompositional schedulability analysisvirtual processor clustering

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems ⋮ Cache-aware compositional analysis of real-time multicore virtualization platforms ⋮ Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach ⋮ The aggregate capacity of virtual resources – linear models

Cites Work

• An analysis of fixed-priority schedulability on a multiprocessor
• An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
• A new algorithm for scheduling periodic, real-time tasks
• Priority-driven scheduling of periodic task systems on multiprocessors
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Proportionate progress: A notion of fairness in resource allocation
• Schedulability analysis of global EDF
• Scheduling with Deadlines and Loss Functions
• Optimal rate-based scheduling on multiprocessors

This page was built for publication: Optimal virtual cluster-based multiprocessor scheduling