Skip to main content

Data redistribution in an automatic data distribution tool

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1033))

Abstract

Data distribution is one of the key aspects to consider in a parallelizing environment for Massive Parallel Processors. Automatic data distribution proposals may be categorized as either static or dynamic, depending on whether the distribution of the arrays is allowed to change throughout the execution of the program. This paper describes the features and implementation of the intra-procedural data remapping module implemented in our automatic data distribution research tool. The solution to the remapping problem for a sequence of computational phases consists in selecting a mapping among the possible candidates for each phase and introduce remapping actions between consecutive phases. Control flow information is used to identify how phases are sequenced during the execution of the application.

This research was partially supported by Convex Computer Corporation, CONVEX Supercomputers S.A.E, CEPBA (European Center for Parallelism of Barcelona) and by the Ministry of Education of Spain under contracts TIC-880/92 and TIC-429/95.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Ayguadé, J. Garcia, M. Gironès, J. Labarta, and M. Valero. Detecting and using affinity in an automatic data distribution tool. In 7th Workshop on Languages and Compilers for Parallel Computing, August 1994.

    Google Scholar 

  2. E. Ayguadé, J. Garcia, M. Gironès, M.Luz Grande, and J. Labarta. DDT: A research tool for automatic data distribution in HPF. Technical Report UPC-CEPBA-1995-20, CEPBA European Center for Parallelism of Barcelona, April 1995.

    Google Scholar 

  3. R. Bixby, K. Kennedy, and U. Kremer. Automatic data layout using 0–1 integer programming. In International Conference on Parallel Architectures and Compilation Techniques, August 1994.

    Google Scholar 

  4. S. Chatterjee, J.R. Gilbert, R. Schreiber, and T.J. Sheffler. Array distribution in data parallel programs. In 7th Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science 892. Springer-Verlag, August 1994.

    Google Scholar 

  5. S. Chatterjee, J.R. Gilbert, R. Schreiber, and T.J. Sheffler. Modeling data-parallel programs with the alignment-distribution graph. Journal of Programming Languages, Special issue on compiling and run-time issues for distributed address space machines, (2), 1994.

    Google Scholar 

  6. P. Crooks and R.H. Perrot. An automatic data distribution generator for distributed memory mimd machines. In 4th Workshop on Compilers for Parallel Computers, December 1993.

    Google Scholar 

  7. M. Gupta. Automatic Data Partitioning on Distributed Memory Multicomputers. PhD thesis, Center for Reliable and High-Performance Computing, University of Illinois at Urbana-Champaign, 1992.

    Google Scholar 

  8. K. Knobe, J.D. Lukas, and G.L. Steele. Dataoptimization: Allocation of arrays to reduce communication on SIMD machines. Journal of Parallel and Distributed Computing, 8, February 1990.

    Google Scholar 

  9. J. Li and M. Chen. Index domain alignment: Minimizing cost of cross-referencing between distributed arrays. In Frontiers90: 3rd Symposium on the Frontiers of Massively Parallel Computation, October 1990.

    Google Scholar 

  10. J. Li and M. Chen. Compiling communication-efficient programs for massively parallel machines. IEEE Trans. on Parallel and Distributed Systems, 2(3), July 1991.

    Google Scholar 

  11. D.J. Palermo and P. Banerjee. Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers. In 2nd Workshop on Automatic Data Layout and Performance Prediction, Center for Research on Parallel Computing Research Report CRPC-TR95548. Rice University, April 1995.

    Google Scholar 

  12. S. Wholey. Automatic data mapping for distributed-memory parallel computers. In ACM International Conference on Supercomputing, July 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Chua-Huang Huang Ponnuswamy Sadayappan Utpal Banerjee David Gelernter Alex Nicolau David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ayguadé, E., Garcia, J., Gironès, M., Grande, M.L., Labarta, J. (1996). Data redistribution in an automatic data distribution tool. In: Huang, CH., Sadayappan, P., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1995. Lecture Notes in Computer Science, vol 1033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014214

Download citation

  • DOI: https://doi.org/10.1007/BFb0014214

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60765-6

  • Online ISBN: 978-3-540-49446-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics