דקל צור
אקדמי בכיר
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 frac(3, 2) + sqrt(2).
| שפת פרסום | אנגלית |
| דפים | 531-535 |
| כתב עת | Journal of Parallel and Distributed Computing |
| כרך | 67 |
| נושא מספר | 5 |
| סטטוס פרסום | פורסם - 01.05.2007 |
Keywords
Approximation algorithms
Scheduling
ASJC Scopus subject areas
Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence
