Autonomic Resource Management for Program Orchestration in Large-scale Data Analysis

被引:0
|
作者
Tanaka, Masahiro [1 ]
Taurat, Kenjiro [2 ]
Torisawa, Kentaro [1 ]
机构
[1] Natl Inst Informat & Commun Technol NICT, Data Driven Intelligent Syst Res Ctr DIRECT, Universal Commun Res Inst, 3-5 Hikaridai,Seika Cho, Kyoto 6190289, Japan
[2] Univ Tokyo, Grad Sch Informat Sci & Technol, Dept Informat & Commun Engn, Bunkyo Ku, 7-3-1 Hongo, Tokyo 1130033, Japan
来源
2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS) | 2017年
关键词
Large-scale data processing; program composition; service composition; self-tuning; resource management;
D O I
10.1109/IPDPS.2017.89
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Large-scale data analysis applications are becoming more and more prevalent in a wide variety of areas. These applications are composed of many currently available programs called analysis components. Thousands of analysis component processes are orchestrated on many compute nodes. This paper proposes a novel self-tuning framework for optimizing an application's throughput in large-scale data analysis. One challenge is developing efficient orchestration that takes into account the diversity of analysis components and the varying performances of compute nodes. In our previous work, we achieved such an orchestration to a certain degree by introducing our own middleware, which wraps each analysis component as a remote procedure call (RPC) service. The middleware also pools the processes to reduce startup overhead, which is a serious obstacle to achieving high throughput. This work tackles the remaining task of tuning the size of the analysis components' process pools to maximize the application's throughput. This is challenging because analysis components differ drastically in turnaround times and memory footprints. The size of the process pool for each type of analysis component should be set by giving consideration to these properties as well as the constraints on both the memory capacity and the processor core counts. In this work, we formulate this task as a linear programming problem and obtain the optimal pool sizes by solving it. Compared to our previous work, we significantly improved the scalability of our framework by reformulating the performance model to work on hundreds of heterogeneous nodes. We also extended the service allocation mechanism to manage the computational load on each compute node and reduce communication overhead. The experimental results show that our approach is scalable to thousands of analysis component processes running on 200 compute nodes across three clusters. Moreover, our approach significantly reduces memory footprint.
引用
收藏
页码:1088 / 1097
页数:10
相关论文
共 50 条
  • [21] Mean-field Macro Computation in Large-scale Cloud Service Systems with Resource Management and Job Scheduling
    Yang, Feifei
    Jiang, Yanping
    Li, Quanlin
    JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2019, 28 (02) : 238 - 261
  • [22] Mean-field Macro Computation in Large-scale Cloud Service Systems with Resource Management and Job Scheduling
    Feifei Yang
    Yanping Jiang
    Quanlin Li
    Journal of Systems Science and Systems Engineering, 2019, 28 : 238 - 261
  • [23] Special Issue on Algorithms for the Resource Management of Large Scale Infrastructures
    Ardagna, Danilo
    Canali, Claudia
    Lancellotti, Riccardo
    ALGORITHMS, 2018, 11 (12):
  • [24] Average-Case Analysis of Greedy Matching for Large-Scale D2D Resource Sharing
    Gao, Shuqin
    Courcoubetis, Costas A.
    Duan, Lingjie
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (05) : 3707 - 3721
  • [25] Microscopical Resource Allocation for Large-Scale Apartment Foundation Work Using Queuing Systems
    Wee, Kyungsoo
    Ham, Namhyuk
    Kim, Jae-Jun
    BUILDINGS, 2022, 12 (02)
  • [26] Distributed Double Auction Mechanisms for Large-Scale Device-to-Device Resource Trading
    Gao, Shuqin
    Courcoubetis, Costas A.
    Duan, Lingjie
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2023, 31 (03) : 1308 - 1323
  • [27] Optimization of hadoop cluster for analyzing large-scale sequence data in bioinformatics
    Toth, Adam
    Karimi, Ramin
    ANNALES MATHEMATICAE ET INFORMATICAE, 2019, 50 : 187 - 202
  • [28] Large-scale Persistent Numerical Data Source Monitoring System Experiences
    Brandt, J.
    Gentile, A.
    Showerman, M.
    Enos, J.
    Fullop, J.
    Bauer, G.
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 1711 - 1720
  • [29] Virtual Cluster Deployment Model for Large-Scale Data Processing Jobs
    Cao, Yunpeng
    Wang, Haifeng
    IEEE ACCESS, 2020, 8 : 131870 - 131884
  • [30] Autonomic resource management in virtualized data centers using fuzzy logic-based approaches
    Xu, Jing
    Zhao, Ming
    Fortes, Jose
    Carpenter, Robert
    Yousif, Mazin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2008, 11 (03): : 213 - 227