PISCES: Optimizing Multi-Job Application Execution in MapReduce

被引:4
|
作者
Chen, Qi [1 ]
Yao, Jinyu [1 ]
Li, Benchao [1 ]
Xiao, Zhen [1 ]
机构
[1] Peking Univ, Dept Comp Sci, Beijing 100871, Peoples R China
基金
中国国家自然科学基金;
关键词
MapReduce; job dependency; group scheduling; pipeline; OPTIMIZATION;
D O I
10.1109/TCC.2016.2603509
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, many MapReduce applications consist of groups of jobs with dependencies among each other, such as iterative machine learning applications and large database queries. Unfortunately, the MapReduce framework is not optimized for these multi-job applications. It does not explore the execution overlapping opportunities among jobs and can only schedule jobs independently. These issues significantly inflate the application execution time. This paper presents Pipeline Improvement Support with Critical chain Estimation Scheduling (PISCES), a critical chain optimization (a critical chain refers to a series of jobs which will make the application run longer if any one of them is delayed), to provide better support for multi-job applications. PISCES extends the existing MapReduce framework to allow scheduling for multiple jobs with dependencies by dynamically building up a job dependency DAG for current running jobs according to their input and output directories. Then using the dependency DAG, it provides an innovative mechanism to facilitate the data pipelining between the output phase (map phase in the Map-Only job or reduce phase in the Map-Reduce job) of an upstream job and the map phase of a downstream job. This offers a new execution overlapping between dependent jobs in MapReduce which effectively reduces the application runtime. Moreover, PISCES proposes a novel critical chain job scheduling model based on the accurate critical chain estimation. Experiments show that PISCES can increase the degree of system parallelism by up to 68 percent and improve the execution speed of applications by up to 52 percent.
引用
收藏
页码:273 / 286
页数:14
相关论文
共 50 条
  • [21] PRODUCTIVITY ANALYSIS SIMULATORS FOR MULTI-JOB AND BATCHING TYPE EQUIPMENTS
    PATEL, MM
    COMPUTERS & INDUSTRIAL ENGINEERING, 1977, 1 (04) : 273 - 277
  • [22] Determining Effective Swarm Sizes for Multi-Job Type Missions
    Chandarana, Meghan
    Lewis, Michael
    Sycara, Katia
    Scherer, Sebastian
    2018 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2018, : 4848 - 4853
  • [23] Efficient multi-job federated learning scheduling with fault tolerance
    Fu, Boqian
    Chen, Fahao
    Pan, Shengli
    Li, Peng
    Su, Zhou
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2025, 18 (02)
  • [24] On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data
    Gábor Bacsó
    Ádám Visegrádi
    Attila Kertesz
    Zsolt Németh
    Journal of Grid Computing, 2014, 12 : 169 - 186
  • [25] Queuing-Oriented Job Optimizing Scheduling In Cloud Mapreduce
    He, Ting-Qin
    Cai, Li-Jun
    Deng, Zi-Yun
    Meng, Tao
    Wang, XuAn
    ADVANCES ON P2P, PARALLEL, GRID, CLOUD AND INTERNET COMPUTING, 2017, 1 : 435 - 446
  • [27] Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
    Liu, Linzhong
    Gao, Xin
    APPLIED MATHEMATICAL MODELLING, 2009, 33 (10) : 3926 - 3935
  • [28] Multi-job cutting stock problem with due dates and release dates
    McGill Univ, Montreal, Canada
    J Oper Res Soc, 4 (490-510):
  • [29] On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data
    Bacso, Gabor
    Visegradi, Adam
    Kertesz, Attila
    Nemeth, Zsolt
    JOURNAL OF GRID COMPUTING, 2014, 12 (01) : 169 - 186
  • [30] Non-preemptive offline multi-job mapping for a photonic network on a chip
    Reza, Akram
    Mirzaee, Reza Faghih
    NANO COMMUNICATION NETWORKS, 2017, 11 : 11 - 23