Communication and cooling aware job allocation in data centers for communication-intensive workloads

被引:9
|
作者
Meng, Jie [1 ]
Llamosi, Eduard [2 ]
Kaplan, Fulya [1 ]
Zhang, Chulian [2 ]
Sheng, Jiayi [1 ]
Herbordt, Martin [1 ]
Schirner, Gunar [2 ]
Coskun, Ayse K. [1 ]
机构
[1] Boston Univ, Dept Elect & Comp Engn, Boston, MA 02215 USA
[2] Northeastern Univ, Dept Elect & Comp Engn, Boston, MA 02115 USA
基金
美国国家科学基金会;
关键词
High-performance computing; Communication Pattern; Job allocation; Task mapping; Optimization; Cooling management; MOLECULAR-DYNAMICS; PERFORMANCE; PLACEMENT;
D O I
10.1016/j.jpdc.2016.05.016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Energy consumption is an increasingly important concern in data centers. Today, nearly half of the energy in data centers is consumed by the cooling infrastructure. Existing policies on thermally-aware workload allocation do not consider applications that include many tasks (or threads) running on a large set of nodes with significant communication among the tasks. Such jobs, however, constitute most of the cycles in high performance computing (HPC) domain, and have started to appear in other data centers as well. Job allocation strongly affects the performance of such communication-intensive applications. Communication-aware job allocation methods exist, but they focus solely on performance and do not consider cooling energy. This paper proposes a novel job allocation methodology to jointly minimize communication cost and cooling energy consumption in data centers. We formulate and solve the joint optimization problem using binary quadratic programming. Our joint optimization algorithm reduces cooling energy by 16.4% on average with only a 2.66% average increase in application running time compared to solely performance-aware allocations. To further optimize the communication cost, we develop a Charm++ based framework that extracts the communication behavior of applications. We then integrate our job allocation policy with recursive coordinate bisection (RCB) based task mapping method to place highly-communicating tasks in close proximity. Experimental results show that task mapping further decreases the communication cost by up to 20.9% compared to assuming all-to-all communication, a popular assumption in much of the prior work. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:181 / 193
页数:13
相关论文
共 50 条
  • [1] Bandwidth-aware virtual machines allocation for high performance communication-intensive applications
    Huynh, Loc N.
    Nam Thoai
    [J]. 2013 FIFTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN), 2013, : 822 - 826
  • [2] A Communication-Aware Deployment Method for Communication-Intensive Applications in Service Clouds
    Yang, Jingqi
    Liu, Chuanchang
    Shang, Yanlei
    Mao, Zexiang
    Chen, Junliang
    [J]. 2013 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CLOUDCOM-ASIA), 2013, : 111 - 118
  • [3] Optimizing Communication and Cooling Costs in HPC Data Centers via Intelligent Job Allocation
    Kaplan, Fulya
    Meng, Jie
    Coskun, Ayse K.
    [J]. 2013 INTERNATIONAL GREEN COMPUTING CONFERENCE (IGCC), 2013,
  • [4] Replica: A Wireless Manycore for Communication-Intensive and Approximate Data
    Fernando, Vimuth
    Franques, Antonio
    Abadal, Sergi
    Misailovic, Sasa
    Torrellas, Josep
    [J]. TWENTY-FOURTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXIV), 2019, : 849 - 863
  • [5] Scheduling communication-intensive applications on Mesos
    Di Stefano, Alessandro
    Di Stefano, Antonella
    Morana, Giovanni
    [J]. INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2020, 11 (01) : 103 - 114
  • [6] Design Requirements for Communication-Intensive Interactive Applications
    Bolchini, Davide
    Garzotto, Franca
    Paolini, Paolo
    [J]. DESIGN REQUIREMENTS ENGINEERING: A TEN-YEAR PERSPECTIVE, 2009, 14 : 408 - +
  • [7] Topology-Aware Resource Allocation for Data-Intensive Workloads
    Lee, Gunho
    Tolia, Niraj
    Ranganathan, Parthasarathy
    Katz, Randy H.
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (01) : 120 - 124
  • [8] Executing communication-intensive irregular programs efficiently
    Ramakrishnan, V
    Scherson, ID
    [J]. PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000, 1800 : 457 - 468
  • [9] Accelerating Communication-Intensive Parallel Workloads Using Commodity Optical Switches and a Software-Configurable Control Stack
    Lugones, Diego
    Christodoulopoulos, Konstantinos
    Katrinis, Kostas
    Ruffini, Marco
    O'Mahony, Donal
    Collier, Martin
    [J]. EURO-PAR 2013 PARALLEL PROCESSING, 2013, 8097 : 713 - 724
  • [10] Performance drop at executing communication-intensive parallel algorithms
    Morinigo, Jose A.
    Garcia-Muller, Pablo
    Rubio-Montero, Antonio J.
    Gomez-Iglesias, Antonio
    Meyer, Norbert
    Mayo-Garcia, Rafael
    [J]. JOURNAL OF SUPERCOMPUTING, 2020, 76 (09): : 6834 - 6859