Greedy multiprocessor server scheduling

Greedy multiprocessor server scheduling

0.00 Avg rating0 Votes
Article ID: iaor2007924
Country: Netherlands
Volume: 34
Issue: 4
Start Page Number: 451
End Page Number: 458
Publication Date: Jul 2006
Journal: Operations Research Letters
Authors: ,
Abstract:

We show that the greedy highest density first (HDF) algorithm is (1+e)-speed O(1)-competitive for the problem of minimizing the 1p norms of weighted flow time on m identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.

Reviews

Required fields are marked *. Your email address will not be published.