中文版 | English
Title

When Power-of-d-Choices Meets Priority

Author
DOI
Publication Years
2022
Conference Name
30th IEEE/ACM International Symposium on Quality of Service (IWQoS)
ISSN
1548-615X
ISBN
978-1-6654-6825-1
Source Title
Pages
1-10
Conference Date
10-12 June 2022
Conference Place
Oslo, Norway
Publication Place
345 E 47TH ST, NEW YORK, NY 10017 USA
Publisher
Abstract
Power-of-d-choices (Pod) is a popular load balancing strategy, which has received much attention from both academia and industry. However, much prior work on Pod has focused on uniform tasks without priorities. In reality, tasks may have different priorities according to their service sensitivity, pricing, or importance to guarantee the quality of service (QoS). In this work, we distinguish two types of priorities in Pod: scheduling and service priorities. We propose Pod-SSP, which is a Pod algorithm with Scheduling and Service Priorities. To better understand the impact of priorities on the performance of tasks, we consider two simple variants of Pod-SSP: Pod with SCheduling Priorities (Pod-SCP) and Pod with SErvice Priorities (Pod-SEP). Utilizing mean-field approximation, we systematically study the performance of these protocols in the large-system regime. Our theoretical and simulation results show that high-priority tasks can have a more than 3x better delay relative to a system running the original Pod algorithm, and meanwhile, low-priority tasks only slightly sacrifice their delay.
Keywords
SUSTech Authorship
First
Language
English
URL[Source Record]
Indexed By
Funding Project
Natural Sciences and Engineering Research Council of Canada (NSERC)[RGPIN-2016-05310] ; Research Grants Council of Hong Kong[11209520] ; CUHK["4055138","4937007","4937008","5501329","5501517"]
WOS Research Area
Computer Science ; Engineering ; Telecommunications
WOS Subject
Computer Science, Theory & Methods ; Engineering, Electrical & Electronic ; Telecommunications
WOS Accession No
WOS:000853833300017
EI Accession Number
20223112522395
EI Keywords
Scheduling ; Scheduling algorithms
ESI Classification Code
Management:912.2
Scopus EID
2-s2.0-85135382228
Data Source
Scopus
PDF urlhttps://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9812880
Citation statistics
Cited Times [WOS]:0
Document TypeConference paper
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/375660
DepartmentResearch Institute of Trustworthy Autonomous Systems
Affiliation
1.Southern University of Science and Technology,Research Institute of Trustworthy Autonomous Systems,China
2.University of British Columbia,Unity Technologies,Canada
3.University of British Columbia,School of Engineering,Canada
4.Chinese University of Hong Kong,Department of Computer Science and Engineering,Hong Kong
First Author AffilicationResearch Institute of Trustworthy Autonomous Systems
First Author's First AffilicationResearch Institute of Trustworthy Autonomous Systems
Recommended Citation
GB/T 7714
Niu,Jianyu,Wang,Chunpu,Feng,Chen,et al. When Power-of-d-Choices Meets Priority[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2022:1-10.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Niu,Jianyu]'s Articles
[Wang,Chunpu]'s Articles
[Feng,Chen]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Niu,Jianyu]'s Articles
[Wang,Chunpu]'s Articles
[Feng,Chen]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Niu,Jianyu]'s Articles
[Wang,Chunpu]'s Articles
[Feng,Chen]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.