The maximum gain of increasing the number of preemptions in multiprocessor scheduling
From MaRDI portal
Publication:2390934
DOI10.1007/S00236-009-0096-5zbMATH Open1179.68019OpenAlexW2148019337MaRDI QIDQ2390934FDOQ2390934
Lars Lundberg, Kamilla Klonowska, Håkan Lennerstad
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
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- Scheduling with deadlines and loss functions
- Optimal scheduling combinatorics
- Parallel Processor Scheduling with Limited Number of Preemptions
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
Cited In (3)
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)
