Transposing Arrays on Multicomputers Using de Bruijn Sequences

Journal of Parallel and Distributed Computing

Volumn 53, Issue 1, 1998, Pages 63-77

  Swarztrauber, Paul N ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005382109     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1476     Document Type: Article

References (21)

1. Bertsekas D. P., Ozveren C., Stamoulis G. D., Tseng P., Tsitsiklis J. N. Optimal communication algorithms for hypercubes. J. Parallel Distrib. Comput. 11:1991;263-275.
2. Chittor S., Enbody R. Hypercubes vs 2D meshes. Technical Report. Nov. 1989.
3. Drake J., Foster I., Michalakes J., Toonen B., Worley P. Design and performance of a scalable parallel community climate model. Parallel Comput. 21:1995;1571-1591.
4. Edelman A. Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication. J. Parallel Distrib. Comput. 11:1991;328-331.
5. Flanders P. M. A unified approach to a class of data movements on an array processor. IEEE Trans. Comput. C. 31:1982;809-819.
6. Fraser D. Array permutation by index-digit permutation. J. Assoc. Comp. Mach. 22:1976;298-308.
7. Isaacson E., Keller H. B. Analysis of Numerical Methods. 1966;Wiley, New York.
8. Johnsson S. L., Ho C.-T. Spanning graphs for optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38:1989;1249-1268.
9. Johnsson S. L., Ho C.-T. Optimal communication channel utilization for matrix transpose and related permutations on binary cubes. Discrete Appl. Math. 53:1994;251-274.
10. Maurer S. B., Ralston A. Discrete Algorithmic Mathematics. 1991;Addison-Wesley, New York.
11. McBryan O. A., Van de Velde E. F. Hypercube algorithms and there implementation. SIAM J. Sci. Stat. Comput. 8:1987;227-287.
12. Nassimi D., Sahni S. Optimal BPC permutations on a cube connected simd computer. IEEE Trans. Comput. C. 31:1982;338-341.
13. Saad Y., Schultz M. H. Data communication in hypercubes. Technical Report. 1985.
14. Stout Q. F., Wagar B. Intensive hypercube communication: Prearranged communication in link-bound hypercubes. J. Parallel Distrib. Comput. 10:1990;167-181.
15. T. M. Stricker, Supporting the hypercube programming model on mesh architectures, Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, June 29-July 1, 1992.
16. Swarztrauber P. N. Multiprocessor FFTs. Parallel Comput. 5:1987;197-210.
17. P. N. Swarztrauber, The vector parallel paradigm, Proceedings of the International Conference: Advanced Mathematics, Computations and Applications, Editors Novosibirsk, June 20-24, 1995, 675, 687.
18. Swarztrauber P. N. Spectral transform methods for solving the shallow water equations on the sphere. Mon. Wea. Rev. 124:1996;730-744.
19. Swarztrauber P. N. MPP: What went wrong? Can it be made right? Hoffmann G.-R., Kreitz Norbert. Proceedings of the Seventh Workshop on the Use of Parallel Processors in Meteorology; Making its Mark: The Use of Parallel Processors in Meteorology. 1997;World Scientific, London.
20. P. N. Swarztrauber, Multipipline Multiprocessor System, Nov. 18, 1997.
21. Varvarigos E. A., Bertsekas D. P. Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. Parallel Comput. 18:1992;1233-1257.