Sharayu Moharir
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.
- B. Kalyanasundaram and K.R. Pruhs. An optimal deterministic algorithm for online b-matching. Theoretical Computer Science, 233:2000, 2000. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized on-line matching. In Proceedings of FOCS, 2005. Google ScholarDigital Library
- S. Moharir and S. Sanghavi. Online load balancing and correlated randomness. In Annual Conference on Communication, Control and Computing (Allerton), 2012.Google ScholarCross Ref
- www.netflix.com.Google Scholar
- www.youtube.com.Google Scholar
Index Terms
- Online load balancing under graph constraints
Recommendations
Online load balancing under graph constraints
Performance evaluation reviewIn 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 ...
Online load balancing under graph constraints
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 ...
Bipartite graph structures for efficient balancing of heterogeneous loads
Performance evaluation reviewThis paper considers large scale distributed content service platforms, such as peer-to-peer video-on-demand systems. Such systems feature two basic resources, namely storage and bandwidth. Their efficiency critically depends on two factors: (i) content ...
Comments