Improved scheduling in rings

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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).

Original languageEnglish
Pages (from-to)531-535
Number of pages5
JournalJournal of Parallel and Distributed Computing
Issue number5
StatePublished - 1 May 2007


  • Approximation algorithms
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Improved scheduling in rings'. Together they form a unique fingerprint.

Cite this