Fairness in parallel job scheduling

DOI10.1002/1099-1425(200009/10)3:5%3C297::AID-JOS50%3E3.0.CO;2-DMaRDI QIDQ1588058zbMATH OpenOpenAlexWikidataFDO

Authors Uwe Schwiegelshohn, Ramin Yahyapour

Publication date 10 May 2001

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/1099-1425(200009/10)3:5%3C297::aid-jos50%3E3.0.co;2-d

zbMATH Keywords

makespan criterioncompetitive factorsfair on-line schedulingweighted completion time criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
• Preemptive weighted completion time scheduling of parallel jobs
• Preemptive Weighted Completion Time Scheduling of Parallel Jobs
• scientific article; zbMATH DE number 1303606
• On an on-line scheduling problem for parallel jobs

Cites work

• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• scientific article; zbMATH DE number 871911 (Why is no real title available?)
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Complexity of Scheduling Parallel Task Systems
• Dynamic scheduling on parallel machines
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Preemptive weighted completion time scheduling of parallel jobs
• Scheduling Parallel Machines On-Line
• Scheduling independent tasks to reduce mean finishing time
• Smart SMART Bounds for Weighted Response Time Scheduling

Cited in

(12)

• Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
• Fairness in Scheduling
• The efficiency-fairness balance of round robin scheduling
• Greedy scheduling with custom-made objectives
• scientific article; zbMATH DE number 910905 (Why is no real title available?)
• Performance, fairness and effectiveness in space-slicing multi-cluster schedulers
• scientific article; zbMATH DE number 3901999 (Why is no real title available?)
• A system-centric metric for the evaluation of online job schedules
• Scheduling parallel jobs using migration and consolidation in the cloud
• Guaranteeing Fair Service to Persistent Dependent Tasks
• On cluster resource allocation for multiple parallel task graphs
• Fair algorithm design: fair and efficacious machine scheduling

This page was built for publication: Fairness in parallel job scheduling

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