Data-localization scheduling inside processor-cluster for multigrain parallel processing

Akimasa Yoshida, Ke N.Ichi Koshizuka, Wataru Ogata, Hironori Kasahara

研究成果: Article

抜粋

This paper proposes a data-localization scheduling scheme inside a processor-cluster for multigrain parallel processing, which hierarchically exploits parallelism among coarsegrain tasks like loops, medium-grain tasks like loop iterations and near-fine-grain tasks like statements. The proposed scheme assigns near-fine-grain or medium-grain tasks inside coarse-grain tasks onto processors inside a processor-cluster so that maximum parallelism can be exploited and inter-processor data transfer can be minimum after data-localization for coarse-grain tasks across processor-clusters. Performance evaluation on a multiprocessor system OSCAR shows that multigrain parallel processing with the proposed data-localization scheduling can reduce execution time for application programs by 10% compared with multigrain parallel processing without data-localization.

元の言語English
ページ(範囲)473-478
ページ数6
ジャーナルIEICE Transactions on Information and Systems
E80-D
発行部数4
出版物ステータスPublished - 1997 1 1

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

フィンガープリント Data-localization scheduling inside processor-cluster for multigrain parallel processing' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用