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
关键词
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 条
  • [21] STATIONARY AND STABILITY OF FORK-JOIN NETWORKS
    KONSTANTOPOULOS, P
    WALRAND, J
    JOURNAL OF APPLIED PROBABILITY, 1989, 26 (03) : 604 - 614
  • [22] Analytic Approximations of Fork-Join Queues
    Fiorini, Pierre M.
    2015 IEEE 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS (IDAACS), VOLS 1-2, 2015, : 966 - 971
  • [23] INSTRUCTION REORDERING FOR FORK-JOIN PARALLELISM
    SARKAR, V
    SIGPLAN NOTICES, 1990, 25 (06): : 322 - 336
  • [24] Generalized parallel-server fork-join queues with dynamic task scheduling
    Mark S. Squillante
    Yanyong Zhang
    Anand Sivasubramaniam
    Natarajan Gautam
    Annals of Operations Research, 2008, 160 : 227 - 255
  • [25] Generalized parallel-server fork-join queues with dynamic task scheduling
    Squillante, Mark S.
    Zhang, Yanyong
    Sivasubramaniam, Anand
    Gautam, Natarajan
    ANNALS OF OPERATIONS RESEARCH, 2008, 160 (01) : 227 - 255
  • [26] A Contention-Aware Heuristic Scheduling Algorithm for Fork-Join Task Graphs
    Zhang, Jianjun
    Song, Yexin
    Qu, Yong
    2012 IEEE FIFTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2012, : 152 - 156
  • [27] Holistic Analysis for Fork-Join Distributed Tasks supported by the FTT-SE Protocol
    Garibay-Martinez, Ricardo
    Nelissen, Geoffrey
    Ferreira, Luis Lino
    Pedreiras, Paulo
    Pinho, Luis Miguel
    2015 IEEE WORLD CONFERENCE ON FACTORY COMMUNICATION SYSTEMS (WFCS), 2015,
  • [28] Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing Times
    Sinnen, Oliver
    Wang, Huijun
    51ST INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2022, 2022,
  • [29] Dynamic Resource Allocation in Fork-Join Queues
    Marin, Andrea
    Rossi, Sabina
    Sottana, Matteo
    ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS, 2020, 5 (01)
  • [30] INTERPOLATION APPROXIMATIONS FOR SYMMETRICAL FORK-JOIN QUEUES
    VARMA, S
    MAKOWSKI, AM
    PERFORMANCE EVALUATION, 1994, 20 (1-3) : 245 - 265