Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Efficient Algorithms for Array Redistribution

Published: 01 June 1996 Publication History

Abstract

Dynamic redistribution of arrays is required very often in programs on distributed memory parallel computers. This paper presents efficient algorithms for redistribution between different cyclic(k) distributions, as defined in High Performance Fortran. We first propose special optimized algorithms for a cyclic(x) to cyclic(y) redistribution when x is a multiple of y, or y is a multiple of x. We then propose two algorithms, called the GCD method and the LCM method, for the general cyclic(x) to cyclic(y) redistribution when there is no particular relation between x and y. We have implemented these algorithms on the Intel Touchstone Delta, and find that they perform well for different array sizes and number of processors.

References

[1]
S. Chatterjee J. Gilbert F. Long R. Schreiber and S. Teng, "Generating Local Addresses and Communication Sets for Data Parallel Programs," Proc. Principles and Practices of Parallel Programming (PPoPP), pp. 149-158, May 1993.
[2]
G. Fox S. Hiranandani K. Kennedy C. Koelbel U. Kremer and C. Tseng, "Fortran D Language Specifications," Technical Report COMP TR90-141, CRPC, Rice Univ., 1990.
[3]
S. Gupta S. Kaushik S. Mufti S. Sharma C. Huang and P. Sadayappan, "On the Generation of Efficient Data Communication for Distributed Memory Machines," Proc. Int'l Computing Symp., pp. 504-513, 1992.
[4]
High Performance Fortran Forum, High Performance Fortran Language Specification, Version 1.0, May 1993.
[5]
E. Kalns and L. Ni, "Processor Mapping Techniques Toward Efficient Data Redistribution," Proc. Eighth Int'l Parallel Processing Symp., pp. 469-476, Apr. 1994.
[6]
S. Kaushik C. Huang R. Johnson and P. Sadayappan, "An Approach to Communication-Efficient Data Redistribution," Proc. Eighth ACM Int'l Conf. Supercomputing, July 1994.
[7]
S. Kaushik C. Huang J. Ramanujam and P. Sadayappan, "Multi-phase Array Redistribution: Modeling and Evaluation," Proc. Ninth Int'l Parallel Processing Symp., pp. 441-445, Apr. 1995.
[8]
C. Koelbel, "Compile-Time Generation of Regular Communication Patterns," Proc. Supercomputing '91, pp. 101-110, Nov. 1991.
[9]
C. Koelbel D. Loveman R. Schreiber G. Steele and M. Zosel, High Performance Fortran Handbook. MIT Press, 1994.
[10]
R. Ponnusamy R. Thakur A. Choudhary and G. Fox, "Scheduling Regular and Irregular Comm. Patterns on the CM-5," Proc. Supercomputing '92, pp. 394-402, Nov. 1992.
[11]
S. Ramaswamy and P. Banerjee, "Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers" Proc. Fifth Symp. Frontiers of Massively Parallel Computation, pp. 342-349, Feb. 1995.
[12]
S. Ranka J. Wang and M. Kumar, "Irregular Personalized Communication on Distributed Memory Systems," J. Parallel and Distributed Computing, vol. 25, no. 1, pp. 58-71, Feb. 1995.
[13]
D. Scott, "Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies," Proc. Sixth Distributed Memory Computing Conf., pp. 398-403, 1991.
[14]
J. Stichnoth D. O'Hallaron and T. Gross, "Generating Communication for Array Statements: Design, Implementation, and Evaluation," J. Parallel and Distributed Computing, pp. 150-159, Apr. 1994.
[15]
R. Thakur and A. Choudhary, "All-to-All Communication on Meshes with Wormhole Routing," Proc. Eighth Int'l Parallel Processing Symp., pp. 561-565, Apr. 1994.
[16]
R. Thakur A. Choudhary and G. Fox, "Runtime Array Redistribution in HPF Programs," Proc. Scalable High Performance Computing Conf., pp. 309-316, May 1994.
[17]
R. Thakur R. Ponnusamy A. Choudhary and G. Fox, "Complete Exchange on the CM-5 and Touchstone Delta," J. Supercomputing, vol. 8, no. 4, pp. 305-328, 1995.
[18]
A. Wakatani and M. Wolfe, "A New Approach to Array Redistribution: Strip Mining Redistribution," Proc. Parallel Architectures and Languages Europe (PARLE 94), pp. 323-335, July 1994.

Cited By

View all
  • (2018)ASPEN: An Efficient Algorithm for Data Redistribution Between Producer and Consumer GridsEuro-Par 2018: Parallel Processing Workshops10.1007/978-3-030-10549-5_14(171-182)Online publication date: 27-Aug-2018
  • (2015)Scheduling array redistribution with virtual channel supportThe Journal of Supercomputing10.1007/s11227-015-1519-471:11(4215-4234)Online publication date: 1-Nov-2015
  • (2010)An in-place algorithm for irregular all-to-all communication with limited memoryProceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface10.5555/1894122.1894137(113-121)Online publication date: 12-Sep-2010
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems  Volume 7, Issue 6
June 1996
126 pages

Publisher

IEEE Press

Publication History

Published: 01 June 1996

Author Tags

  1. Array redistribution
  2. High Performance Fortran (HPF)
  3. data distribution
  4. distributed-memory computers
  5. runtime support.

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2018)ASPEN: An Efficient Algorithm for Data Redistribution Between Producer and Consumer GridsEuro-Par 2018: Parallel Processing Workshops10.1007/978-3-030-10549-5_14(171-182)Online publication date: 27-Aug-2018
  • (2015)Scheduling array redistribution with virtual channel supportThe Journal of Supercomputing10.1007/s11227-015-1519-471:11(4215-4234)Online publication date: 1-Nov-2015
  • (2010)An in-place algorithm for irregular all-to-all communication with limited memoryProceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface10.5555/1894122.1894137(113-121)Online publication date: 12-Sep-2010
  • (2008)A message combining approach for efficient array redistribution in non-all-to-all communication networksInternational Journal of Computer Mathematics10.1080/0020716070153787385:11(1609-1619)Online publication date: 1-Nov-2008
  • (2008)A message passing strategy for array redistributions in a torus networkThe Journal of Supercomputing10.1007/s11227-008-0185-146:1(40-57)Online publication date: 1-Oct-2008
  • (2008)A flexible processor mapping technique toward data localization for block-cyclic data redistributionThe Journal of Supercomputing10.1007/s11227-007-0166-945:2(151-172)Online publication date: 1-Aug-2008
  • (2007)Efficient multidimensional data redistribution for resizable parallel computationsProceedings of the 5th international conference on Parallel and Distributed Processing and Applications10.5555/2395970.2395991(182-194)Online publication date: 29-Aug-2007
  • (2006)Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing CompilersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.16217:11(1226-1241)Online publication date: 1-Nov-2006
  • (2006)An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data RedistributionThe Journal of Supercomputing10.1007/s11227-006-6615-z37:3(297-318)Online publication date: 1-Sep-2006
  • (2005)Compiler-guided leakage optimization for banked scratch-pad memoriesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2005.85947813:10(1136-1146)Online publication date: 1-Oct-2005
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media