A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

Takao Tobita*, Hironori Kasahara

*この研究の対応する著者

研究成果: Article査読

118 被引用数 (Scopus)

抄録

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it difficult to compare the performance of algorithms developed in different research groups. To make it possible to evaluate algorithms under the same conditions so that their performances can be compared fairly, this paper proposes a standard task graph set covering many of the proposed task graph generation methods. This paper also evaluates as examples two heuristic algorithms (CP and CP/MISF), a practical sequential optimization algorithm (DF/IHS), and a practical parallel optimization algorithm (PDF/IHS) using the proposed standard task graph set. This set is available at http://www.kasahara. elec.waseda.ac.jp/schedule/.

本文言語English
ページ(範囲)379-394
ページ数16
ジャーナルJournal of Scheduling
5
5
DOI
出版ステータスPublished - 2002 9

ASJC Scopus subject areas

  • ソフトウェア
  • 工学(全般)
  • 経営科学およびオペレーションズ リサーチ
  • 人工知能

フィンガープリント

「A standard task graph set for fair evaluation of multiprocessor scheduling algorithms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル