A comparison of multiprocessor task scheduling algorithms with communication costs

Reakook Hwang, Mitsuo Gen, Hiroshi Katayama

    研究成果: Article

    80 引用 (Scopus)

    抜粋

    Both parallel and distributed network environment systems play a vital role in the improvement of high performance computing. Of primary concern when analyzing these systems is multiprocessor task scheduling. Therefore, this paper addresses the challenge of multiprocessor task scheduling parallel programs, represented as directed acyclic task graph (DAG), for execution on multiprocessors with communication costs. Moreover, we investigate an alternative paradigm, where genetic algorithms (GAs) have recently received much attention, which is a class of robust stochastic search algorithms for various combinatorial optimization problems. We design the new encoding mechanism with a multi-functional chromosome that uses the priority representation-the so-called priority-based multi-chromosome (PMC). PMC can efficiently represent a task schedule and assign tasks to processors. The proposed priority-based GA has show effective performance in various parallel environments for scheduling methods.

    元の言語English
    ページ(範囲)976-993
    ページ数18
    ジャーナルComputers and Operations Research
    35
    発行部数3
    DOI
    出版物ステータスPublished - 2008 3

    ASJC Scopus subject areas

    • Information Systems and Management
    • Management Science and Operations Research
    • Applied Mathematics
    • Modelling and Simulation
    • Transportation

    フィンガープリント A comparison of multiprocessor task scheduling algorithms with communication costs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用