Fast and isolation guaranteed coflow scheduling via traffic forecasting in multi-tenant environment

被引:0
|
作者
Li, Chenghao [1 ]
Zhang, Huyin [2 ]
Yang, Fei [3 ]
Hao, Sheng [4 ]
机构
[1] Shandong Normal Univ, Sch Informat Sci & Engn, Daxue Rd, Jinan 250000, Shandong, Peoples R China
[2] Wuhan Univ, Sch Comp Sci, Bayi Rd, Wuhan 430000, Hubei, Peoples R China
[3] China North Commun Technol CO LTD, Wuhan 430000, Hubei, Peoples R China
[4] Cent China Normal Univ, Sch Comp Sci, Luoyu Rd, Wuhan 430079, Hubei, Peoples R China
来源
JOURNAL OF SUPERCOMPUTING | 2024年 / 80卷 / 19期
关键词
Coflow; Scheduling performance; Isolation guarantees;
D O I
10.1007/s11227-024-06457-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
It is a challenging task to achieve the minimum average CCT (coflow completion time) and provide isolation guarantees in multi-tenant datacenters without prior knowledge of coflow sizes. State-of-the-art solutions either focus on minimizing the average CCT or providing optimal isolation guarantees. However, achieving the minimum average CCT and isolation guarantees in multi-tenant datacenters is difficult due to the conflicting nature of these objectives. Therefore, we propose FIGCS-TF (Fast and Isolation Guarantees Coflow Scheduling via Traffic Forecasting), a coflow scheduling algorithm that does not require prior knowledge. FIGCS-TF utilizes a lightweight forecasting module to predict the relative scheduling priority of coflows. Moreover, it employs the MDRF (monopolistic dominant resource fairness) strategy for bandwidth allocation, which is based on super-coflows and helps achieve long-term isolation. Through trace-driven simulations, FIGCS-TF demonstrate communication stages that are 1.12x\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document}, 1.99x\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document}, and 5.50x\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document} faster than DRF (Dominant Resource Fairness), NCDRF (Non-Clairvoyant Dominant Resource Fairness) and Per-Flow Fairness, respectively. In comparison with the theoretically minimum CCT, FIGCS-TF experiences only a 46% increase in average CCT at the top 95th percentile of the dataset. Overall, FIGCS-TF exhibits superior performance in reducing average CCT compared to other algorithms.
引用
收藏
页码:26726 / 26750
页数:25
相关论文
共 50 条
  • [1] Guaranteed Bit Rate Traffic Prioritisation and Isolation in Multi-tenant Radio Access Networks
    Vila, I
    Sallent, O.
    Umbert, A.
    Perez-Romero, J.
    2018 IEEE 23RD INTERNATIONAL WORKSHOP ON COMPUTER AIDED MODELING AND DESIGN OF COMMUNICATION LINKS AND NETWORKS (CAMAD), 2018, : 20 - 25
  • [2] Data isolation in multi-tenant SaaS environment
    Gupta, Keshav
    Kumar, Sandeep
    Agnihotri, Ojaswi
    2016 IEEE INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND AUTOMATION (ICCCA), 2016, : 1290 - 1292
  • [3] Optimal Scheduling Simulation of Software for Multi-tenant in Cloud Computing Environment
    Fan Ying
    Lei, Guan
    2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA), 2014, : 688 - 692
  • [4] Deadline Guaranteed Service for Multi-Tenant Cloud Storage
    Liu, Guoxin
    Shen, Haiying
    Wang, Haoyu
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (10) : 2851 - 2865
  • [5] Deadline Guaranteed Service for Multi-Tenant Cloud Storage
    Liu, Guoxin
    Shen, Haiying
    2015 IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P), 2015,
  • [6] ReLAQS: Reducing Latency for Multi-Tenant Approximate Queries via Scheduling
    Stafman, Logan
    Or, Andrew
    Freedman, Michael J.
    MIDDLEWARE'19: PROCEEDINGS OF THE 2019 MIDDLEWARE'19: 20TH INTERNATIONAL MIDDLEWARE CONFERENCE, 2019, : 280 - 292
  • [7] Simulation on the optimized scheduling of multi-tenant software under cloud computing environment
    Jin XiaoQian
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 6246 - 6250
  • [8] Improving Flow Scheduling Scheme With Mix-Traffic in Multi-Tenant Data Centers
    Wang, Shuo
    Zhang, Jiao
    Huang, Tao
    Pan, Tian
    Liu, Jiang
    Liu, Yunjie
    IEEE ACCESS, 2020, 8 : 64666 - 64677
  • [9] Multi-tenant Isolation of What? Building a Secure Tenant Isolation Architecture for Cloud Networks
    Medeiros, Bruno
    Simplicio, Marcos A., Jr.
    Andrade, Ewerton R.
    PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '18), 2018, : 518 - 518
  • [10] Workflow Scheduling in Multi-Tenant Cloud Computing Environments
    Rimal, Bhaskar Prasad
    Maier, Martin
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (01) : 290 - 304