Switches for HIRE: Resource Scheduling for Data Center In-Network Computing

被引:22
作者
Bloecher, Marcel [1 ]
Wang, Lin [1 ,2 ]
Eugster, Patrick [3 ,4 ]
Schmidt, Max [1 ]
机构
[1] Tech Univ Darmstadt, Darmstadt, Germany
[2] Vrije Univ Amsterdam, Amsterdam, Netherlands
[3] USI Lugano, Lugano, Switzerland
[4] Purdue Univ, W Lafayette, IN 47907 USA
来源
ASPLOS XXVI: TWENTY-SIXTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS | 2021年
基金
欧洲研究理事会; 瑞士国家科学基金会; 美国国家科学基金会;
关键词
data center; scheduling; in-network computing; heterogeneity; nonlinear resource usage;
D O I
10.1145/3445814.3446760
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The recent trend towards more programmable switching hardware in data centers opens up new possibilities for distributed applications to leverage in-network computing (INC). Literature so far has largely focused on individual application scenarios of INC, leaving aside the problem of coordinating usage of potentially scarce and heterogeneous switch resources among multiple INC scenarios, applications, and users. The traditional model of resource pools of isolated compute containers does not fit an INC-enabled data center. This paper describes HIRE, a Holistic INC-aware Resource managEr which allows for server-local and INC resources to be coordinated in a unified manner. HIRE introduces a novel flexible resource (meta-)model to address heterogeneity, resource interchangeability, and non-linear resource requirements, and integrates dependencies between resources and locations in a unified cost model, cast as a min-cost max-flow problem. In absence of prior work, we compare HIRE against variants of state-of-the-art schedulers retrofitted to handle INC requests. Experiments with a workload trace of a 4000 machine cluster show that HIRE makes better use of INC resources by serving 8- 30% more INC requests, while at the same time reducing network detours by 20%, and reducing tail placement latency by 50%.
引用
收藏
页码:268 / 285
页数:18
相关论文
共 92 条
[11]   Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN [J].
Bosshart, Pat ;
Gibb, Glen ;
Kim, Hun-Seok ;
Varghese, George ;
McKeown, Nick ;
Izzard, Martin ;
Mujica, Fernando ;
Horowitz, Mark .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :99-110
[12]   Borg, Omega, and Kubernetes [J].
Burns, Brendan ;
Grant, Brian ;
Oppenheimer, David ;
Brewer, Eric ;
Wilkes, John .
COMMUNICATIONS OF THE ACM, 2016, 59 (05) :50-57
[13]  
Chowdhury M, 2016, 13TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '16), P407
[14]  
Curino C, 2019, PROCEEDINGS OF THE 16TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, P177
[15]  
Curino Carlo, 2014, P ACM S CLOUD COMP S
[16]  
Dang HT, 2016, ACM SIGCOMM COMP COM, V46, P18, DOI 10.1145/2935634.2935638
[17]  
Dang HuynhTu., 2015, Proceedings_of_the_1st_ACM_SIGCOMM_Symposium on_Software_Defined_Networking_Research, page, P5
[18]   Kairos: Preemptive Data Center Scheduling Without Runtime Estimates [J].
Delgado, Pamela ;
Didona, Diego ;
Dinu, Florin ;
Zwaenepoel, Willy .
PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '18), 2018, :135-148
[19]   Job-aware Scheduling in Eagle: Divide and Stick to Your Probes [J].
Delgado, Pamela ;
Didona, Diego ;
Dinu, Florin ;
Zwaenepoel, Willy .
PROCEEDINGS OF THE SEVENTH ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC 2016), 2016, :497-509
[20]   Quasar: Resource-Efficient and QoS-Aware Cluster Management [J].
Delimitrou, Christina ;
Kozyrakis, Christos .
ACM SIGPLAN NOTICES, 2014, 49 (04) :127-143