Publication View

On-line Load Balancing for Related Machines 1 (Revised Version) (2008)

Abstract
We consider the problem of scheduling permanent jobs on related machinesin an on-line fashion. We design a new algorithm that achievesthe competitive ratio for the deterministic version, and3:31=ln2:1554:311for its randomized variant, improving the previous competitive ratios of 8 and2e5:436. We also prove lower bounds of2:4380on the competitive ratio of deterministic algorithms and1:8372on the competitive ratio of randomized algorithms for this problem.

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.5640
Source http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/1999/85210-CS.ps.gz
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords Key Words, on-line algorithm, load balancing, related machines, competitive ratio
Type text
Language English
Relation 10.1.1.41.5057, 10.1.1.44.8894, 10.1.1.46.7507, 10.1.1.54.8441, 10.1.1.56.7547, 10.1.1.49.2721