Matrix transpose on meshes: Theory and practice

Computers and Artificial Intelligence

Volumn 16, Issue 2, 1997, Pages 107-140

  Kaufmann, Michael ^a   Meyer, Ulrich ^b   Sibeyn, Jop F ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749637907     PISSN: 02320274     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. AHUJA, R. K. - MAGNANTI, T. L. - ORLIN, J. B.: Network Flows. Prentice-Hall Inc., Englewood Cliffs, New Jersey 1993.
2. BATCHER, K. E.: Sorting Networks and their Applications. Proc. AFIPS Spring Joint Computer Conference, Vol. 32, 1968, pp. 307-314.
3. CORMEN T. - BRUHL, K.: Dont be Too Clever: Routing BMMC Permutations on the MasPar MP-2. Proc. 7th ACM Sym. on Parallel Algorithms and Architectures. ACM, 1995, pp. 288-297.
4. DIEKMANN, R. - GEHRING, J. - LÜLING, R. - MONIEN, B. - NÜBEL, M. - WANKA, R.: Sorting Large Data Sets on a Massively Parallel System. Proc. 6th Symposium on Parallel and Distributed Processing, IEEE, 1994, pp. 2-9.
5. DING, K.-S. - HO, C. T. - TSAY, J.-J.: Matrix Transpose on Meshes with Wormhole and XY Routing. Proc. 6th Symposium on Parallel and Distributed Processing, IEEE, 1994, pp. 656-663.
6. GOLDBERG, M. - SPENCER, TH.: A New Parallel Algorithm for the Maximal Independent Set Problem. Siam Journal on Computing, Vol. 18, 1989, pp. 419-427.
7. JOHNSSON, S. L. - HO, C. T.: Matrix transposition on Boolean n-cube configured ensemble architectures. SIAM Journal of Matrix Analysis Applications, Vol. 9, 1988, pp. 419-454.
8. JUNGNICKEL, D.: Graphen, Netzwerke und Algorithmen. B. I. Wissenschaftsverlag, Mannheim, 1994 (in German).
9. KAKLAMANIS, C. - KRIZANC, D.: Optimal Sorting on Mesh-Connected Processor Arrays. Proc. 4th Symp. on Parallel Algorithms and Architectures, ACM 1992, pp. 50-59.
10. KAUFMANN, M. - SIBEYN, J. F. - SUEL, T.: Derandomizing Algorithms for Routing and Sorting on Meshes. Proc. 5th Symp. on Discrete Algorithms, ACM-SIAM 1994, pp. 669-679.
11. KUNDE, M.: Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound. Proc 31th Symposium on Foundations of Computer Science, IEEE 1991, pp. 141-150.
12. KUNDE, M.: Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. Proc. European Symp. on Algorithms, LNCS 726, Springer-Verlag 1993, pp. 272-283.
13. NASSIMI, D. - SAHNI, S.: An Optimal Routing Algorithm for Mesh-Connected Parallel Computers. Journal of the ACM, Vol. 27, 1980, pp. 6-29.
14. NESSON T. - JOHNSSON, S. L.: ROMM Routing on Mesh and Torus Networks. Proc. 7th Symposium on Parallel Algorithms and Architectures, ACM, 1995, pp. 275-287.
15. PAPADIMITRIOU, C. H. - STEIGLITZ, K.: Combinatorial Optimization. Prentice-Hall Inc., Englewood Cliffs, New Jersey 1982.
16. SIBEYN, J. F.: Desnakification of Mesh Sorting Algorithms, Techn. Rep. MPI-1-94-102, revised and extended version. Max-Planck Institut für Informatik, Saarbrücken, Germany, 1994. Preliminary version in Proc. 2nd European Symposium on Algorithms, LNCS 855, pp. 377-390, Springer-Verlag 1994. Submitted to SIAM Journal on Computing.
17. SIBEYN, J. F.: Matrix Techniques for Faster Routing of Affine Permutations on a Mesh Interconnection Network. Techn. Rep. RUU-CS-90-17, Dep. of Comp. Sc., Utrecht University, Utrecht, The Netherlands 1990.
18. STOUT, Q. F. - WAGAR, B.: Intensive Hypercube Communication, Prearranged Communication in Link-Bound Machines. Journal of Parallel and Distributed Computing, Vol. 10, 1990, pp. 167-181.
19. SUEL, T.: Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes. Proc. 6th ACM Sym. on Parallel Algorithms and Architectures, ACM, 1994, pp. 26-35.