Packet Routing in Fixed-Connection Networks: A Survey

Journal of Parallel and Distributed Computing

Volumn 54, Issue 2, 1998, Pages 77-132

  Grammatikakis, Miltos D ^a   Hsu, D Frank ^b   Kraetzl, Miro ^c   Sibeyn, Jop F ^d  

^a UNIVERSITY OF HILDESHEIM   (Germany)

^b FORDHAM UNIVERSITY   (United States)

^c DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (330)

1. Abraham S., Padmanabhan K. Performance of the direct binary n-cube network for multiprocessors. IEEE Trans. Comput. 38:1989;1000-1011.
2. Aiello W. A., Leighton F. T., Maggs B. M., Newman M. Fast algorithms for bit serial routing on a hypercube. Math. Syst. Theory. 24:1991;253-271.
3. Ajtai M., Komlós J., Szemerédi E. Sorting incn. Combinatorica. 3:1983;1-19.
4. M. Ajtai, J. Komlós, E. Szemerédi, Halvers and expanders, Proc. 33rd IEEE Symp. Foundations Comput. Sci. 1992, 686, 692.
5. S. B. Akers, D. Harel, B. Krishnamurthy, The star graph, an attractive alternative to then, Proc. Int. Conf. Parallel Proc. 1987, 393, 400.
6. Akl S. G. Parallel Sorting Algorithms. 1985;Academic Press, San Diego.
7. Akl S. G., Qiu K. A novel routing scheme on the star and pancake networks and its applications. Parallel Comput. 19:1993;95-101.
8. Akl S. G., Qiu K., Stojmenovic I. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks. 23:1993;215-226.
9. R. Aleliunas, Randomized parallel communication, Proc. ACM SIGACT-SIGOPS Symp. Princ. Distrib. Comput. 1982, 60, 72.
10. Alon N., Chung F. R. K., Graham R. L. Routing permutations on graphs via matchings. SIAM J. Disc. Math. 23:1994;513-530.
11. K. V. Anjan, T. M. Pinkston, An efficient, fully adaptive deadlock recovery scheme: DISHA, Proc. 24th IEEE Int. Symp. Comput. Arch, 1995, 210, 219.
12. Arora S., Leighton F. T., Maggs B. M. On-line algorithms for path selection in a nonblocking network. SIAM J. Comput. 25:1996;600-625.
13. Badr H. G., Podar S. An optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Trans. Comput. C-38:1989;1362-1371.
14. Bagherzadeh N., Nassif N., Latifi S. A routing and broadcasting scheme on faulty star graph. IEEE Trans. Comput. C-42:1993;1398-1403.
15. Bannister J., Gerla M., Kovačević M. Routing in optical networks. Routing in Comm. Networks. 1995;Prentice-Hall, New York.
16. Baran P. On distributed communication networks. IEEE Trans. Comm. C-12:1964;1-9.
17. A. Bar-Noy, B. Schieber, P. Raghavan, H. Tamaki, Fast deflection routing for packets and worms, Proc. 12th ACM SIGACT-SIGOPS Symp. Princ. Distrib. Comput, 1993, 75, 86.
18. Bassalygo L. A., Pinsker M. S. Complexity of an optimum nonblocking switching network without reconnections. Problems of Inform. Transm. 9:1974;64-66.
19. Batcher K. E. Sorting networks and their applications. Proc. AFIPS Spring Joint Comput. Conf. 32:1968;307-314.
20. Baumslag M., Annexstein F. A unified framework for off-line permutation routing in parallel networks. Math. Syst. Theory. 24:1991;233-251.
21. Y. Ben-Asher, I. Newman, Geometric approach for optimal routing on mesh with buses, Proc. 7th IEEE Symp. Parallel Distrib. Comput, 1995, 145, 153.
22. Ben-Asher Y., Peleg D., Ramaswami R., Schuster A. The power of reconfiguration. J. Parallel Distrib. Comput. 13:1991;139-153.
23. Ben-David S., Borodin A., Karp R., Tardos G., Wigderson A. On the power of randomization in on-line algorithms. Algorithmica. 11:1994;2-14.
24. Beneš V. E. On rearrangeable three-stage connecting networks. Bell Syst. Tech. J. 16:1962;1481-1491.
25. P. Berenbrink, F. Meyer auf der Heide, V. Stemann, Fault-tolerant shared memory simulations, Proc. 13th Symp. Theoret. Asp. Comput. Sci, Lect. Notes Comput. Sci. 1046, 1996, 181, 192.
26. Berman P., Diks K., Pelc A. Reliable broadcasting in logarithmic time with byzantine link failures. J. Algorithms. 22:1997;199-211.
27. Bermond J. C., Comellas F., Hsu D. F. Distributed loop networks: a survey. J. Parallel Distrib. Comput. 24:1995;2-10.
28. J. C. Bermond, C. Peyrat, De Bruijn and Kautz networks: A competitor for the hypercube?, Proc. 1st Euro Workshop Hypercube Distrib. Comput. 1989, 279, 293.
29. Berthomé P., Ferreira A., Perennes S. Optimal information dissemination in star and pancake networks. IEEE Trans. Parallel Distrib. Syst. C-7:1996;1292-1300.
30. Bertsekas D. P., Gallager R. G. Data Networks. 1992;Prentice-Hall, New York.
31. Bertsekas D. P., Ozveren C., Stamoulis G. D. Optimal communication algorithms for hypercubes. J. Parallel Distrib. Comput. 11:1991;263-275.
32. Bhatt S. N., Chung F. R. K., Hong J. W. Optimal emulations by butterfly-like networks. J. ACM. 43:1996;293-330.
33. Bhuyan L. N., Agrawal D. P. Generalized hypercube and hyperbus structures for a computer network. IEEE Trans. Comput. C-33:1984;323-334.
34. A. Borodin, Towards a better understanding of pure packet routing, Proc. 3rd Workshop Alg. and Data Struct, Lect. Notes Comput. Sci. 709, 1993, 14, 25.
35. Borodin A., Hopcroft J. E. Routing, merging, and sorting on parallel models of computation. J. Comput. Syst. Sci. 30:1985;130-145.
36. Borodin A., Raghavan P., Schieber B., Upfal E. How much can hardware help routing. J. ACM. 44:1997;726-741.
37. Brassard G., Bratley P. Algorithmics: Theory and Practice. 1988;Prentice-Hall, Englewood Cliffs.
38. Broder A., Fischer M., Dolev D., Simmons B. Efficient fault-tolerant routings in networks. Information and Computation. 75:1987;52-64.
39. Bruck J., Cypher R., Ho C. T. Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes. IEEE Trans. Parallel Distrib. Syst. C-44:1995;150-155.
40. Chen M. S., Shin K. G. Depth-first search approach for fault-tolerant routing in hypercube multicomputers. IEEE Trans. Parallel Distrib. Syst. C-1:1990;152-159.
41. Chen M. S., Shin K. G. Adaptive fault-tolerant routing in hypercube multiprocessors. IEEE Trans. Comput. C-39:1990;1406-1416.
42. D. D. Chinn, T. Leighton, M. Tompa, Minimal adaptive routing on the mesh with bounded queue size, Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 354, 363.
43. B. S. Chlebus, A. Czumaj, L. Gasieniec, M. Kowaluk, W. Plandowski, Parallel alternating-direction access machine, Proc. 21st Math. Foundations Comput. Sci, Lect. Notes Comput. Sci. 1113, 1996, 267, 278.
44. B. S. Chlebus, A. Czumaj, J. F. Sibeyn, Routing on the PADAM: Degrees of Optimality, Proc. 3rd Euro-Par Conf, Lect. Notes Comput. Sci. 1300, 1997, 272, 279.
45. Chlebus B. S., Kukawka M. A guide to sorting on the mesh-connected processor array. Comput. Art, Intel. 9:1990;599-610.
46. S. Chowdhury, A. M. Holliday, Stability and performance of alternative two-level interconnection networks, Proc. Int. Conf. Parallel Proc. 1991, I, 720, 721.
47. Cole R., Hopcroft J. On edge coloring bipartite graphs. SIAM J. Comput. 11:1982;540-546.
48. R. Cole, B. Maggs, R. Sitaraman, Multi-scale self-simulation: a technique for reconfiguring arrays with faults, Proc. 25th ACM Symp. Theory Comput. 1993, 561, 572, SIAM J. Comput., 26.
49. Coolsaet K., Meyer auf der Heide F., Fack V. Optimal algorithms for total exchange without buffering on the hypercube. Bit. 32:1992;559-569.
50. Chvátal V. Lecture notes on the new AKS sorting network. Tech. Rep. 1992.
51. Cypher R. Efficient Communication in Massively Parallel Computers. 1989;University of WashingtonDept. Comput. Sci.
52. Cypher R. Theoretical aspects of VLSI pin limitations. SIAM J. Comput. 22:1993;356-378.
53. Cypher R., Gravano L. Storage-efficient, deadlock-free packet routing algorithms for torus networks. IEEE Trans. Comput. 43:1994;1376-1385.
54. R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöking, Universal algorithms for store-and-forward and wormhole routing, Proc. 28th ACM Symp. on Theory of Computing, 1996, 356, 365.
55. Cypher R., Plaxton C. G. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. J. Comput. Syst. Sci. 47:1993;501-548.
56. Cypher R., Sanz J. L. C. Cubesort: a parallel algorithm for sortingN. J. Algebra. 13:1992;211-234.
57. A. Czumaj, F. Meyer auf der Heide, V. Stemann, Shared memory simulations with triple-logarithmic delay, Proc. 3rd European Symp. Alg, Lect. Notes Comput. Sci. 979, 1995, 46, 59.
58. Czumaj A., Meyer auf der Heide F., Stemann V. Simulating shared memory in real time: on the computation power of reconfigurable architectures. Information and Computation. 137:1997;103-120.
59. Dally W. J. Virtual-channel flow control. IEEE Trans. Parallel Distrib. Syst. C-2:1992;194-205.
60. Dally W. J., Aoki H. Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans. Parallel Distrib. Syst. C-4:1993;466-474.
61. Dally W. J., Seitz C. Deadlock free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36:1987;547-553.
62. Das C. R., Kreulen J. T., Thazhuthaveetil M. Dependability modeling for multiprocessors. IEEE Computer. 23:1990;7-19.
63. B. Dasgupta, F. K. Hwang, Y. C. Yao, Permutation routing int.
64. M. Dietzfelbinger, F. Meyer auf der Heide, Simple, efficient shared memory simulations, Proc. 5th ACM Symp. Parallel Alg. Arch, 1993, 110, 118.
65. K.-S. Ding, C.-T. Ho, J.-J. Tsay, Matrix transpose on meshes with wormhole and XY-routing, Proc. 6th IEEE Symp. Parallel Distrib. Comput, 1994, 656, 663.
66. Dolev D., Halpern J., Simmons B, Strong R. A new look at fault tolerant network routing. Information and Computation. 72:1987;180-196.
67. Duato J. A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks. IEEE Trans. Parallel Distrib. Syst. C-7:1996;841-854.
68. Duato J. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parallel Distrib. Syst. C-6:1995;1055-1067.
69. Duato J. Theory of deadlock-free adaptive multicast routing in wormhole networks. IEEE Trans. Parallel Distrib. Syst. C-6:1995;976-987.
70. Duato J., Yalamanchili S., Ni L. Interconnection Networks: An Engineering Approach. 1997;IEEE Comput. Soc. Los Alamitos.
71. U. Feige, P. Raghavan, Exact analysis of hot-potato routing, Proc. 33rd IEEE Symp. Foundations Comput. Sci. 1992, 553, 562.
72. P. Feldman, Fault tolerance of minimal path routing in a network, Proc. 17th ACM Symp. Theory Comput. 1985, 327, 334.
73. Felperin S., Raghavan P., Upfal E. A theory of wormhole routing in parallel computers. IEEE Trans. Comm. C-45:1996;704-713.
74. Feng T. Y. A survey of interconnection networks. IEEE Computer. 14:1981;12-27.
75. Ferreira A. Hypercubes. Zomaya A. Handbook Parallel Distrib. Comput. 1995;McGraw-Hill, New York.
76. Ferreira A., Grammatikakis M. D. Improved probabilistic routing on generalized hypercubes. Theoret. Comput. Sci. 158:1995;53-64.
77. Fragopoulou P., Akl S. G. Optimal communication algorithms on star graphs using spanning tree constructions. J. Parallel Distrib. Comput. 24:1995;55-71.
78. Fragopoulou P., Akl S. G. Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans. Comput. 45:1996;174-185.
79. Fragopoulou P., Akl S. G., Meijer H. Optimal communication primitives on the generalized hypercube network. J. Parallel Distrib. Comput. 32:1996;173-187.
80. Fraigniaud P. Performance analysis of broadcasting in hypercubes with restricted communication capabilities. J. Parallel Distrib. Comput. 16:1992;15-26.
81. Fraigniaud P. Asymptotically optimal broadcasting and gossiping in faulty hypercubes multicomputers. IEEE Trans. Comput. C-41:1992;1410-1419.
82. Fraigniaud P., Lazard E. Methods and problems of communication in usual networks. Disc. Appl. Math. 53:1994;79-133.
83. Fraigniaud P., Peyrat C. Broadcasting in a hypercube when some calls fail. Inf. Proc. Letters. 39:1991;115-119.
84. Gargano L., Vacarro U., Vozella A. Fault tolerant routing in the star and pancake interconnection networks. Inf. Proc. Lett. 45:1993;315-320.
85. D. Gautier de Lahaut, C. Germain, Static communications in parallel scientific programs, Proc. Parallel Arch. Lang, Europe Conf, Lect. Notes Comput. Sci. 817, 1994, 262, 276.
86. Glass C. J., Ni L. M. The turn model for adaptive routing. J. ACM. 41:1994;874-902.
87. L. A. Goldberg, Y. Matias, S. Rao, An optical simulation of shared memory, Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 257, 267.
88. J. M. Gordon, Q. F. Stout, Hypercube message routing in the presence of faults, Proc. 3rd Conf. Hypercube Concurrent Comput. Appl. 1988, 318, 327.
89. J. M. Gordon, Q. F. Stout, Fault tolerant message routing on large parallel systems, Proc. 2nd Symp. Frontiers Massively Parallel Comput. 1988, 155, 158.
90. Gottlieb A., Kruskal C. P. Complexity results for permuting data and other computations on parallel processors. J. ACM. 31:1984;193-209.
91. M. D. Grammatikakis, D. F. Hsu, F. K. Hwang, Adaptive and oblivious routing algorithms on the d-cube, Proc. 4th ACM Int. Symp. Alg. Comput, Lect. Notes Comput. Sci. 762, 1993, 167, 176.
92. M. D. Grammatikakis, J. S. Jwo, M. Kraetzl, S. H. Wang, Dynamic and static packet routing on symmetric communication networks, Proc. IEEE Conf. Global Comm, San Francisco, CA, 1994, 1501, 1505.
93. M. D. Grammatikakis, M, Kraetzl, E. Fleury, Shortest-path and hot-potato routing on unbuffered toroidal networks, Proc. IEEE Conf. Global Comm, Phoenix, AZ, 1997, 165, 169.
94. Greenberg A. G., Goodman J. Sharp approximate models of deflection routing in mesh networks. IEEE Trans. Comm. C-41:1993;210-223.
95. Greenberg A. G., Hajek B. Deflection routing in hypercube networks. IEEE Trans. Comm. C-40:1992;1070-1081.
96. Hambrusch S. E., Hameed F., Khokhar A. Communication operations on coarse-grained architectures. Parallel Computing. 21:1995;731-751.
97. Han Y., Igarashi Y., Truszczynski M. Indexing functions and time lower bounds for sorting on a mesh-connected computer. Disc. Appl. Math. 36:1992;141-152.
98. T. Han, D. F. Stanat, "Move and smooth" routing algorithms on mesh connected computers, Proc. 28th Allerton Conf. Comm. Control Comput, 1990, 236, 245.
99. M. Harchol-Balter, D. Wolfe, Bounding delays in packet-routing networks, Proc. 27th ACM Symp. on Theory of Comput, 1995, 248, 257.
100. M. Harchol-Balter, P. E. Black, Queuing analysis of oblivious packet-routing networks, Proc. 5th ACM-SIAM Symp. Disc. Alg, 1994, 583, 592.
101. Harms D. D., Kraetzl M., Colbourn C. J., Devitt J. S. Network Reliability: Experiments with a Symbolic Algebra Environment. 1995;CRC Press, Boca Raton.
102. J. Hastad, F. T. Leighton, M. Newman, Reconfiguring a hypercube in the presence of faults, Proc. 19th ACM Symp. Theory Comput, 1987, 274, 284.
103. J. Hastad, F. T. Leighton, M. Newman, Fast computation using faulty hypercubes, Proc. 21st ACM Symp. Theory Comput. 1989, 251, 263.
104. Hedetniemi S. M., Hedetniemi S. T., Liestman A. L. A survey of gossiping and broadcasting in communication networks. Networks. 18:1987;319-349.
105. Herley K. T., Bilardi G. Deterministic simulations of PRAMs on bounded-degree networks. SIAM J. Computing. 23:1994;276-292.
106. K. T. Herley, A, Pietracaprina, G. Pucci, Implementing shared memory on multi-dimensional meshes and on the fat-tree, Proc. 3rd European Symp. Alg, Lect. Notes Comput. Sci. 979, 1995, 60, 74.
107. Ho C. T., Kao M. Y. Optimal broadcast in all-port wormhole-routed hypercubes. IEEE Trans. Parallel Distrib. Syst. C-6:1995;200-204.
108. Ho C. T., Kao M. Y. Efficient broadcast on hypercubes with wormhole ande. Parallel Processing Letters. 5:1995;213-222.
109. Hromkovič J., Klasing R., Monien B., Peine R. Dissemination of information in intercon- nection networks (broadcasting and gossiping). Hsu D. F., Du D. Z. Comb. Network Theory. 1995;Kluwer Academic, Dordrecht/Norwell.
110. Hsu D. F. On container width and length in graphs, groups and networks. IEEE Trans. Fundamentals of Electronics, Comm. Comput. Sci. E77-A:1994;668-680.
111. Hsu D. F., Luczak T. Note on the k-diameter of k-regular k-connected graphs. Disc. Math. 132:1994;291-296.
112. Hsu D. F., Wei D. S. Efficient routing and sorting schemes for de Bruijn networks. IEEE Trans, Parallel Distrib. Syst. 8:1997;1157-1170.
113. J. M. Hsu, P, Banerjee, Performance evaluation of hardware support for message passing in distributed memory multicomputers, Proc. Int. Conf. Parallel Proc. 1991, I, 604, 607.
114. W. T.-Y. Hsu, P.-C. Yew, The impact of wiring constraints on hierarchical network performance, Proc. 6th IEEE Int. Parallel Proc. Symp. 1992, 580, 588.
115. A. J. Huang, Z. G. Mou, Parallel partition expansion for the solution of arbitrary recurrences, Proc. Int. Conf. Parallel Proc. 1992, III, 109, 114.
116. Hwang F. K., Yao Y. C., Grammatikakis M. D. d-move local permutation routing for the d-cube. Disc. Appl. Math. 72:1997;199-207.
117. D. Ierardi, 2D-bubblesorting in average time O( NN , Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 36, 45, J. Comput. Syst. Sci.
118. Jaja J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
119. Jaja J., Ryu K. W. Load balancing and routing on the hypercube and related networks. J. Parallel Distrib. Comput. 14:1992;431-435.
120. C. R. Jesshope, P. R. Miller, Y. S. Yantchev, High performance communications in processor networks, Proc. 16th IEEE Int. Symp. Comput. Arch. 1989, 150, 157.
121. C. R. Jesshope, P. R. Miller, Y. S. Yantchev, The mad-postman network chip, Proc. Transputing Conf, IOS Press, II, 517, 536.
122. Johnsson S. L., Ho C. T. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. C-38:1989;1249-1267.
123. Johnsson S. L., Ho C. T. Generalized shuffle permutations on boolean cubes. J. Parallel Distrib. Comput. 16:1992;1-14.
124. Johnsson S. L., Ho C. T. Optimal communication channel utilization for matrix transpose and related permutations on boolean cubes. Discrete Appl. Math. 53:1994;251-274.
125. Johnsson S. L., Ho C. T. Algorithms for matrix transposition for boolean n-cube configured ensemble architectures. SIAM J. Matrix Appl. 9:1988;419-454.
126. Jwo J. S., Lakshmivarahan S, Dhall S. K. A new class of interconnection networks based on the alternating group. Networks. 23:1993;315-326.
127. Kahale N. Eigenvalues and expansion of regular graphs. J. ACM. 42:1995;1091-1106.
128. N. Kahale, T. Leighton, Greedy dynamic routing on arrays, Proc. 6th ACM-SIAM Symp. Disc. Alg, 1995, 558, 566.
129. N. Kahale, F. T. Leighton, Y. Ma, C. G. Plaxton, T, Suel, E. Szemerédi, Lower bounds for sorting networks, Proc. 27th ACM Symp. Theory Comput, 1995, 548, 558.
130. C. Kaklamanis, A. R. Karlin, F. T. Leighton, V, Milenkovic, P. Raghavan, S, Rao, C. Thomborson, A. Tsantilas, Asymptotically tight bounds for computing with faulty arrays of processors, Proc. 31st IEEE Symp. Foundations Comput. Sci. 1990, 285, 296.
131. C. Kaklamanis, D. Krizanc, Optimal sorting on mesh-connected processor arrays, Proc. 4th ACM Symp. Parallel Alg. Arch. 1992, 50, 59.
132. C. Kaklamanis, D. Krizanc, L. Narayanan, T. Tsantilas, Randomized sorting and selection on mesh-connected processor arrays, Proc. 3rd ACM Symp. Parallel Alg. Arch. 1991, 17, 28.
133. C. Kaklamanis, D. Krizanc, S. Rao, Simple path selection for optimal routing on processor arrays, Proc. 4th ACM Symp. Parallel Alg. Arch. 1992, 23, 30.
134. Kaklamanis C., Krizanc D., Tsantilas A. Tight bounds for oblivious routing on the hypercube. Math. Syst. Theory. 24:1991;223-232.
135. Karloff H., Raghavan P. Randomized algorithms and pseudorandom numbers. J. ACM. 40:1993;454-476.
136. Karp R., Luby M., Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 16:1996;517-542.
137. M. Kaufmann, H. Lauer, H. Schröder, Fast deterministic hot-potato routing on meshes, Proc. 5th ACM Int. Symp. Alg. Comput. Lect. Notes Comput. Sci. 834, 1994, 333, 341.
138. M. Kaufmann, U. Meyer, J. F. Sibeyn, Towards practical permutation routing on meshes, Proc. 6th IEEE Symp. Parallel Distrib. Comput. 1994, 664, 671.
139. Kaufmann M., Meyer U., Sibeyn J. F. Matrix transposes on meshes: theory and practice. Comp. Artificial Intelligence. 16:1997;107-140.
140. Kaufmann M., Raman R., Sibeyn J. F. Randomized routing on meshes with buses. Algorithmica. 18:1997;417-444.
141. M. Kaufmann, S. Rajasekaran, J. F. Sibeyn, Matching the bisection bound for routing and sorting on the mesh, Proc. 4th ACM Symp. Parallel Alg. Arch. 1992, 31, 40.
142. M. Kaufmann, J. F. Sibeyn, Deterministic routing on circular arrays, Proc. 4th IEEE Symp. Parellel Distrib. Comput. 1992, 376, 383.
143. Kaufmann M., Sibeyn J. F. Randomized multipacket routing and sorting on meshes. Algorithmica. 17:1997;224-244.
144. M. Kaufmann, J. F. Sibeyn, T. Suel, Derandomizing routing and sorting algorithms for meshes, Proc. 5th ACM-SIAM Symp. Disc. Alg. 1994, 669, 679.
145. M. Kaufmann, J. F. Sibeyn, T. Suel, Beyond the bisection bound: fast ranking and counting on meshes, Proc. 3rd European Symp. Alg, Lect. Notes Comput. Sci. 979, 1995, 75, 88.
146. Kaufmann M., Schröder H., Sibeyn J. F. Asymptotically optimal and practical routing on the reconfigurable mesh. Parallel Proc. Lett. 5:1995;81-95.
147. Kermani P., Kleinrock L. Virtual cut through: a new computer communication switching technique. Comp. Networks. 3:1979;267-286.
148. Kim J. H., Liu Z., Chien A. A. Compressionless routing: a framework for adaptive and fault-tolerant routing. IEEE Trans. Parallel Distrib. Syst. C-8:1997;229-244.
149. Konstantinidou S., Snyder L. The Chaos router. IEEE Trans. Comput. C-43:1994;1386-1397.
150. Krizanc D. Oblivious routing with limited buffer capacity. J. Comp. System Sciences. 43:1991;317-327.
151. Krizanc D. A note on off-line permutation routing on a mesh-connected processor array. Parallel Proc. Letters. 1:1991;67-70.
152. Krizanc D. Integer sorting on a mesh-connected array of processors. Inf. Proc. Lett. 47:1993;283-289.
153. Krizanc D., Narayanan L. Zero-one sorting on the mesh. Parallel Proc. Lett. 5:1995;149-155.
154. Kumar M., Hirschberg D. S. An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes. IEEE Trans. Comput. C-32:1983;254-264.
155. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing: Design and Analysis of Algorithms. 1994;Benjamin Cummings, Redwood City.
156. Kunde M. Lower bounds for sorting on mesh-connected architectures. Acta Informatica. 24:1987;121-130.
157. Kunde M. Routing and sorting on mesh connected processor arrays. Proc. VLSI Alg. Arch. Lect. Notes Comput. Sci. 319:1988;423-433.
158. M. Kunde, Concentrated regular data streams on grids: sorting and routing near to the bisection bound, Proc. 32nd IEEE Symp. Foundations Comput. Sci. 1991, 141, 150.
159. M. Kunde, Balanced routing: towards the distance bound on grids, Proc. 3rd ACM Symp. Parallel Alg. Arch. 1991, 260, 271.
160. Kunde M. Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound. Proc. European Symp. Alg., Lect. Notes Comput. Sci. 726:1993;272-283.
161. M. Kunde, R. Niedermeier, K. Reinhardt, P. Rossmanith, Optimal average case sorting on arrays, Proc. 12th Symp. Theoret. Asp. Comput. Sci, Lect. Notes Comput. Sci, 1995, 503, 513.
162. M. Kunde, R. Niedermeier, P. Rossmanith, Faster sorting and routing on grids with diagonals, Proc. 11th Symp. Theoret. Asp. Comput. Sci, Lect. Notes Comput. Sci 775, 1994, 225, 236.
163. Kunde M., Tensi T. kk. J. Parallel Distrib. Comput. 11:1991;146-155.
164. M. Kutylowski, K. Lorys, B. Oesterdiekhoff, R. Wanka, Fast and feasible periodic sorting networks of constant depth, Proc. 35th IEEE Symp. Foundations Comput. Sci, 1994, 369, 380.
165. Kutylowski M., Wanka R. Periodic sorting on two-dimensional meshes. Parallel Processing Lett. 2:1992;213-220.
166. Kuzmaul B. C. Fast deterministic routing on hypercubes using small buffers. IEEE Trans. Comput. C-39:1990;1388-1393.
167. Lakshmivarahan S., Dhall S. K., Miller L. Parallel sorting algorithms. Adv. Comput. 1984;295-354.
168. Lakshmivarahan S., Jwo J. S., Dhall S. K. Analysis of symmetry in interconnection networks based on Cayley graph of permutation graphs: a survey. Parallel Comput. 19:1993;361-407.
169. Lang H. M., Schimmler M., Schneck H., Schröder H. Systolic sorting on a mesh connected network. IEEE Trans. Comput. C-34:1985;652-658.
170. Latifi S. On the fault-diameter of the star graph. Inf, Proc. Lett. 46:1992;143-150.
171. Lawrie D. H. Access and alignment of data in an array processor. IEEE Trans. Comput. C-24:1975;1145-1155.
172. Lee T. C., Hayes J. P. A fault tolerant communication scheme for hypercube computers. IEEE Trans. Comput. C-41:1992;1242-1255.
173. Lee S., Shin K. G. Interleaved all-to-all reliable broadcast on meshes and hypercubes. IEEE Trans. Parallel Distrib. Syst. C-5:1994;449-458.
174. Leighton F. T. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. C-34:1985;344-354.
175. F. T. Leighton, Average case analysis of greedy routing algorithms, Proc. 2nd ACM Symp. Parallel Alg. Arch. 1990, 2, 8.
176. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes. 1992;Morgan-Kauffman, San Mateo.
177. Leighton F. T. Methods for message routing in parallel machines. Theoret. Comput. Sci., North-Holland. 128:1994;31-62.
178. Leighton F. T., Maggs B. M., Ranade A., Rao S. Randomized routing and sorting on fixed-connection networks. J. Algebra. 17:1994;157-205.
179. Leighton F. T., Maggs B. M., Rao S. Universal packet routing algorithms. Combinatorica. 14:1994;167-186.
180. F. T. Leighton, B. M. Maggs, A. W. Richa, Fast algorithms for finding O(congestion+dilation) packet routing schedules, Proc. 28th Hawaii Int. Conf. Syst. Sci. 1995, II, 555, 563, Combinatorica.
181. F. T. Leighton, B. M. Maggs, R. Sitaraman, On the fault tolerance of some popular bounded-degree networks, Proc. 33rd IEEE Symp. Foundations Comput. Sci. 1992, 542, 552, SIAM J. Comput.
182. Leighton F. T., Makedon F., Tollis I. G. A 2nnn. Algorithmica. 14:1995;561-572.
183. Leighton F. T., Plaxton C. G. Hypercubic sorting networks. SIAM J. Computing. 27:1998;1-47.
184. Leiserson C. E. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C-34:1985;892-901.
185. Leiserson C. E., Abuhamdeh Z. S., Douglas D. C. The network architecture of the connection machine CM-5. J. Parallel Distrib. Comput. 33:1996;145-158.
186. Lenfant J. Permutations of data: A Benes network control algorithm for frequently used permutations. IEEE Trans. Comput. C-27:1978;637-647.
187. Leppänen V., Penttonen M. Work-optimal simulation of PRAM models on meshes. Nordic J. Computing. 2:1995;51-69.
188. Leung J., Shende S. M. On multi-dimensional packet routing on meshes with buses. J. Parallel Distrib. Comput. 20:1994;187-197.
189. Lev G., Pippenger N., Valiant L. G. A fast parallel algorithm for routing in permutation networks. IEEE Trans. Comput. C-30:1981;93-100.
190. Lin W. Manipulating general vectors on synchronous binaryn. IEEE Trans. Comput. C-42:1993;863-870.
191. Lin X., McKinley P. K., Ni L. M. Deadlock-free multicast wormhole routing in 2D mesh multicomputers. IEEE Trans. Parallel Distrib. Syst. C-5:1994;793-804.
192. Lin X., Ni L. M. Multicast communication in multicomputer networks. IEEE Trans. Parallel Distrib. Syst. C-4:1993;1105-1117.
193. D. Lisinski, F. T. Leighton, B. M. Maggs, Empirical evaluation of randomly-wired multistage networks, Proc. IEEE Int. Conf. Comput. Design. 1990, 380, 385.
194. Lubiw A. Counterexample to a conjecture of Szymanski on hypercube routing. Inf. Proc. Lett. 35:1990;57-61.
195. Lyuu Y. D. Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal. Math. Syst. Theory. 24:1991;273-294.
196. Y. Ma, S. Sen, I. D. Scherson, The distance bound for sorting on mesh-connected processor arrays is tight, Proc. 27th IEEE Symp. Foundations Comput. Sci. 1986, 255, 263.
197. Maggs B. M. Randomly wired multistage networks. Statistical Sci. 8:1993;70-75.
198. B. M. Maggs, L. R. Matheson, R. E. Tarjan, Models of parallel computation: a survey and synthesis, Proc. 28th Hawai Int. Conf. Syst. Sci. 1995,II, 61, 70.
199. B. Maggs, R. Sitaraman, Simple algorithms for routing on butterfly networks with bounded queues, Proc. 24th ACM Symp. on Theory of Computing, 1992, 150, 161.
200. B. M. Maggs, B. Vöcking, Improved routing and sorting on multibutterflies, Proc. 29th ACM Symp. Theory Comput, 1997, 517, 530.
201. Makedon F., Symvonis A. Flit-serial packet routing on meshes and tori. Math. Syst. Theory. 29:1996;311-330.
202. Makedon F., Symvonis A. Optimal algorithms for multipacket routing problems on rings. J. Parallel Distrib. Comput. 22:1994;37-43.
203. Makedon F., Symvonis A. Optimal algorithms for the many-to-one routing problem on two-dimensional meshes. Microprocessors and Microsystems. 17:1993;361-367.
204. Y. Mansour, B. Patt-Shamir, Many-to-one packet routing on grids, Proc. 27th ACM Symp. Theory Comput. 1995, 258, 267.
205. Mansour Y., Schulman L. Sorting on a ring of processors. J. Algebra. 11:1990;622-630.
206. Marberg J. M., Gafni E. Sorting in constant number of row and column phases on a mesh. Algorithmica. 3:1988;561-572.
207. T. R. Mathies, Percolation theory and computing with faulty arrays of processors, Proc. 3rd ACM-SIAM Symp. Disc. Alg, 1992, 100, 103.
208. Mayr E. W., Plaxton C. G. Pipelined parallel prefix computations, and sorting on a pipelined hypercube. J. Parallel Distrib. Comput. 17:1993;374-380.
209. Mehlhorn K., Vishkin U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica. 9:1984;29-59.
210. Meliksetian D. S., Chien C. Y. R. Optimal routing algorithms and other communication issues of the cube-connected cycle. IEEE Trans. Parallel Distrib. Syst. C-4:1993;1172-1178.
211. Mellor-Crummey J. M., Scott M. L. Algorithms for scalable synchronization on shared memory multiprocessors. ACM Trans. Comput. Syst. C-9:1991;21-65.
212. A. Menn, A. Somani, An efficient sorting algorithm for the star graph, Proc. Int. Conf. Parallel Proc. 1990,III, 1, 8.
213. Meyer auf der Heide F. Efficient simulations among several models of parallel computers. SIAM J. Comput. 15:1986;106-119.
214. Meyer auf der Heide F., Oesterdiekhoff B., Wanka R. Strongly adaptive token distribution. Algorithmica. 15:1996;413-427.
215. F. Meyer auf der Heide, C. Scheideler, Space-efficient routing in vertex-symmetric networks, Proc. 7th ACM Symp. Parallel Alg. Arch. 1995, 137, 146.
216. F. Meyer auf der Heide, C. Scheideler, Routing with bounded buffers and hot-potato routing in vertex-symmetric networks, Proc. 3rd European Symp. Alg, Lect. Notes Comput. Sci. 979, 1995, 341, 354.
217. Meyer auf der Heide F., Scheideler C., Stemann V. Exploiting storage redundancy to speed up randomized shared memory simulations. Theoret. Comput. Sci. 162:1996;245-281.
218. M. Mitzenmacher, Bounds on the greedy routing algorithm for array networks, Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 346, 353.
219. Z. G. Mou, C. Constantinescu, T. J. Hickey, Optimal mappings of divide and conquer algorithms to mesh connected parallel architectures, Proc. Int. Comput. Symp. Taichung, Taiwan, 1992, 273, 274.
220. Z. G. Mou, M. Goodman, A comparison of communication costs for three parallel program paradigms on hypercube and mesh architectures, Proc. 5th SIAM Conf. Parallel Proc. Sci. Comput. 1992, 491, 500.
221. Z. G. Mou, X. Wang, A divide and conquer method of solving tridiagonal systems on hypercube massively parallel computers, Proc. 3rd IEEE Symp. Parallel Distrib. Comput. 1991, 810, 817.
222. Nakano K. A bibliography of published papers on dynamically reconfigurable architectures. Parallel Proc. Lett. 5:1995;111-124.
223. bdescend and ascend computations on a SIMD hypercube. IEEE Trans. Parallel Distrib. Syst. C-4:1993;1372-1381.
224. bascend computations on a SIMD hypercube. J. Parallel Distrib. Comput. 20:1994;289-302.
225. Nassimi D., Sahni S. Bitonic sorting on a mesh-connected parallel computer. IEEE Trans. Comput. C-28:1979;2-7.
226. Nassimi D., Sahni S. An optimal routing algorithm for mesh connected parallel computers. J. ACM. 27:1980;6-29.
227. Nassimi D., Sahni S. Parallel algorithms to set-up the Benes permutation network. IEEE Trans. Comput. C-31:1982;148-154.
228. Nassimi D., Sahni S. Optimal BPC permutations on a cube connected SIMD computer. IEEE Trans. Comput. C-31:1982;338-341.
229. Nassimi D., Sahni S. Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM. 29:1982;642-667.
230. I. Newman, A. Schuster, Hot-potato algorithms for permutation routing, IEEE Trans. Parallel Distrib. Syst. C-6, 1995, 1168, 1176.
231. Newman I., Schuster A. Hot-potato worm routing via store-and-forward packet routing. J. Parallel Distrib. Comput. 30:1995;76-84.
232. J. Y. Ngai, C. L. Seitz, A framework for adaptive routing in multicomputer networks, Proc. 1st ACM Symp. Parallel Alg. Arch. 1989, 2, 10.
233. Nigam M., Sahni S. Sortingnnn. J. Parallel Distrib. Comput. 23:1994;37-48.
234. A. D. Oh, H. A. Choi, Generalized measure of fault tolerance inn, IEEE Trans. Parallel Distrib. Syst. C-4, 1993, 702, 703.
235. Ouyang P., Palem K. V. Very efficient cyclic shifts on hypercubes. J. Parallel Distrib. Comput. 39:1996;79-86.
236. Palis M. A., Rajasekaran S., Wei D. S. L. Packet routing and PRAM emulations on star graphs and leveled networks. J. Parallel Distrib. Comput. 20:1994;145-157.
237. Panaite P. Hypercube permutations routable under dimension orderings. Inf. Proc. Lett. 59:1996;185-189.
238. Parberry I. A computer assisted optimal depth lower bound for nine-input sorting networks. Math. Syst. Theory. 24:1991;101-116.
239. Paterson M. S. Improved sorting networks with O(log N. Algorithmica. 5:1990;65-92.
240. Peleg D. A note on optimal time broadcast in faulty hypercubes. J. Parallel Distrib. Comput. 26:1995;132-135.
241. Peleg D., Simmons B. On fault tolerant routings in general networks. Inform. and Comput. 74:1987;33-44.
242. Peleg D., Upfal E. The Token distribution problem. SIAM J. Comput. 18:1989;229-243.
243. Peleg D., Upfal E. A time randomness tradeoff for oblivious routing. SIAM J. Comput. 19:1990;256-266.
244. A. Pietracaprina, G. Pucci, Tight bounds on deterministic PRAM emulations with constant redundancy, Proc. 2nd European Symp. Alg, Lect. Notes Comput. Sci. 855, 1994, 391, 400.
245. A. Pietracaprina, G. Pucci, Improved deterministic PRAM simulation on the mesh, Proc. 22nd Int. Colloquium on Automata Lang. and Programming, Lect. Notes Comput. Sci. 944, 1995, 372, 383.
246. A. Pietracaprina, G. Pucci, J. F. Sibeyn, Constructive deterministic PRAM simulation on a mesh-connected computer, Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 248, 256.
247. T. M. Pinkston, S. Warnakulasuriya, On deadlocks in interconnection networks, Proc. 24th IEEE Int. Symp. Comput. Arch. 1997, 38, 49.
248. Pippenger N. Communication networks. van Leeuwen J. Handbook Theoret. Comput. Sci. 1990;807-833 North-Holland, Amsterdam.
249. N. Pippenger, Parallel communication with limited buffers, Proc. 25th IEEE Symp. Foundations Comput. Sci. 1984, 127, 136.
250. C. G. Plaxton, Load balancing, selection, and sorting on the hypercube, Proc. ACM Symp. Parallel Alg. Arch. 1989, 64, 73.
251. C. G. Plaxton, A hypercubic sorting network with nearly logarithmic depth, Proc. 24th ACM Symp. Theory Comput. 1992, 405, 416.
252. Plaxton C. G., Suel T. A lower bound for sorting networks based on the shuffle permutation. Math. Syst. Theory. 27:1994;491-508.
253. C. G. Plaxton, T. Suel, A super-logarithmic lower bound for hypercubic sorting networks, Proc. 21st EATCS Int. Coll. Aut. Lang. Progr, 1994, 618, 629.
254. Plaxton C. G., Suel T. Lower bounds for Shellsort. J. Algebra. 23:1997;221-240.
255. Preparata F. P., Vuillemin J. The cube-connected cycle: A versatile network for parallel computation. Comm. ACM. 24:1981;300-309.
256. Y. Rabani, E. Tardos, Distributed packet switching in arbitrary networks, Proc. 28th ACM Symp. Theory Comput. 1996, 366, 375.
257. Rabin M. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM. 36:1989;335-348.
258. Raghavan P. Robust algorithms for packet routing in a mesh. Math. Syst. Theory. 28:1995;1-11.
259. Raghunath M. T., Ranade A. Customizing interconnection networks to suit packaging hierarchies. Tech. Rep. 1992.
260. Rajasekaran S. kkkk. J. Algebra. 19:1995;361-382.
261. Rajasekaran S. Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting. IEEE Trans. Comput. C-45:1996;529-539.
262. Rajasekaran S., Overholt R. Constant queue routing on a mesh. J. Parallel Distrib. Comput. 15:1992;160-166.
263. Rajasekaran S., Raghavachari M. Optimal randomized algorithms for multipacket and cut through routing on the mesh. J. Parallel Distrib. Comput. 26:1995;257-260.
264. Rajasekaran S., Tsantilas T. Optimal routing algorithms for the mesh-connected processor arrays. Algorithmica. 8:1992;21-38.
265. S. Rajasekaran, D. S. L. Wei, Selection, routing, and sorting on the star graph, Proc. 7th IEEE Int. Parallel Proc. Symp. 1993, 661, 665.
266. Ramanathan P., Shin K. G. Reliable broadcast in hypercube multicomputers. IEEE Trans. Comput. C-37:1988;1654-1657.
267. Ranade A. How to emulate shared memory. J. Comput. Syst. Sci. 42:1991;307-326.
268. A. Ranade, S. Schleimer, D. S. Wilkerson, Nearly Tight Bounds for Wormhole Routing, Proc. 35th Symp. Foundations Comput. Sci. IEEE, 1994, 346, 255.
269. Ranka R., Sahni S. Hypercube Algorithms with Application to Image Processing and Pattern Recognition. 1990;Springer-Verlag, Berlin/New York.
270. Reif J. H, Valiant L. G. A logarithmic time sort for linear size networks. J. ACM. 34:1987;60-76.
271. Richards D. Parallel sorting-a bibliography. SIGACT News. 18:1986;28-48.
272. Roberts A., Symvonis A. A general method for deflection worm routing on meshes based on packet routing algorithms. Tech. Rep. 1994.
273. Saad Y., Schultz M. H. Data communication in hypercubes. J. Parallel Distrib. Comput. 6:1989;115-135.
274. Sado K., Igarashi Y. Some parallel sorts on a mesh-connected processor array and their time efficiency. J. Parallel Distrib. Comput. 3:1986;398-410.
275. Samatham M. R., Pradhan D. K. The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI. IEEE Trans. Comput. C-38:1989;567-581.
276. S. A. Savari, Average case analysis of five two-dimensional bubblesorting algorithms, Proc. 5th ACM Symp. Parallel Alg. Arch. 1993, 336, 345.
277. Scherson I. D., Sen S. Parallel sorting in two-dimensional VLSI models of computation. IEEE Trans. Comput. C-38:1989;238-249.
278. C. Schnorr, A. Shamir, An optimal sorting algorithm for mesh connected computers, Proc. 18th ACM Symp. Theory Comput. 1986, 255, 263.
279. Schwabe E. J. Constant-slowdown simulations of normal hypercube algorithms on the butterfly network. Inf. Proc. Lett. 45:1993;295-301.
280. U. Schwiegelsohn, A short periodic two-dimensional sorting technique for VLSI networks, Proc. Conf. Systolic Arrays, 1988, 257, 264.
281. Sengupta A., Viswanathan S. On fault-tolerant fixed routing in hypercube. Inf. Proc. Lett. 51:1994;93-99.
282. A. Shaout, D. Smyth, Data flow models for a hypercube multiprocessor network, Proc. Int. Conf. Parallel Proc. 1991, I, 351, 354.
283. Shen X., Hu Q., Liang W. Realization of an arbitrary permutation on a hypercube. Inf. Proc. Lett. 51:1994;237-243.
284. Shen X., Hu Q., Cong B. The 4-star graph is not a subgraph of any hypercube. Inf. Proc. Lett. 45:1993;199-203.
285. Sibeyn J. F. Matrix techniques for faster routing of affine permutations on a mesh interconnection network. Tech. Rep. 1990.
286. J. F. Sibeyn, Routing permutations on mesh interconnection networks, Proc. 2nd IEEE Symp. Parallel Distrib. Comput. 1990, 94, 97.
287. Sibeyn J. F. Algorithms for Routing on Meshes. 1992;Utrecht University.
288. J. F. Sibeyn, Deterministic routing and sorting on rings, Proc. 8th IEEE Int. Parallel Proc. Symp. 1994, 406, 410.
289. J. F. Sibeyn, Desnakification of mesh sorting algorithms, Proc. 2nd Euro Symp. Alg, Lect. Notes Comput. Sci. 855, 1994, 377, 390, SIAM J. Comput.
290. Sibeyn J. F. Routing on triangles, tori and honeycombs. Int. J. Foundations Comput. Sci. 8:1997;269-287.
291. J. F. Sibeyn, Sample sort on meshes, Proc. 3rd Euro-Par Conf, Lect. Notes Comput. Sci. 1300, 1997, 389, 398.
292. J. F. Sibeyn, Routing with finite speeds of memory and network, Proc. 22nd Symp. Math. Foundations Comput. Sci, Lect. Notes Comput. Sci. 1295, 1997, 488, 497.
293. Sibeyn J. F., Chlebus B. S., Kaufmann M. Deterministic permutation routing on meshes. J. Algebra. 22:1997;111-141.
294. J. F. Sibeyn, M. Kaufmann, Deterministic 1-k, Proc. 11th Symp. Theoret. Asp. Comput. Sci, Lect. Notes Comput. Sci. 775, 1994, 237, 248.
295. M. Šoch, P. Tvrdík, Optimal gossip in store-and-forward noncombining 2-D Tori, Proc. 3rd Int. Euro-Par Conf, Lect. Notes Comput. Sci. 1300, 1997, 234, 241.
296. Stamoulis G. D., Tsitsiklis J. N. Greedy routing in hypercubes and butterflies. IEEE Trans. Comm. 42:1994;3051-3061.
297. Stamoulis G. D., Tsitsiklis J. N. Efficient routing schemes for multiple broadcasts in hypercubes. IEEE Trans. Parallel Distrib. Syst. C-4:1993;725-739.
298. Stamoulis G. D., Tsitsiklis J. N. An efficient algorithm for multiple simultaneous broadcasts in the hypercube. Inf. Proc. Lett. 46:1993;219-224.
299. Steinberg D. Notes on invariant properties of the Shuffle/Exchange and a simplified cost-effective version of the Omega network. IEEE Trans. Comput. C-32:1983;444-450.
300. Stout Q. F. Intensive hypercube communication. J. Parallel Distrib. Comput. 10:1990;167-181.
301. T. Suel, Routing and sorting on meshes with row and column buses, Proc. 8th IEEE Int. Parallel Proc. Symp. 1994, 411, 417.
302. T. Suel, Improved bounds for routing and sorting on multi-dimensional meshes, Proc. 6th ACM Symp. Parallel Alg. Arch. 1994, 26, 35.
303. T. Szymanski, On the permutation capability of a circuit-switched hypercube, Proc. Int. Conf. Parallel Proc. 1989, I, 103, 110.
304. T. Szymanski, O(log NNN, Proc. Int. Conf. Parallel Proc. 1991, I, 443, 450.
305. Szymanski T. "Hypermeshes": optical interconnection networks for parallel computing. J. Parallel Distrib. Comput. 26:1995;1-23.
306. H. Tamaki, Efficient self-embedding of butterfly networks with random faults, Proc. 33rd IEEE Symp. Foundations Comput. Sci. 1992, 533, 541.
307. Tien S. B., Raghavendra C. S. Algorithms and bounds for shortest paths and diameter in faulty hypercubes. IEEE Trans. Parallel Distrib. Syst. C-4:1993;713-718.
308. Thompson C. D. Generalized connection networks for parallel processor interconnection. IEEE Trans. Comput. C-27:1978;1119-1125.
309. Thompson C. D., Kung H. T. Sorting on a mesh-connected parallel computer. Comm. ACM. 20:1977;263-270.
310. Thompson P. W., Lewis J. D. The STC104 packet routing chip. VLSI Design. 2:1995;305-314.
311. Upfal E. Efficient schemes for parallel communication. J. ACM. 31:1984;507-517.
312. Upfal E. An O(log N. J. ACM. 39:1992;55-70.
313. E. Upfal, S. Felperin, M. Snir, Randomized routing with shorter paths, Proc. 5th ACM Symp. Parallel Alg. Arch. 1993, 283, 292.
314. Valiant L. G. A scheme for fast parallel communication. SIAM J. Comput. 11:1982;350-361.
315. Valiant L. G. Optimality of a two phase strategy for routing in interconnection networks. IEEE Trans. Comput. C-32:1983;861-863.
316. Valiant L. G. General purpose parallel architectures. van Leeuwen J. Handbook Theoret. Comput. Sci. 1990;943-971 North-Holland, Amsterdam.
317. L. G. Valiant, G. J. Brebner, Universal schemes for parallel communication, Proc. 13th ACM Symp. Theory Comput. 1981, 263, 277.
318. Varman P. J., Doshi K. Sorting with linear speedup on a pipelined hypercube. IEEE Trans. Comput. C-41:1992;97-105.
319. Varvarigos E. A., Bertsekas D. P. Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. Parallel Comput. 18:1992;1233-1257.
320. Varvarigos E. A., Bertsekas D. P. Transposition of banded matrices: a nearly isotropic task. Parallel Comput. 21:1995;243-264.
321. Varvarigos E. A., Bertsekas D. P. Dynamic broadcasting in parallel computing. IEEE Trans. Parallel Distrib. Syst. C-6:1995;120-131.
322. Varvarigos E. A., Bertsekas D. P. Multinode broadcast in hypercubes and rings with randomly distributed length of packets. IEEE Trans. Parallel Distrib. Syst. C-4:1993;144-154.
323. Varvarigos E. A., Banerjee A. Routing schemes for multiple random broadcasts in arbitrary network topologies. IEEE Trans. Parallel Distrib. Syst. C-7:1996;886-895.
324. Waksman A. A permutation network. J. ACM. 15:1968;159-163.
325. Walrand J., Varaiya P. High-Performance Communication Networks. 1996;Morgan-Kauffman, San Mateo.
326. Wang B., Chen G., Lin F. Constant time sorting on a processor array with a reconfigurable bus system. Inf. Proc. Lett. 34:1990;187-192.
327. Wanka R. Fast general sorting on meshes of arbitrary dimension without routing. Tech. Rep. 1991.
328. D. S. Wei, Quicksort and permutation routing on the hypercube and de Bruijn networks, Proc. Int. Symp. Parallel Arch. Alg. and Networks, 1994, 238, 245.
329. Wu J. Safety levels - An efficient mechanism for achieving reliable broadcasting in hypercubes. IEEE Trans. Parallel Distrib. Syst. C-44:1995;702-706.
330. A. Youssef, Cartesian product networks, Proc. Int. Conf. Parallel Proc. 1991, I, 684, 685.