Art

J-GLOBAL ID：200902228218028180   Reference number：03A0635701

Efficient Loop Partitioning for Parallel Codes of Irregular Scientific Computations

不規則科学計算用並列プログラムのための効率的なループ分割

Author (1)： GUO M (Univ. Aizu, Aizu-Wakamatsu-shi, JPN)
Material： IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Inf Syst (Inst Electron Inf Commun Eng))
Volume： E86-D  Issue： 9  Page： 1825-1834  Publication year： Sep. 01, 2003 
JST Material Number： L1371A  ISSN： 0916-8532  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *compiler ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0635701&from=J-GLOBAL&jstjournalNo=L1371A") }}

JST classification (1)： Language processors  (JD03040F)

Reference (20)：

• ALLEN, R. Optimizing Compilers for Modern Architectures. 2001
• AGRAWAL, G. Interprocedural compilation of irregular applications for distributed memory machines. Language and Compilers for Parallel Computing. 1994, 1-16
• ASENJO, R. On the automatic parallelization of sparse and irregular Fortran codes. Technical Report 1512, University of Illinois at Urbana-Champaign, CSRD. 1996
• DAS, R. Communication optimizations for irregular scientific computations on distributed memory architectures. J. Parallel Distrib. Comput. 1994, 22, 3, 462-479
• DING, C. Improving cache performance of dynamic applications with computation and data layout transformations. Proc. SIGPLAN'99 Conference on Programming Language Design and Implementation, Atlanta. 1999

Terms in the title (3)： 科学計算 ,  並列プログラム ,  ループ