Improved scheduling in rings

Authors:
Dekel Tsur
Affiliations:
Department of Computer Science, Ben-Gurion University, Beer-Sheva, Israel
Venue:
Journal of Parallel and Distributed Computing
Year:
2007

Citing 6
Cited 0

Competitive distributed job scheduling (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Competitive analysis of network load balancing

Journal of Parallel and Distributed Computing
Distributed job scheduling in rings

Journal of Parallel and Distributed Computing
Task Scheduling in Networks

SIAM Journal on Discrete Mathematics
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 32+2.