Leakage-Aware Multiprocessor Scheduling
โ Scribed by Pepijn de Langen; Ben Juurlink
- Book ID
- 106559449
- Publisher
- Springer US
- Year
- 2008
- Tongue
- English
- Weight
- 686 KB
- Volume
- 57
- Category
- Article
- ISSN
- 1939-8018
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We show that the greedy highest density first (HDF) algorithm is (1 + )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat