Guaranteeing Fair Service to Persistent Dependent Tasks

DOI10.1137/S0097539795282092zbMATH Open0910.90174MaRDI QIDQ4210089FDOQ4210089

Authors Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan

Publication date 20 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

fairnessinterval graphsschedulingdining philosophers problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60) Parallel algorithms in computer science (68W10)

Recommendations

• Publication:4886054
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Fair on-line scheduling of a dynamic set of tasks on a single resource
• A fair workload allocation policy for heterogeneous systems
• Promptness and bounded fairness in concurrent and parameterized systems
• Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling
• Fairness in parallel job scheduling
• scientific article; zbMATH DE number 1717243

Cited in

(7)

• Scheduling algorithms for conducting conflict-free measurements in overlay networks
• Probabilistic analysis for scheduling with conflicts
• Quantitatively fair scheduling
• On Scheduling Policies for Streams of Structured Jobs
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• On centralized smooth scheduling
• scientific article; zbMATH DE number 910880 (Why is no real title available?)

This page was built for publication: Guaranteeing Fair Service to Persistent Dependent Tasks

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