Improved scheduling in rings

13 years 4 months ago

Download cs.haifa.ac.il

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

Real-time Traffic

Approximation Ratio | Distributed Algorithm | JPDC 2007 | Unit Size Jobs |

claim paper

» Optimized opportunistic multicast scheduling OMS over heterogeneous cellular networks

» MultiRing Cyclic Scheduling for SpatialTDMA EnergySaving MAC Protocol in MANET

» Randomized selfstabilizing and space optimal leader election under arbitrary scheduler on ...

» The bell is ringing in speedscaled multiprocessor scheduling

» Approximation Algorithms for Routing and Call Scheduling in AllOptical Chains and Rings

» Job Scheduling in Rings

» The impact of local policies on the quality of packet routing in paths trees and rings

» Improving the Robustness of Ring Oscillator TRNGs

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JPDC
Authors	Dekel Tsur

Comments (0)

Sciweavers

Improved scheduling in rings

Approximation Ratio | Distributed Algorithm | JPDC 2007 | Unit Size Jobs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers