.png){kind=icon}
返回
Online Load Balancing Under Graph Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TNET.2015.2442597.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 on the competitive ratio of nonpreemptive 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 algorithms, based on independent randomness, are strictly suboptimal, with a competitive ratio of 1/2.
Keyword:
Communication systems
computer networks
content distribution networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Tumor progression in human malignant melanoma is associated with changes in α6/β1 laminin receptor
PREAI
分享收藏
分享收藏
Analysis of human urine for mutagens associated with carcinoma of the bilharzial bladder by the Ames Salmonella plate assay: Interpretation employing quantitation of viable lawn bacteria.png)
Cancer
CancerIF0
PREAI
分享收藏分享收藏
查看更多内容