Brief announcement: Flexible resource allocation for clouds and all-optical networks

Dmitriy Katz, Baruch Schieber, Hadas Shachnai

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

4 Scopus citations

Abstract

Motivated by the cloud computing paradigm, and by key optimization problems in all-optical networks, we study two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible manner. Each job, Ji, requires the use of up to rmax(i) units of the resource, with a profit of pi ≥ 1 accrued for each allocated unit. The goal is to feasibly schedule a subset of the jobs so as to maximize the total profit. The resource can be allocated either in contiguous or non-contiguous blocks. These problems can be viewed as flexible variants of the well known storage allocation and bandwidth allocation problems. We show that the contiguous version is strongly NP-hard, already for instances where all jobs have the same profit and the same maximum resource requirement. We derive the best possible positive result for such instances, namely, a polynomial time approximation scheme (PTAS). We further show that the contiguous variant admits a (5/4 + ϵ)-approximation algorithm, for any fixed ϵ > 0, on instances whose job intervals form a proper interval graph. At the heart of the algorithm lies a non-standard parameterization of the approximation ratio itself. For the noncontiguous case, we uncover an interesting relation to the paging problem that leads to a simple O(nlogn) algorithm for uniform profit instances of n jobs.

Original languageEnglish (US)
Title of host publicationSPAA 2016 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages225-226
Number of pages2
ISBN (Electronic)9781450342100
DOIs
StatePublished - Jul 11 2016
Externally publishedYes
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

Other

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

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Keywords

  • Bandwidth allocation
  • Cloud computing
  • Flexgrid all-optical networks
  • Flexible storage allocation
  • Paging
  • Scheduling

Fingerprint Dive into the research topics of 'Brief announcement: Flexible resource allocation for clouds and all-optical networks'. Together they form a unique fingerprint.

Cite this