The maximum gain of increasing the number of preemptions in multiprocessor scheduling

DOI10.1007/S00236-009-0096-5MaRDI QIDQ2390934zbMATH OpenOpenAlexFDO

Authors Kamilla Klonowska, Håkan Lennerstad, Lars Lundberg

Publication date 10 August 2009

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-009-0096-5

zbMATH Keywords

optimal makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Multiprocessor scheduling under precedence constraints: polyhedral results
• scientific article; zbMATH DE number 1688367
• Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Parallel Processor Scheduling with Limited Number of Preemptions
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• scientific article; zbMATH DE number 871911
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Bounds on Multiprocessing Timing Anomalies
• Optimal scheduling combinatorics
• Parallel Processor Scheduling with Limited Number of Preemptions
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
• Scheduling with deadlines and loss functions

Cited in

(3)

• The \(n\)-dimensional Stern-Brocot tree
• Parallel machine covering with limited number of preemptions
• Algorithms with limited number of preemptions for scheduling on parallel machines

This page was built for publication: The maximum gain of increasing the number of preemptions in multiprocessor scheduling

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