Skip to main content

Communication-Free Data Alignment for Arrays with Exponential References Using Elementary Linear Algebra

  • Conference paper
  • 731 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

Abstract

For array references with induction variables, after induction variable substitution for those induction variables is performed, those array references substituted are transformed as nonlinear expressions. The goal of data alignment is to intelligently map computations and data onto a set of virtual processors organized as a Cartesian grid with multi-dimensions (or a template in HPF term), and to provide data locality in a program so that the data access communication costs can be minimized. Most data alignment methods are mainly devised to align the arrays referenced using linear subscripts or quadratic subscripts with n loop index variables [Chang, 2004]. In this paper, we propose a new communication-free data alignment technique to align the arrays referenced using exponential subscripts with n loop index variables or other complex nonlinear expressions. The experimental results from our techniques on SPEC95FP Benchmarks point out that the techniques can be applied to improve the execution time of the subroutines in those benchmarks.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David, B., Induprakas, K., Vladimir, K., Keshav, P., Paul, S.: Solving alignment using elementary linear algebra. In: Conference Record of the 7th Workshop on Languages and Compilers for Parallel Computing, pp. 46–60 (1994)

    Google Scholar 

  2. Chang, W.-L., Chu, C.-P., Wu, J.-H.: Communication-free alignment for array references with linear subscripts in three loop index variables or quadratic subscripts. The Journal of Supercomputing 20, 67–83 (2001)

    Article  MATH  Google Scholar 

  3. Chang, W.-L., Huang, J.-W., Chu, C.-P.: Using elementary linear algebra to solve data alignment for arrays with linear or quadratic references. IEEE Transaction on Parallel and Distributed Systems 15(1), 28–39 (2004)

    Article  Google Scholar 

  4. Chu, C.-P., Chang, W.-L., Iwen, C., Chen, P.-S.: Communication-free alignment for array references with linear subscripts in two loop index variables or quadratic subscripts. In: Proceedings of the Second IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN 1998), Australia, pp. 571–576 (1998)

    Google Scholar 

  5. Jack, E.: Systems of distinct representative and linear algebra. Journal of research of national bureau of standards, Sect. B 71(4), 241–245 (1967)

    Google Scholar 

  6. Paul, F.: Toward automatic partitioning of arrays on distributed memory computers. ACM International Conference on Supercomputing, 175–184 (1993)

    Google Scholar 

  7. Guo, M., Yamashita, Y., Nakata, I.: Efficient implementation of multi-dimensional array redistribution. IEICE transactions on Information and Systems E81-D(11), 1195–1204 (1998)

    Google Scholar 

  8. Guo, M., Nakata, I., Yamashita, Y.: Contention-free communication scheduling for array redistribution. Parallel Computing 26(8), 1325–1343 (2000)

    Article  MATH  Google Scholar 

  9. Guo, M., Nakata, I.: A framework for efficient array redistribution on distributed memory multicomputers. The Journal of Supercomputing 20(3), 243–265 (2001)

    Article  MATH  Google Scholar 

  10. Guo M.: Efficient loop partitioning for parallel codes of irregular scientific computations. IEICE transactions on Information and Systems, Vol. E86-D(9), pp. 1825–1834 (2003a)

    Google Scholar 

  11. Guo, M.: Communication generation for irregular codes. The Journal of Supercomputing 25(3), 199–214 (2003b)

    Article  MATH  Google Scholar 

  12. Chang Weng-Long, Chu Chih-Ping and Wu Jia-Hwa: Communication-free alignment for array references with linear subscripts in three loop index variables or quadratic subscripts. The Journal of Supercomputing 20, 67–83 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. PeiZong, L.: Efficient algorithms for data distribution on distributed memory parallel computers. IEEE Transactions on Parallel and Distributed Systems 8(8), 825–839 (1997)

    Article  Google Scholar 

  14. Yunheung, P.: Compiling for distributed memory multiprocessors based on access region analysis. Ph.D. Thesis, Univ. of Illinois at Urbana-Champaign, Center for Supercomputing Res. & Dev (1997)

    Google Scholar 

  15. Paul, P.M., David, P.A.: Static and dynamic evaluation of data dependence analysis techniques. IEEE Transactions on Parallel and Distributed Systems 7(11), 1121–1132 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, WL., Guo, M., Ho, M., Tsai, ST. (2005). Communication-Free Data Alignment for Arrays with Exponential References Using Elementary Linear Algebra. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_48

Download citation

  • DOI: https://doi.org/10.1007/11576235_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics