Sciweavers

Share
JPDC
2007

Improved scheduling in rings

8 years 7 months ago
Improved scheduling in rings
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2. Key words: Scheduling, Approximation Algorithms
Dekel Tsur
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2007
Where JPDC
Authors Dekel Tsur
Comments (0)
books