Efficient Scheduling of Tasks Without Full Use of Processor Resources
The nonpreemptive scheduling of a partially ordered set of tasks on a machine with m processors of different speeds is studied. Heuristics are presented which benefit from selective non-use of slow processors. The performance of these heuristics is aymptotic of √m times worse than optimal, whereas d...
Main Author: | Jaffe, Jeffrey |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148950 |
Similar Items
-
Algorithms for Scheduling Tasks on Unrelated Processors
by: Davis, Ernest, et al.
Published: (2023) -
Critical Path Scheduling of Task Systems with Resource and Processor Constraints
by: Lloyd, Error Lynn
Published: (2023) -
Task scheduling in parallel processor systems /
by: 443850 Syarifah Zyurina Nordin
Published: (2011) -
Bounds on the Scheduling of Types Task Systems
by: Jaffe, Jeffrey M.
Published: (2023) -
Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment
by: Sachi Gupta, et al.
Published: (2022-08-01)