-
2
-
-
0027904993
-
A lower bound for permutation routing on two-dimensional bussed meshes
-
S. Cheung and F. C. M. Lau, A lower bound for permutation routing on two-dimensional bussed meshes, Inform. Process. Lett. 45 (1993), 225-228.
-
(1993)
Inform. Process. Lett.
, vol.45
, pp. 225-228
-
-
Cheung, S.1
Lau, F.C.M.2
-
4
-
-
0346928653
-
A parallel sorting algorithm on the mesh-bus machine
-
2
-
K. Iwama, E. Miyano, and Y. Kambayashi, A parallel sorting algorithm on the mesh-bus machine, "Information Processing Society of Japan SIGAL Reports," No. 18-2, 1990.
-
(1990)
Information Processing Society of Japan SIGAL Reports
, Issue.18
-
-
Iwama, K.1
Miyano, E.2
Kambayashi, Y.3
-
5
-
-
84990690765
-
Optimal Routing Algorithms for Mesh-Connected Processor Arrays
-
Springer-Verlag, Berlin/New York
-
D. Krizanc, S. Rajasekaran, and T. Tsantilas, "Optimal Routing Algorithms for Mesh-Connected Processor Arrays," Lecture Notes in Computer Science, Vol. 319, pp. 411-422, Springer-Verlag, Berlin/New York, 1988.
-
(1988)
Lecture Notes in Computer Science
, vol.319
, pp. 411-422
-
-
Krizanc, D.1
Rajasekaran, S.2
Tsantilas, T.3
-
6
-
-
85034760553
-
Routing and Sorting on Mesh-Connected Arrays
-
Springer-Verlag, Berlin/New York
-
M. Kunde, "Routing and Sorting on Mesh-Connected Arrays," Lecture Notes in Computer Science, Vol. 319, pp. 423-433, Springer-Verlag, Berlin/New York, 1988.
-
(1988)
Lecture Notes in Computer Science
, vol.319
, pp. 423-433
-
-
Kunde, M.1
-
7
-
-
85034062112
-
A 2n - 2 step algorithm for routing in an n × n array with constant queue sizes
-
F. T. Leighton, F. Makedon, and I. Tollis, A 2n - 2 step algorithm for routing in an n × n array with constant queue sizes, in "Proc. 1st ACM Symposium of Parallel Algorithms and Architectures, 1989," pp. 328-335.
-
(1989)
Proc. 1st ACM Symposium of Parallel Algorithms and Architectures
, pp. 328-335
-
-
Leighton, F.T.1
Makedon, F.2
Tollis, I.3
-
9
-
-
0022866986
-
The distance bound for sorting on mesh-connected processor arrays is tight
-
Y. Ma, S. Sen, and I. Scherson, The distance bound for sorting on mesh-connected processor arrays is tight, in "Proc. 27th IEEE Symp. on Foundations of Computer Science, 1986," pp. 255-263.
-
(1986)
Proc. 27th IEEE Symp. on Foundations of Computer Science
, pp. 255-263
-
-
Ma, Y.1
Sen, S.2
Scherson, I.3
-
14
-
-
0020810440
-
Mesh-connected computers with broadcasting
-
Q. F. Stout, Mesh-connected computers with broadcasting, IEEE Trans. Comput. C-32, 9 (1983), 826-830.
-
(1983)
IEEE Trans. Comput.
, vol.C-32
, Issue.9
, pp. 826-830
-
-
Stout, Q.F.1
|