Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
poster

Online load balancing under graph constraints

Published: 17 June 2013 Publication History

Abstract

In several data center settings, each arriving job may only be served by one of a subset of servers. Such a graph constraint can arise due to several reasons. One is locality of the data needed by a job; for example, in content farms (e.g. in Netflix or YouTube) a video request can only be served by a machine that possesses a copy. Motivated by this, we consider a setting where each job, on arrival, reveals a deadline and a subset of servers that can serve it. The job needs to be immediately allocated to one of these servers, and cannot be moved thereafter. Our objective is to maximize the fraction of jobs that are served before their deadlines. For this online load balancing problem, we prove an upper bound of 1-1/e on the competitive ratio of non-preemptive online algorithms for systems with a large number of servers. We propose an algorithm - INSERT RANKING - which achieves this upper bound. The algorithm makes decisions in a correlated random way and it is inspired by the work of Karp, Vazirani and Vazirani on online matching for bipartite graphs. We also show that two more natural algorithm, based on independent randomness, are strictly suboptimal, with a competitive ratio of 1/2.

References

[1]
B. Kalyanasundaram and K.R. Pruhs. An optimal deterministic algorithm for online b-matching. Theoretical Computer Science, 233:2000, 2000.
[2]
R.M. Karp, U.V. Vazirani, and V.V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the twenty-second annual ACM symposium on Theory of Computing, Baltimore, Maryland, May 1990.
[3]
A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized on-line matching. In Proceedings of FOCS, 2005.
[4]
S. Moharir and S. Sanghavi. Online load balancing and correlated randomness. In Annual Conference on Communication, Control and Computing (Allerton), 2012.
[5]
www.netflix.com.
[6]
www.youtube.com.

Cited By

View all
  • (2017)An Optimal Randomized Online Algorithm for QoS Buffer ManagementProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544941:2(1-26)Online publication date: 19-Dec-2017
  • (2021)A Decadal Walkthrough on Energy Modelling for Cloud DatacentersImpacts and Challenges of Cloud Business Intelligence10.4018/978-1-7998-5040-3.ch012(195-204)Online publication date: 2021
  • (2016)Online load balancing under graph constraintsIEEE/ACM Transactions on Networking10.1109/TNET.2015.244259724:3(1690-1703)Online publication date: 1-Jun-2016
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 41, Issue 1
Performance evaluation review
June 2013
385 pages
ISSN:0163-5999
DOI:10.1145/2494232
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
    June 2013
    406 pages
    ISBN:9781450319003
    DOI:10.1145/2465529
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2013
Published in SIGMETRICS Volume 41, Issue 1

Check for updates

Author Tags

  1. content delivery networks
  2. matchings

Qualifiers

  • Poster

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2017)An Optimal Randomized Online Algorithm for QoS Buffer ManagementProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544941:2(1-26)Online publication date: 19-Dec-2017
  • (2021)A Decadal Walkthrough on Energy Modelling for Cloud DatacentersImpacts and Challenges of Cloud Business Intelligence10.4018/978-1-7998-5040-3.ch012(195-204)Online publication date: 2021
  • (2016)Online load balancing under graph constraintsIEEE/ACM Transactions on Networking10.1109/TNET.2015.244259724:3(1690-1703)Online publication date: 1-Jun-2016
  • (2016)A new competitive ratio for network applications with hard performance guarantees2016 International Conference on Signal Processing and Communications (SPCOM)10.1109/SPCOM.2016.7746696(1-5)Online publication date: Jun-2016
  • (2014)Online Algorithms for Basestation AllocationIEEE Transactions on Wireless Communications10.1109/TWC.2014.041014.13152613:5(2966-2975)Online publication date: May-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media