8.15.2 D.2. Meshes, hypercubes, etc.

Chapter Contents (Back)

Alnuweiri, H.M., Prasanna), V.K.PrasannaKumar(V.,
Processor-Time Optimal Parallel Algorithms For Digitized Images On Mesh-Connected Processor Arrays,
ALGORITHMICA(6), 1991, pp. 698-733. BibRef

Dehne, F., Hassenklover, A.L., Sack, J.R., Santoro, N.,
Computational Geometry Algorithms For The Systolic Screen,
ALGORITHMICA(6), 1991, pp. 734-761. BibRef

Kim, Y.M., Lai, T.H.,
The Complexity Of Congestion-1 Embedding In A Hypercube,
J. ALGORITHMS(12), 1991, pp. 246-280. BibRef

Alnuweiri, H.M., Prasanna, V.K.,
Optimal Geometric Algorithms For Digitized Images On Fixed-Size Linear Arrays And Scan-Line Arrays,
DISTRIBUTED COMPUTING(5), 1991, pp. 55-65. BibRef

Mycielski, J., Niwinski, D.,
Cellular Automata On Trees, A Model For Parallel Computation,
FUNDAMENTA INFORMATICAE(XV), 1991, pp. 139-144. BibRef

Gibbons, A., Ziani, R.,
The Balanced Binary Tree Technique On Mesh-Connected Computers,
IPL(37), 1991, pp. 101-109. BibRef


Corbett, P.F., Scherson, I.D.,
A Unified Algorithm For Sorting On Multidimensional Mesh-Connected Processors,
IPL(37), 1991, pp. 225-231. BibRef

Leiss, E.L., Reddy, H.N.,
Embedding Complete Binary Trees Into Hypercubes,
IPL(38), 1991, pp. 197-199. BibRef

Latifi, S.,
Distributed Subcube Identification Algorithms For Reliable Hypercubes,
IPL(38), 1991, pp. 315-321. BibRef

Scherson, I.D., Corbett, P.F.,
Communications Overhead And The Expected Speedup Of Multidimensional Mesh-Connected Parallel Processors,
JPDC(11), 1991, pp. 86-96. BibRef

Efe, K.,
Embedding Mesh Of Trees Into The Hypercube,
JPDC(11), 1991, pp. 222-230. BibRef

Varadarajan, R.,
Embedding Shuffle Networks In Hypercubes,
JPDC(11), 1991, pp. 252-256. BibRef

Bertsekas, D.P., Ozveren, C., Stamoulis, G.D., Tseng, P., Tsitsiklis, N.H.,
Optimal Communication Algorithms For Hypercubes,
JPDC(11), 1991, pp. 263-275. BibRef

Sitaram, D., Koren, I., Krishna, C.M.,
A Random, Distributed Algorithm To Embed Trees In Partially Faulty Processor Arrays,
JPDC(12), 1991, pp. 1-11. BibRef

Strong, J.P.,
Computations On The Massive Parallel Processor At The Goddard Space Flight Center,
P-IEEE(79), 1991, pp. 548-558. BibRef

Simmen, M.,
Comments On Broadcast Algorithms For Two-Dimensional Grids,
PC(17), 1991, pp. 109-112. BibRef

Chan, M.Y.,
Embedding Of Grids Into Optimal Hypercubes,
SIAM JC(20), 1991, pp. 834-864. BibRef

Ellis, J.A.,
Embedding Rectangular Grids Into Square Grids,
T-COMP(40), 1991, pp. 46-52. BibRef

Bar-Noy, A., Peleg, D.,
Square Meshes Are Not Always Optimal,
T-COMP(40), 1991, pp. 196-204. BibRef

Lai, T.H., Sprague, A.P.,
Placement Of The Processors On A Hypercube,
T-COMP(40), 1991, pp. 714-722. BibRef


Gupta, A.J., Hambrusch, S.E.,
Embedding Complete Binary Trees Into Butterfly Networks,
T-COMP(40), 1991, pp. 853-863. BibRef

Beivide, R., Herrada, E., Balcazar, J.L., Arruabarrena, A.,
Optimal Distance Networks Of Low Degree For Parallel Computers,
T-COMP(40), 1991, pp. 1109-1124. BibRef

Efe, K.,
A Variation On The Hypercube With Lower Diameter,
T-COMP(40), 1991, pp. 1312-1316. BibRef

Li, K., Cheng, K.H.,
Job Scheduling In A Partitionable Mesh Using A Two-Dimensional Buddy System Partitioning Scheme,

Chapter on Rosenfeld Bibliography for 1991 continues in
D.3. Other systems, etc. .

Last update:Jun 7, 2018 at 10:14:50