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

• Type: Journal
• Year: 2007
• Where: JPDC
• Authors: Dekel Tsur
• Keywords: Approximation Ratio, Distributed Algorithm, JPDC 2007, Unit Size Jobs