DocumentCode
2586590
Title
Notice of Violation of IEEE Publication Principles
Communication Generation for Irregular Parallel Applications
Author
Changjun Hu ; Jing Li ; Jue Wang ; Yonghong Li ; Liang Ding ; Jianjiang Li
Author_Institution
Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing
fYear
2006
fDate
13-17 Sept. 2006
Firstpage
263
Lastpage
270
Abstract
Notice of Violation of IEEE Publication Principles
"Communication Generation for Irregular Parallel Applications,"
by Changjun Hu, Jing Li, Jue Wang, Yonghong Li, Liang Ding, and Jianjiang Li,
in the Proceedings of the International Symposium on Parallel Computing in Electrical Engineering, 2006 (PAR ELEC 2006) pp.263-270
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains portions of original text from the papers cited below. The original text was copied without appropriate attribution.
"Communication Generation for Aligned and Cyclic (K) Distributions Using Integer Lattice,"
by Eric Hung-Yu Tseng and Jean-Luc Gaudiot
in IEEE Transactions on Parallel and Distributed Systems, 10(2), February 1999Irregular computing significantly influences the performance of large scale parallel applications. How to generate local memory access sequence and communication set efficiently for irregular parallel application is an important issue in compiling a data parallel language into a single program multiple data (SPMD) code for distributed-memory machines. In this paper, we propose a hybrid approach, which combines the advantages of the algebra method and the integer lattice method. Our approach derives an algebraic solution of communication set enumeration at compile time for the situation of irregular array references in nested loops. Based on the integer lattice, we develop our method for global-to-local and local-to-global index translations in the case of alignment and cyclic (k) distribution. Then, we present our algorithm for the corresponding SPMD code generation, which adopts some communication optimization techniques. In our method, when parameters are known, the communication set generation, the global-to-local and local-to-global index translations, and the S- MD code generation can be completed at compile time without inspector phase of run time
"Communication Generation for Irregular Parallel Applications,"
by Changjun Hu, Jing Li, Jue Wang, Yonghong Li, Liang Ding, and Jianjiang Li,
in the Proceedings of the International Symposium on Parallel Computing in Electrical Engineering, 2006 (PAR ELEC 2006) pp.263-270
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains portions of original text from the papers cited below. The original text was copied without appropriate attribution.
"Communication Generation for Aligned and Cyclic (K) Distributions Using Integer Lattice,"
by Eric Hung-Yu Tseng and Jean-Luc Gaudiot
in IEEE Transactions on Parallel and Distributed Systems, 10(2), February 1999Irregular computing significantly influences the performance of large scale parallel applications. How to generate local memory access sequence and communication set efficiently for irregular parallel application is an important issue in compiling a data parallel language into a single program multiple data (SPMD) code for distributed-memory machines. In this paper, we propose a hybrid approach, which combines the advantages of the algebra method and the integer lattice method. Our approach derives an algebraic solution of communication set enumeration at compile time for the situation of irregular array references in nested loops. Based on the integer lattice, we develop our method for global-to-local and local-to-global index translations in the case of alignment and cyclic (k) distribution. Then, we present our algorithm for the corresponding SPMD code generation, which adopts some communication optimization techniques. In our method, when parameters are known, the communication set generation, the global-to-local and local-to-global index translations, and the S- MD code generation can be completed at compile time without inspector phase of run time
Keywords
distributed memory systems; parallel languages; program compilers; set theory; SPMD code generation; algebra method; communication generation; data parallel language; distributed-memory machines; global-to-local index translations; integer lattice method; irregular computing; large scale parallel applications; local-to-global index translations; single program multiple data code; Algebra; Appropriate technology; Concurrent computing; Distributed computing; Large-scale systems; Lattices; Notice of Violation; Parallel languages; Parallel processing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on
Conference_Location
Bialystok
Print_ISBN
0-7695-2554-7
Type
conf
DOI
10.1109/PARELEC.2006.24
Filename
1698671
Link To Document