A comparison of the static task graph scheduling algorithms

被引：0
|
作者：
Brest, J [1 ]
Zumer, V [1 ]
机构：
[1] Univ Maribor, Fac Elect Engn & Comp Sci, Maribor, Slovenia
来源：
ITI 2001: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES | 2001年
关键词：
parallel processing; task graph; list scheduling; processor allocation;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper the new algorithm for the static task graph scheduling on multiprocessor systems is proposed and the comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a Prototype Standard Task Graph Set.
引用
收藏
页码：43 / 48
页数：6
相关论文
共 50 条
  • [31] Approximation algorithm for the static task scheduling on multiprocessors
    Brest, Janez
    Žumer, Viljem
    Elektrotehniski Vestnik/Electrotechnical Review, 2000, 67 (02): : 138 - 144
  • [32] Reconfiguration-aware Task Graph Scheduling
    Kooti, Hessam
    Bozorgzadeh, Eli
    PROCEEDINGS IEEE/IFIP 13TH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING 2015, 2015, : 163 - 167
  • [33] A novel hybrid algorithm for task graph scheduling
    Nezhad, Vahid Majid
    Gader, Habib Motee
    Efimov, Evgueni
    International Journal of Computer Science Issues, 2011, 8 (02): : 32 - 38
  • [34] Streaming Task Graph Scheduling for Dataflow Architectures
    De Matteis, Tiziano
    Gianinazzi, Lukas
    Licht, Johannes de Fine
    Hoefler, Torsten
    PROCEEDINGS OF THE 32ND INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE PARALLEL AND DISTRIBUTED COMPUTING, HPDC 2023, 2023, : 225 - 237
  • [35] Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set
    Tobita, T
    Kouda, M
    Kasahara, H
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 745 - 751
  • [36] Runtime Scheduling Policies for Distributed Graph Algorithms
    Firoz, Jesun Sahariar
    Zalewski, Marcin
    Lumsdaine, Andrew
    Barnas, Martina
    2018 32ND IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2018, : 640 - 649
  • [37] COMPARISON OF ALGORITHMS IN GRAPH PARTITIONING
    Guenoche, Alain
    RAIRO-OPERATIONS RESEARCH, 2008, 42 (04) : 469 - 484
  • [38] Tightness results for malleable task scheduling algorithms
    Schwarz, Ulrich M.
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 1059 - 1067
  • [39] Task scheduling on minimal processors with genetic algorithms
    Yao, WS
    You, JY
    PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 210 - 214
  • [40] A performance study of multiprocessor task scheduling algorithms
    Shiyuan Jin
    Guy Schiavone
    Damla Turgut
    The Journal of Supercomputing, 2008, 43 : 77 - 97
12345