Preemptive weighted completion time scheduling of parallel jobs

DOI10.1007/3-540-61680-2_45MaRDI QIDQ4595476zbMATH OpenOpenAlexWikidataFDO

Authors Uwe Schwiegeishohn

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_45

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Preemptive Weighted Completion Time Scheduling of Parallel Jobs
• scientific article; zbMATH DE number 871911
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• The power of preemption on unrelated machines and applications to scheduling orders
• An optimal algorithm for preemptive on-line scheduling

Cited in

(8)

• Fairness in parallel job scheduling
• Scheduling space-sharing for internet advertising
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
• Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• Preemptive Weighted Completion Time Scheduling of Parallel Jobs
• scientific article; zbMATH DE number 871911 (Why is no real title available?)

This page was built for publication: Preemptive weighted completion time scheduling of parallel jobs

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