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

Scheduling with multiple servers

โœ Scribed by F. Werner; S. A. Kravchenko

Book ID
110153227
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
185 KB
Volume
71
Category
Article
ISSN
0005-1179

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Greedy multiprocessor server scheduling
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.