Time-constrained and network-aware containers scheduling in GPU era

被引:4
|
作者
Rodrigues, Leonardo Rosa [1 ]
Koslovski, Guilherme Piegas [1 ]
Pasin, Marcelo [2 ,3 ]
Pillon, Mauricio Aronne [1 ]
Alves Junior, Omir Correia [1 ]
Miers, Charles Christian [1 ]
机构
[1] Santa Catarina State Univ, Grad Program Appl Comp, Florianopolis, SC, Brazil
[2] Univ Neuchatel, Neuchatel, Switzerland
[3] HES SO, Delemont, Switzerland
关键词
Scheduling; Multitenant; Multicriteria; GPU; Network; ALGORITHM; TOPSIS;
D O I
10.1016/j.future.2020.11.014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The recent advances on data center management and applications development are reflected by lightweight containers technology and critical Quality-of-Service (QoS) requirements. Tenants encapsulate applications in containers abstracting away details on the infrastructure, and entrust its management framework with the provisioning of network and time QOS requirements. In this paper, we addressed this NP-hard scheduling problem proposing a GPU Accelerated Containers Scheduler (GPUACS). We model the joint allocation of network and containers with QoS requirements as a graph embedding problem. GPUACS innovates by refactoring two Multicriteria Decision Makings (MCDMs) to GPU model, as well as by defining an efficient data structure to speed up the comparison of time-evolving QoS requirements. GPUACS follows a modular and configurable architecture, and the scheduling objective function can be adjusted by selecting the MCDM method and setting the appropriated weights to guide the comparisons. An experimental analysis demonstrated the sensitivity that GPU-tailored MCDM methods have to schedule container requests considering critical time, network, and processing criteria, as well as multiple queueing policies. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:72 / 86
页数:15
相关论文
共 50 条
  • [31] Scheduling and control for time-constrained processes in semiconductor manufacturing
    Sun, DS
    Choung, YI
    Lee, YJ
    Jang, YC
    ISSM 2005: IEEE International Symposium on Semiconductor Manufacturing, Conference Proceedings, 2005, : 295 - 298
  • [32] Approximation Algorithms for Time-Constrained Scheduling on Line Networks
    Raecke, Harald
    Rosen, Adi
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (04) : 834 - 856
  • [33] Scheduling time-constrained jobs in the presence of background traffic
    Bhulai, S
    Koole, G
    PROCEEDINGS OF THE 39TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2000, : 1421 - 1426
  • [34] Approximation Algorithms for Time-Constrained Scheduling on Line Networks
    Raecke, Harald
    Rosen, Adi
    SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 337 - 346
  • [35] Approximation Algorithms for Time-Constrained Scheduling on Line Networks
    Harald Räcke
    Adi Rosén
    Theory of Computing Systems, 2011, 49
  • [37] Firebird: Network-aware Task Scheduling for Spark Using SDNs
    He, Xin
    Shenoy, Prashant
    2016 25TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2016,
  • [38] Diktyo: Network-Aware Scheduling in Container-Based Clouds
    Santos, Jose
    Wang, Chen
    Wauters, Tim
    De Turck, Filip
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2023, 20 (04): : 4461 - 4477
  • [39] INT Based Network-Aware Task Scheduling for Edge Computing
    Shreshta, Bibek
    Cziva, Richard
    Arslan, Engin
    2021 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2021, : 879 - 886
  • [40] A metaheuristic solution approach for the time-constrained project scheduling problem
    Verbeeck, Cedric
    Van Peteghem, Vincent
    Vanhoucke, Mario
    Vansteenwegen, Pieter
    Aghezzaf, El-Houssaine
    OR SPECTRUM, 2017, 39 (02) : 353 - 371