Two processor scheduling with limited preemption

DOI10.1016/0166-5316(86)90038-6MaRDI QIDQ3771601zbMATH OpenOpenAlexFDO

Authors Errol L. Lloyd

Publication date 1986

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(86)90038-6

zbMATH Keywords

deterministic schedulingpreemptiontask system

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Parallel Processor Scheduling with Limited Number of Preemptions
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Optimal Preemptive Scheduling of Two Unrelated Processors
• Scheduling independent 2-processor tasks to minimize schedule length
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

This page was built for publication: Two processor scheduling with limited preemption

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