Algorithms for dynamic scheduling of unit execution time tasks

被引：0
|
作者：
Díaz, AR
Tchernykh, A
Ecker, KH
机构：
[1] Tech Univ Clausthal, Inst Informat, D-38678 Clausthal Zellerfeld, Germany
[2] Univ Baja California, Tijuana, Mexico
[3] CICESE, Res Ctr, Ensenada, Baja California, Mexico
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2003年 / 146卷 / 02期
关键词：
scheduling; list scheduling; worst case analysis; on-line scheduling; UET;
D O I：
暂无
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We analyze performance properties of list scheduling algorithms. under various dynamic assumptions and different levels of knowledge available for scheduling, considering the case of unit execution time tasks. We focus on bounds for the ISF (immediate successors first) and MISF (maximum number of immediate successors first) scheduling strategies and show the difference from other bounds obtained for the same problem. Finally, we present case studies and experimental results to assess the average behavior. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：403 / 416
页数：14
相关论文
共 50 条
  • [31] Scheduling multiprocessor tasks with genetic algorithms
    Correa, RC
    Ferreira, A
    Rebreyend, P
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (08) : 825 - 837
  • [32] On symbolic scheduling independent tasks with restricted execution times
    Sawitzki, D
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 277 - 289
  • [33] ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORS
    DAVIS, E
    JAFFE, JM
    JOURNAL OF THE ACM, 1981, 28 (04) : 721 - 736
  • [34] Estimation of execution time for computing tasks
    Bielecki, Jan
    Smialek, Michal
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2023, 26 (06): : 3943 - 3956
  • [35] Estimation of execution time for computing tasks
    Jan Bielecki
    Michał Śmiałek
    Cluster Computing, 2023, 26 : 3943 - 3956
  • [36] Energy efficient dual execution mode scheduling for real-time tasks with shared resources
    Wu, Jun
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2016, 31 (03): : 239 - 253
  • [37] On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time
    M.G. Speranza
    Zs. Tuza
    Annals of Operations Research, 1999, 86 : 491 - 506
  • [38] Proposition and evaluation of parallelism-independent scheduling algorithms for DAGs of tasks with non-uniform execution times
    Nikolova, K
    Maeda, A
    Sowa, M
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (06) : 1496 - 1505
  • [39] Uncertainty-based scheduling: Energy-efficient ordering for tasks with variable execution time
    Gruian, F
    Kuchcinski, K
    ISLPED'03: PROCEEDINGS OF THE 2003 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN, 2003, : 465 - 468
  • [40] Real-Time Scheduling for Periodic Tasks in Homogeneous Multi-core System with Minimum Execution Time
    Li, Ying
    Niu, Jianwei
    Zhang, Jiong
    Atiquzzaman, Mohammed
    Long, Xiang
    COLLABORATE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, COLLABORATECOM 2016, 2017, 201 : 175 - 187
12345