Partition oriented frame based fair scheduler

DOI10.1016/J.JPDC.2010.03.005zbMATH Open1233.68117OpenAlexW2071195517MaRDI QIDQ666161FDOQ666161

P. P. Chakrabarti, Arnab Dey Sarkar, Sujoy Ghose

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.03.005

Recommendations

• Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Optimal rate-based scheduling on multiprocessors

zbMATH Keywords

real timeproportional fairnessERfair schedulingtask migrationframe based schedulingpartitioned schedulingworst-fit decreasing (WFD) partitioning

Mathematics Subject Classification ID

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

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Priority-driven scheduling of periodic task systems on multiprocessors
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Optimal time-critical scheduling via resource augmentation
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Partition oriented frame based fair scheduler

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666161)