arrow
返回

Utility Optimal Thread Assignment and Resource Allocation in Multi-Server Systems

delete2022-04-01
delete2
delete
OA
AI
赖
赖攀 (Pan Lai)
R
Rui Fan
张
张潇 (Xiao Zhang) *
W
Wei Zhang
F
Fang Liu
J
Joey Tianyi Zhou
DOI:10.1109/TNET.2021.3123817delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Achieving high performance in many multi-server systems (e.g., web hosting center, cloud) requires finding a good assignment of worker threads to servers and also effectively allocating each server's resources to its assigned threads. The assignment and allocation components of this problem have been studied extensively but largely separately in the literature. In this paper, we introduce the assign and allocate (AA) problem, which seeks to simultaneously find an assignment and allocation that maximizes the total utility of the threads. Assigning and allocating the threads together can result in substantially better overall utility than performing the steps separately, as is traditionally done. We model each thread by a utility function giving its performance as a function of its assigned resources. We first prove that the AA problem is NP-hard. We then present a 2 (root 2-1) > 0.828 factor approximation algorithm for concave utility functions, which runs in O(mn(2) + n (log mC)(2)) time for n threads and m servers with C amount of resources each. We also give a faster algorithm with the same approximation ratio and O(n (log mC)(2)) time complexity. We then extend the problem to two more general settings. First, we consider threads with nonconcave utility functions, and give a 1/2 factor approximation algorithm. Next, we give an algorithm for threads using multiple types of resources, and show the algorithm achieves good empirical performance. We conduct extensive experiments to test the performance of our algorithms on threads with both synthetic and realistic utility functions, and find that they achieve over 92% of the optimal utility on average. We also compare our algorithms with a number of practical heuristics, and find that our algorithms achieve up to 9 times higher total utility.
Keyword:
Servers
Resource management
Message systems
Approximation algorithms
Multicore processing
Instruction sets
IEEE transactions
Assignment and allocation
utility
algorithms
multi-server systems
web hosting center
cloud

期刊

I
IEEE-ACM Transactions on Networking
IF:
3.6
论文数:
4.4K
被引数:
9.5K

机构

A
a*star - institute of high performance computing (ihpc)
学者数:
1.5K
论文数: 1.3K
被引数: 3
S
singapore university of social sciences (suss)
学者数:
386
论文数: 528
被引数: 0
South Central Minzu University 封面图
South Central Minzu University
学者数:
4.6K
论文数: 3.3K
被引数: 3.4K
A
agency for science technology & research (a*star)
学者数:
2.2W
论文数: 1.9W
被引数: 57
S
ShanghaiTech University
学者数:
9.7K
论文数: 5.9K
被引数: 1.6W
学者 查看更多机构
引用论文

引用论文

Protective role of lycopene against PCBs-induced nitrosative stress in cerebral cortex of adult male rats番茄红素对成年雄性大鼠大脑皮层中PCBs诱导的亚硝化应激的保护作用
err2012-10-01
err0
PREAI
errMadhan Mohan Bala Sakthi Janani; Kandaswamy Selvakumar; Sekeran Suganya; Afzar Basha Fariya Yasmine; Gunasekaran Krishnamoorthy; Jagadeesan Arunakaran
err分享
err收藏
Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation
err2017-06-01
err25
PREAI
errRen, Runtian; Tang, Xueyan; Li, Yusen; Cai, Wentong
err分享
err收藏
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing
err2016-08-01
err57
PREAI
errShi, Weijie; Zhang, Linquan; Wu, Chuan; Li, Zongpeng; Lau, Francis C. M.
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Low‐ to Moderate‐Income Lending in Context: Progress Report on the Neighborhood Impacts of Homeownership Policy
err2010-03-31
err0
PREAI
errElvin K. Wyly; Thomas J. Cooke; Daniel J. Hammel; Steven R. Holloway; Margaret Hudson
err分享
err收藏
err分享
err收藏
Energy-Efficient Dynamic Virtual Machine Management in Data Centers
err2019-02-01
err18
errOAAI
errHan, Zhenhua; Tan, Haisheng; Wang, Rui; Chen, Guihai; Li, Yupeng; Lau, Francis Chi Moon
err分享
err收藏
学者 查看更多内容