
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, Yves Robert, "Scheduling BlockCyclic Array Redistribution," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 2, pp. 192205, February, 1998.  
BibTex  x  
@article{ 10.1109/71.663945, author = {Frédéric Desprez and Jack Dongarra and Antoine Petitet and Cyril Randriamaro and Yves Robert}, title = {Scheduling BlockCyclic Array Redistribution}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {2}, issn = {10459219}, year = {1998}, pages = {192205}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.663945}, 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  Scheduling BlockCyclic Array Redistribution IS  2 SN  10459219 SP192 EP205 EPD  192205 A1  Frédéric Desprez, A1  Jack Dongarra, A1  Antoine Petitet, A1  Cyril Randriamaro, A1  Yves Robert, PY  1998 KW  Distributed arrays KW  redistribution KW  blockcyclic distribution KW  scheduling KW  MPI KW  HPF. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This article is devoted to the runtime redistribution of onedimensional arrays that are distributed in a blockcyclic fashion over a processor grid. While previous studies have concentrated on efficiently generating the communication messages to be exchanged by the processors involved in the redistribution, we focus on the
[1] C. Ancourt, F. Coelho, F. Irigoin, and R. Keryell, "A Linear Algebra Framework for Static HPF Code Distribution," Scientific Programming, to appear. Available as CRIEcole des Mines Technical Report A278CRI, .
[2] C. Berge, Graphes et Hypergraphes. Du nod, 1970. English translation by Elsevier, Amsterdam (1985).
[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. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley, "ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers—Design Issues and Performance," Proc. Computer Physics Comm., vol. 97, pp. 115, 1996. (also LAPACK Working Note #95).
[5] J. Dongarra and D. Walker, “Software Libraries for Linear Algebra Computations on High Performance Computers,” SIAM Review, vol. 37, no. 2,pp. 151–180, 1995.
[6] G.H. Golub and C.F. Van Loan, Matrix Computations, second ed. Johns Hopkins, 1989.
[7] R.L. Graham, M. Grötschel, and L. Lovász, Handbook of Combinatorics. Elsevier, 1995.
[8] 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.
[9] 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.
[10] K. Kennedy, N. Nedeljkovic, and A. Sethi, “Efficient Address Generation for BlockCyclic Distribution,” Proc. Int'l Conf. Supercomputing, pp. 180184, July 1995.
[11] K. Kennedy, N. ${\bf Nedeljkovi\acute c}$, and A. Sethi, “A LinearTime Algorithm for Computing the Memory Access Sequence in Data Parallel Programs,” Proc. Fifth ACM SIGPLAN, Symp. Principles and Practice of Parallel Programming, 1995.
[12] C. Koelbel, D. Loveman, R. Schreiber, G. Steele Jr., and M. Zosel, The High Performance Fortran Handbook. MIT Press, 1994.
[13] A. Petitet, Algorithmic Redistribution Methods for Block Cyclic Decompositions, doctoral thesis, Univ. Tennessee, K noxville, 1996.
[14] L. Prylli and B. Tourancheau, "Efficient BlockCyclic Data Redistribution," Proc. EuroPar'96, Lectures Notes in Computer Science, vol. 1,123, pp. 155164. Springer Verlag, 1996.
[15] M. Snir, S. Otto, S. HussLederman, D. Walker, and J. Dongarra, “MPI: The Complete Reference,” MIT Press,, 1995.
[16] 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.
[17] A. Thirumalai and J. Ramanujam, “Fast Address Sequence Generation for Data Parallel Programs Using Integer Lattices,” Languages and Compilers for Parallel Computing: Lecture Notes in Computer Science. P. Sadayappan et al., eds., SpringerVerlag, 1996.
[18] K. van Reeuwijk, W. Denissen, H.J. Sips, and E.M.R.M. Paalvast, "An Implementation Framework for HPF Distributed Arrays on MessagePassing Parallel Computer Systems," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 9, pp. 897914, Sept. 1996.
[19] A. Wakatani and M. Wolfe, “Optimization of Array Redistribution for Distributed Memory Multicomputers,” Parallel Computing, vol. 21, no. 9, pp. 14851490, Sept. 1995.
[20] D.W. Walker and S.W. Otto, "Redistribution of BlockCyclic Data Distributions Using MPI," Concurrency: Practice and Experience, vol. 8, no. 9, pp. 707728, 1996.
[21] L. Wang, J. Stichnoth, S. Chatterjee, “Runtime Performance of Parallel Array Assignment: An Empirical Study,” Proc. Supercomputing, 1996. ().