Greedy multiprocessor server scheduling

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.

• Type: Journal
• Year: 2006
• Where: ORL
• Authors: Carl Bussema, Eric Torng
• Keywords: Flow Time, Identical Machines, ORL 2006, Unweighted Flow