Optimization Techniques for Parallel Codes of Irregular Scientific Computations

• Item type: Trans(1)
• 公開日: 2003-01-15
• タイトル: Optimization Techniques for Parallel Codes of Irregular Scientific Computations
• タイトル / 言語: en
• タイトル: Optimization Techniques for Parallel Codes of Irregular Scientific Computations
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: コード生成・最適化
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Computer Software The University of Aizu
• 著者所属: Department of Information Management Southern Taiwan University of Technology
• 著者所属: Department of Computer Science Georgia State University
• 著者所属(英): en
• 著者所属(英): Department of Computer Software, The University of Aizu
• 著者所属(英): en
• 著者所属(英): Department of Information Management, Southern Taiwan University of Technology
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Georgia State University
• 著者名: Minyi, Guo; Weng-LongChang; Yi, Pan
• 著者名(英): Minyi, Guo; Weng-Long, Chang; Yi, Pan
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In this paper we propose a communication cost reduction computes rule for irregular loop partitioning called least communication computes rule.For an irregular loop with nonlinear array subscripts the loop is transformed to a normalized single loop then we partition the loop iterations to processors on which the minimal communication cost is ensured when executing those iterations.We also give some interprocedural optimization techniques for communication preprocessing when the irregular code has the procedure call.The experimental results show that in most cases our approaches achieved better performance than other loop partitioning rules.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In this paper,we propose a communication cost reduction computes rule for irregular loop partitioning,called least communication computes rule.For an irregular loop with nonlinear array subscripts,the loop is transformed to a normalized single loop,then we partition the loop iterations to processors on which the minimal communication cost is ensured when executing those iterations.We also give some interprocedural optimization techniques for communication preprocessing when the irregular code has the procedure call.The experimental results show that,in most cases,our approaches achieved better performance than other loop partitioning rules.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11560614
• 書誌情報: 情報処理学会論文誌ハイパフォーマンスコンピューティングシステム（HPS）; 巻 44, 号 SIG01(HPS6), p. 58-69, 発行日 2003-01-15
• 出版者 / 言語: ja
• 出版者: 情報処理学会