Communication-free data alignment for arrays with exponential references in parallelizing compilers for scalable parallel systems

  • Authors:
  • Minyi Guo;Weng-Long Chang;Bo Jiang;Shu-Chien Huang;Sien-Tang Tsai;Michael (Shan-Hui) Ho

  • Affiliations:
  • School of Information Engineering, Dalian Maritime University, Dalian, China 116026 and School of Computer Science and Engineering, The University of Aizu, Aizu-Wakamatsu City, Japan 965-8580;Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan, ROC 807;School of Information Engineering, Dalian Maritime University, Dalian, China 116026;Department of Computer Science, National PingTung University of Education, PingTung, Taiwan, ROC;Department of Information Management, Southern Taiwan University of Technology, Tainan County, Taiwan, ROC 710;Department of Information Management, School of Information Technology, Ming Chuan University, Taoyuan, Taiwan, ROC 333

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In loops, some arrays are referenced with induction variables. To parallelize such kind of loops, those induction variables should be substituted. Thus, those array references that were substituted are formulated as nonlinear expressions. The goal of data alignment is to intelligently map the computations and data onto a set of virtual processors which are organized as a Cartesian grid (or a template in HPF terms), and to provide data locality for parallelizing compilers so that data access communication costs can be minimized. Most data alignment methods are mainly devised to align the referenced arrays using linear subscripts or quadratic subscripts with n loop index variables, and the methods are well developed. Seldom work, however, is researched on the nonlinear expressions of index variables. This paper proposes a new communication-free data alignment technique to align the referenced arrays using exponential subscripts with n loop index variables or other complex nonlinear expressions. The experimental results using SPEC95FP Benchmarks point out that the techniques proposed in the paper can improve the execution time of the subroutines in these benchmarks.