Group-based Pfair scheduling

DOI10.1007/S11241-006-4687-8zbMATH Open1105.68010OpenAlexW4300679182MaRDI QIDQ853597FDOQ853597

Philip Holman, James H. Anderson

Publication date: 17 November 2006

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

Full work available at URL: https://doi.org/10.17615/vrhb-sq84

Recommendations

• Solving group interval scheduling efficiently
• Group scheduling with general position-dependent effect
• scientific article; zbMATH DE number 1196818
• Grouping techniques for scheduling problems: simpler and faster
• scientific article; zbMATH DE number 1877047
• A dynamic scheduling grouping algorithm based on limited priority levels
• Priority-grouping method for parallel multi-scheduling in grid
• A group priority earliest deadline first scheduling algorithm

zbMATH Keywords

schedulingmultiprocessorreweightingsupertaskhierarchalPfairness

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
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Resource reservation in dynamic real-time systems

Cited In (6)

• Compositional multiprocessor scheduling: the GMPR interface
• Title not available (Why is that?)
• Group scheduling on two cells with intercell movement
• Real-time processing of streaming big data
• A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees
• A group priority earliest deadline first scheduling algorithm

This page was built for publication: Group-based Pfair scheduling

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