Technical Report Number
We consider the problem of scheduling unit-sized jobs on a ring of processors with the objective of minimizing the completion time of the last job. Unlike much previous work we place restrictions on the capacity of the network links connecting processors. We give a polynomial time centralized algorithm that produces optimal length schedules. We also give a simple distributed 2-approximation algorithm.
Dartmouth Digital Commons Citation
Fizzano, Perry and Stein, Clifford, "Scheduling in a Ring with Unit Capacity Links" (1994). Computer Science Technical Report PCS-TR94-216. https://digitalcommons.dartmouth.edu/cs_tr/100