Brief announcement: Improved approximation algorithms for scheduling co-flows

Samir Khuller, Manish Purohit

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

Abstract

Co-flow scheduling is a recent networking abstraction introduced to capture application-level communication patterns in datacenters. In this paper, we consider the offline co-flow scheduling problem with release times to minimize the total weighted completion time. Recently, Qiu, Stein and Zhong [1] obtained the first constant approximation algorithms for this problem with a deterministic 67/3-approximation and a randomized (9 + 16√2/3) ≈ 16.54-approximation. In this paper, we improve upon their algorithm to yield a deterministic 12-approximation algorithm. For the special case when all release times are zero, we obtain a deterministic 8-approximation and a randomized (3 + 2√2) ≈ 5.83-approximation.

Original languageEnglish (US)
Title of host publicationSPAA 2016 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages239-240
Number of pages2
ISBN (Electronic)9781450342100
DOIs
StatePublished - Jul 11 2016
Event28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016 - Pacific Grove, United States
Duration: Jul 11 2016Jul 13 2016

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures
Volume11-13-July-2016

Conference

Conference28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016
Country/TerritoryUnited States
CityPacific Grove
Period7/11/167/13/16

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Brief announcement: Improved approximation algorithms for scheduling co-flows'. Together they form a unique fingerprint.

Cite this