Technical Report Number
We consider the problem of scheduling unit-sized jobs in a distributed network of processors. Each processor only knows the number of jobs it and its neighbors have. We give an analysis of intuitive algorithm and prove that the algorithm produces schedules that are within a logarithmic factor of the length of the optimal schedule given that the optimal schedule is sufficiently long.
Dartmouth Digital Commons Citation
Fizzano, Perry and Stein, Clifford, "Distributed Scheduling in Finite Capacity Networks" (1994). Computer Science Technical Report PCS-TR94-236. https://digitalcommons.dartmouth.edu/cs_tr/107