
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YehChing Chung, ChingHsien Hsu, ShengWen Bai, "A BasicCycle Calculation Technique for Efficient Dynamic Data Redistribution," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 359377, April, 1998.  
BibTex  x  
@article{ 10.1109/71.667897, author = {YehChing Chung and ChingHsien Hsu and ShengWen Bai}, title = {A BasicCycle Calculation Technique for Efficient Dynamic Data Redistribution}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {4}, issn = {10459219}, year = {1998}, pages = {359377}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.667897}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A BasicCycle Calculation Technique for Efficient Dynamic Data Redistribution IS  4 SN  10459219 SP359 EP377 EPD  359377 A1  YehChing Chung, A1  ChingHsien Hsu, A1  ShengWen Bai, PY  1998 KW  Data redistribution KW  the basiccycle calculation technique KW  the PITFALLS method KW  the multiphase method KW  distributed memory multicomputers. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at runtime, there is a performance tradeoff between the efficiency of the new data decomposition for a subsequent phase of an algorithm and the cost of redistributing data among processors. In this paper, we present a
[1] S. Benkner, “Handling BlockCyclic Distribution Arrays in Vienna Fortran 90,” Proc. Int'l Conf. Parallel Architectures and Compilation Techniques, June 1995.
[2] B. Chapman,P. Mehrotra,H. Moritsch,, and H. Zima,“Dynamic data distributions in Vienna Fortran,” Proc. of Supercomputing’93, pp. 284293, Nov. 1993.
[3] S. Chatterjee, J. Gilbert, F. Long, R. Schreiber, and S. Tseng, “Generating Local Adresses and Communication Sets for Data Parallel Programs,” J. Parallel and Distributed Computing, vol. 26,pp. 72–84, 1995.
[4] J.J. Dongarra, R. Van De Geijn, and D.W. Walker, “A Look at Scalable Dense Linear Algebra Libraries,” Technical Report ORNL/TM12126 from Oak Ridge Nat'l Laboratory, Apr. 1992.
[5] G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C.W. Tseng, and M. Wu, "FortranD Language Specification," Technical Report TR91170, Dept. of Computer Science, Rice Univ., Dec. 1991.
[6] S.K.S. Gupta, S.D. Kaushik, C.H. Huang, and P. Sadayappan, "On the Generation of Efficient Data Communication for DistributedMemory Machines," Proc. Int'l. Conf. Computing Symp., pp. 504513,Taiwan, 1992.
[7] S.K.S. Gupta, S.D. Kaushik, C.H. Huang, and P. Sadayappan, “On Compiling Array Expressions for Efficient Execution on DistributedMemory Machines,” J. Parallel and Distributed Computing, vol. 32, pp. 155172, 1996.
[8] High Performance Fortran Forum, "High Performance Fortran Language Specification (version 1.1)," Rice Univ., Nov. 1994.
[9] S. Hiranandani, K. Kennedy, J. MellorCrammey, and A. Sethi, “Compilation Technique for BlockCyclic Distribution,” Proc. ACM Int'l Conf. Supercomputing, pp. 392403, July 1994.
[10] E. Kalns and L. Ni, “Processor Mapping Techniques towards Efficient Data Redistribution,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6,pp. 1,234–1,247, 1995.
[11] E.T. Kalns and L.M. Ni,“DaReL: A portable data redistribution library for distributedmemory machines,” Proc. 1994 Scalable Parallel Libraries Conf. 2, Oct. 1994.
[12] S.D. Kaushik, C.H. Huang, R.W. Johnson, and P. Sadayappan, “An Approach to CommunicationEfficient Data Redistribution,” Proc. 1994 ACM Int'l Conf. Supercomputing, pp. 364373, June 1994.
[13] S.D. Kaushik, C.H. Huang, J. Ramanujam, and P. Sadayappan, “MultiPhase Array Redistribution: Modeling and Evaluation,” Proc. Int'l Parallel Processing Symp., 1995.
[14] S.D. Kaushik, C.H. Huang, and P. Sadayappan, “Efficient Index Set Generation for Compiling HPF Array Statements on DistributedMemory Machines,” J. Parallel and Distributed Computing, vol. 38, pp. 237247, 1996.
[15] K. Kennedy, N. Nedeljkovic, and A. Sethi, “Efficient Address Generation for BlockCyclic Distribution,” Proc. Int'l Conf. Supercomputing, pp. 180184, July 1995.
[16] C. Koelbel, “CompilerTime Generation of Communication for Scientific Programs,” Supercomputing '91, pp. 101110, Nov. 1991.
[17] P.Z. Lee and W.Y. Chen, “Compiler Techniques for Determining Data Distribution and Generating Communication Sets on DistributedMemory Multicomputers,” Proc. 29th IEEE Hawaii Int'l Conf. System Sciences, pp. 537546, Jan. 1996.
[18] Y.W. Lim, P.B. Bhat, and V.K. Prasanna, “Efficient Algorithms for BlockCyclic Redistribution of Arrays,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 7483, 1996.
[19] Y.W. Lim, N. Park, and V.K. Prasanna, “Efficient Algorithms for MultiDimensional BlockCyclic Redistribution of Arrays,” Proc. 26th Int'l Conf. Parallel Processing, pp. 234241, 1997.
[20] L. Prylli and B. Tourancheau, “Fast Runtime Block Cyclic Data Redistribution on Multiprocessors,” J. Parallel and Distributed Computing, vol. 45, 1997.
[21] S. Ramaswamy and P. Banerjee, "Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers," Proc. Frontiers '95: The Fifth Symposium on the Frontiers of Massively Parallel Computation, pp. 342349,McLean, Va., Feb. 1995.
[22] S. Ramaswamy, B. Simons, and P. Banerjee, “Optimizations for Efficient Array Redistribution on Distributed Memory Multicomputers,” J. Parallel and Distributed Computing, vol. 38, no. 2, pp. 217228, Nov. 1996.
[23] J. Stichnoth,D. O’Hallaron,, and T. Gross,“Generating communication for array statements: Design, implementation, and evaluation,” J. of Parallel and Distributed Computing, vol. 21, no. 1, pp. 150159, 1994.
[24] R. Thakur,A. Choudhary,, and G. Fox,“Runtime array redistribution in HPF programs,” Proc. 1994 Scalable High Performance Computing Conf., pp. 309316, May 1994.
[25] R. Thakur, A. Choudhary, and J. Ramanujam, “Efficient Algorithms for Array Redistribution“ IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6 pp. 587594, June 1996.
[26] A. Thirumalai and J. Ramanujam, "HPF Array Statements: Communication Generation and Optimization," Proc. Third Workshop Languages, Compilers and RunTime System for Scalable Computers,Troy, N.Y., May 1995.
[27] A. Thirumalai and J. Ramanujam, “Efficient Computation of Address Sequences in DataParallel Programs Using Closed Forms for Basis Vectors,” J. Parallel and Distributed Computing, vol, 38, no. 2, pp. 188203, Nov. 1996.
[28] V. Van Dongen, C. Bonello, and C. Freehill, "High Performance C—Language Specification Version 0.8.9," Technical Report CRIMEPPP94/0412, 1994.
[29] C. Van Loan, “Computational Frameworks for the Fast Fourier Transform,” SIAM, 1992.
[30] D.W. Walker and S.W. Otto, "Redistribution of BLOCKCYCLIC Data Distributions Using MPI," Concurrency: Practice and Experience, vol. 8, no. 9, pp. 707728, Nov. 1996.
[31] A. Wakatani and M. Wolfe, “A New Approach to Array Redistribution: Strip Mining Redistribution,” Proc. Parallel Architectures and Languages Europe, July 1994.
[32] A. Wakatani and M. Wolfe, “Optimization of Array Redistribution for Distributed Memory Multicomputers,” Parallel Computing, vol. 21, no. 9, pp. 14851490, Sept. 1995.
[33] H. Zima, P. Brezany, B. Chapman, P. Mehrotra, and A. Schwald, "Vienna Fortran—A Language Specification Version 1.1," ICASE Interim Report 21, ICASE NASA Langley Research Center, Hampton, Va., Mar. 1992.