Scheduling multiprocessor tasks - a survey

被引：0
|
作者：
Blazewicz, J. [1 ]
Drozdowski, M. [1 ]
Weglarz, J. [1 ]
机构：
[1] Technical Univ of Poznan, Poznan, Poland
来源：
Microcomputer Applications | 1994年 / 13卷 / 02期
关键词：
Algorithms - Computational complexity - Computer program listings - Fault tolerant computer systems - Parallel processing systems - Program compilers - Response time (computer systems) - Scheduling - Surveys;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we survey the current problems that arise for the scheduling of multiprocessor tasks, i.e., those tasks that require the simultaneous use of more than one processor. The multiprocessor model seems to be natural for many applications exploiting their naturally inherited parallelism. This point of view, however, is different than the standard view in scheduling theory. Thus, multiprocessor tasks require a new look at the assumptions of the scheduling theory, and it requires new algorithms, as well.
引用
收藏
页码：89 / 97
相关论文
共 50 条
  • [31] SCHEDULING MULTIPROCESSOR TASKS ON 3-DEDICATED PROCESSORS
    BLAZEWICZ, J
    DELLOLMO, P
    DROZDOWSKI, M
    SPERANZA, MG
    INFORMATION PROCESSING LETTERS, 1992, 41 (05) : 275 - 280
  • [32] OPTIMAL PREEMPTIVE SCHEDULING OF INDEPENDENT TASKS FOR MULTIPROCESSOR SYSTEMS
    ROWICKI, A
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1978, 26 (07): : 643 - 650
  • [33] Energy efficient scheduling of parallel tasks on multiprocessor computers
    Li, Keqin
    JOURNAL OF SUPERCOMPUTING, 2012, 60 (02): : 223 - 247
  • [34] Scheduling arbitrary number of malleable tasks on multiprocessor systems
    Barketau, M. S.
    Kovalyov, M. Y.
    Weglarz, J.
    Machowiak, M.
    BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES, 2014, 62 (02) : 255 - 261
  • [35] Scheduling Stochastic tasks with parallelizable contents in multiprocessor systems
    Maksoud, EA
    Ammar, RA
    2005 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Vols 1 and 2, 2005, : 69 - 81
  • [36] ON THE COMPLEXITY OF SCHEDULING MULTIPROCESSOR TASKS IN MICROPROCESSOR SYSTEMS.
    Blazewicz, Jacek
    Drabowski, Mieczyslaw
    Weglarz, Jan
    Bulletin of the Polish Academy of Sciences: Technical Sciences, 1984, 32 (9-10): : 591 - 600
  • [37] Scheduling multiprocessor tasks for mean flow time criterion
    Drozdowski, M
    Dell'Olmo, P
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (06) : 571 - 585
  • [38] Complexity and approximation results for scheduling multiprocessor tasks on a ring
    Confessore, G
    Dell'Olmo, P
    Giordani, S
    DISCRETE APPLIED MATHEMATICS, 2003, 133 (1-3) : 29 - 44
  • [39] Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks
    Hidri, Lotfi
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 182 : 531 - 534
  • [40] Minimizing migrations in fair multiprocessor scheduling of persistent tasks
    Tracy Kimbrel
    Baruch Schieber
    Maxim Sviridenko
    Journal of Scheduling, 2006, 9 : 365 - 379
12345