Parallel Processor Scheduling with Limited Number of Preemptions
From MaRDI portal
Publication:4706224
DOI10.1137/S0097539702410697zbMath1023.90021MaRDI QIDQ4706224
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
worst-case analysispreemptive schedulingnonpreemptive schedulingschedule lengthparallel processor scheduling\(i\)-preemptive schedulinglongest processing time rule
Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (11)
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines ⋮ The maximum gain of increasing the number of preemptions in multiprocessor scheduling ⋮ Schedules with a single preemption on uniform parallel machines ⋮ Non-preemptive speed scaling ⋮ Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines ⋮ Parallel machine covering with limited number of preemptions ⋮ Approximation schemes for packing with item fragmentation ⋮ Algorithms with limited number of preemptions for scheduling on parallel machines ⋮ The n-dimensional Stern–Brocot tree ⋮ Preemptive and non-preemptive scheduling on two unrelated parallel machines ⋮ Single parameter analysis of power of preemption on two and three uniform machines
This page was built for publication: Parallel Processor Scheduling with Limited Number of Preemptions
