Scheduling of Malleable Fork-Join Tasks with Constraint Programming

被引：2
|
作者：
Nishikawa, Hiroki [1 ]
Shimada, Kana [1 ]
Taniguchi, Ittetsu [2 ]
Tomiyama, Hiroyuki [1 ]
机构：
[1] Ritsumeikan Univ, Grad Sch Sci & Engn, Kusatsu, Shiga, Japan
[2] Osaka Univ, Grad Sch Informat Sci & Technol, Suita, Osaka, Japan
来源：
2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR 2018) | 2018年
关键词：
Task scheduling; multicore; constraint programming;
D O I：
10.1109/CANDAR.2018.00025
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes a scheduling method for fork-join malleable tasks based on constraint programming (CP). For a given task-graph, each of the tasks can be split into multiple sub-tasks, and each sub-task is scheduled independently. The proposed method decides the number of sub-tasks to be split, and the execution order of tasks in such a way that the overall schedule length is minimized. Experimental results show that our CP-based scheduling method could find better schedules than the state-of-the-art method which is based on integer linear programming.
引用
收藏
页码：133 / 138
页数：6
相关论文
共 50 条
  • [41] Performability analysis of fork-join queueing systems
    Indian Inst of Science, Bangalore, India
    J Oper Res Soc, 10 (1237-1249):
  • [42] Non-Asymptotic Delay Bounds for (k, l) Fork-Join Systems and Multi-Stage Fork-Join Networks
    Fidler, Markus
    Jiang, Yuming
    IEEE INFOCOM 2016 - THE 35TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, 2016,
  • [43] A design methodology to develop efficient fork-join structures
    Ammar, RA
    Todd, R
    SECOND IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 1997, : 601 - 608
  • [44] EXACT MONTE CARLO SIMULATION FOR FORK-JOIN NETWORKS
    Dai, Hongsheng
    ADVANCES IN APPLIED PROBABILITY, 2011, 43 (02) : 484 - 503
  • [45] Speed scaling in fork-join queues: a comparative study
    Marin, Andrea
    Rossi, Sabina
    Williamson, Carey
    PROCEEDINGS OF THE 13TH EAI INTERNATIONAL CONFERENCE ON PERFORMANCE EVALUATION METHODOLOGIES AND TOOLS ( VALUETOOLS 2020), 2020, : 80 - 87
  • [46] Departure process in a mixed fork-join synchronization network
    El-Taha, Muhammad
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (08) : 1272 - 1279
  • [47] Power control in saturated fork-join queueing systems
    Marin, Andrea
    Rossi, Sabina
    PERFORMANCE EVALUATION, 2017, 116 : 101 - 118
  • [48] Localized Fault Recovery for Nested Fork-Join Programs
    Kestor, Gokcen
    Krishnamoorthy, Sriram
    Ma, Wenjing
    2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, : 397 - 408
  • [49] Tail asymptotics for the delay in a Brownian fork-join queue
    Schol, Dennis
    Vlasiou, Maria
    Zwart, Bert
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2023, 164 : 99 - 138
  • [50] Efficient Fork-Join on GPUs through Warp Specialization
    Jacob, Arpith C.
    Eichenberger, Alexandre E.
    Sung, Hyojin
    Antao, Samuel F.
    Bercea, Gheorghe-Teodor
    Bertolli, Carlo
    Bataev, Alexey
    Jin, Tian
    Chen, Tong
    Sura, Zehra
    Rokos, Georgios
    O'Brien, Kevin
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2017, : 358 - 367
12345