๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On Multiprocessor System Scheduling
โœ Xiaotie Deng; Patrick Dymond ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Springer US ๐ŸŒ English โš– 128 KB
Greedy multiprocessor server scheduling
โœ Carl Bussema; Eric Torng ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 191 KB

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.

General multiprocessor task scheduling
โœ Jianer Chen; Chung-Yee Lee ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 141 KB

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

Multiprocessor Scheduling with Rejection
โœ Bartal, Yair; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Sgall, Jirรญ; Sto ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 326 KB