| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 432553 | Journal of Parallel and Distributed Computing | 2007 | 5 Pages |
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 .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
