Fairness in parallel job scheduling

DOI10.1002/1099-1425(200009/10)3:5%3C297::AID-JOS50%3E3.0.CO;2-DzbMATH Open0992.90030OpenAlexW2056702805WikidataQ130471502 ScholiaQ130471502MaRDI QIDQ1588058FDOQ1588058

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

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

zbMATH Keywords

makespan criterioncompetitive factorsfair on-line schedulingweighted completion time criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Scheduling Parallel Machines On-Line
• Scheduling independent tasks to reduce mean finishing time
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of Scheduling Parallel Task Systems
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Dynamic scheduling on parallel machines
• Smart SMART Bounds for Weighted Response Time Scheduling
• Preemptive weighted completion time scheduling of parallel jobs

Cited In (10)

• Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
• Greedy scheduling with custom-made objectives
• Title not available (Why is that?)
• Performance, fairness and effectiveness in space-slicing multi-cluster schedulers
• Title not available (Why is that?)
• 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)