RCC-Full: An Effective Network for Parallel Computations

Journal of Parallel and Distributed Computing

Volumn 41, Issue 2, 1997, Pages 139-155

  Hamdi, Mounir ^a   Hall, Richard W ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (32)

1. Agrawal D. P., Janakiram V. K., Pathak G. C. Evaluating the performance of multicomputer configurations. IEEE Comput. 9:May 1986;23-37.
2. Akl S. G. The Design and Analysis of Parallel Algorithms. 1989;Prentice Hall, Englewood Cliffs.
3. Akl S. G., Lyons K. A. Parallel Computational Geometry. 1993;Prentice Hall, Englewood Cliffs.
4. Alt H., Hagerup T., Mehlhorn K., Preparata F. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM J. Comput. 16:Oct. 1987;808-835.
5. Bhuyan L. M., Agrawal D. P. Generalized hypercube and hyperbus structures for a computer network. IEEE Trans. Comput. 33:April 1984;323-333.
6. Borodin A., Hopcroft J. Routing, merging, and sorting in parallel models of computation. Proc. ACM Symposium Theory Comput. 1982;338-344.
7. Cole R. Parallel merge sort. SIAM J. Comput. 17:1988;770-785.
8. Cypher R. Theoretical aspects of VLSI pin limitations. SIAM J. Comput. 22:1993;356-378.
9. Dandamudi S. P., Eager D. L. Hierarchical interconnection networks for multicomputer systems. IEEE Trans. Comput. 39:June 1990;786-797.
10. El-Amawy A., Latifi S. Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Systems. 2:Jan. 1991;31-42.
11. S. Fortune, J. Wyllie, 1978, Parallelism in random access machines, Proc. ACM Symposium Theory Comput, 114, 118.
12. Ghosh J., Hwang K. Mapping neural networks onto message-passing multicomputers. J. Parallel Distrib. Comput. 6:April 1989;291-330.
13. Hamdi M., Hall R. W. An efficient class of interconnection networks for parallel computations. Comput. J. 37:1994;206-218.
14. Hamdi M., Hall R. W. Compound graph networks for parallel image processing. Proc. of the 1991 Workshop on Comput. Arch. for Machine Perception. 1991;365-377.
15. Kumar J. M., Patnaik L. M. Extended hypercube: A hierarchical interconnection network of hypercube. IEEE Trans. Parallel Distrib. Systems. 3:Jan. 1992;31-42.
16. Kruskal C. P., Rudolph L., Snir M. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci. 71:Mar. 1990;95-132.
17. T. Leighton, 1993, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA.
18. Leiserson C. E., Maggs B. M. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica. 1988;53-77.
19. Leiserson C. E. Fat-Trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. 34:1985;892-900.
20. Luccio F., Pietracaprina A., Pucci G. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica. 5:1990;529-544.
21. Luccio F., Pietracaprina A., Pucci G. An efficient probabilistic simulation of PRAMs in VLSI. Inform. Process. Lett. 1988;141-146.
22. Marberg J. M., Gafni E. Sorting in constant number of row and column phases in a mesh. Algorithmica. 3:1988;561-572.
23. Maresca M., Li H. Polymorphic-torus networks. IEEE Trans. Comput. 38:Sep. 1989;1345-1351.
24. Mehlhorn K., Vishkin U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informat. 1984;339-374.
25. R. Miller, Q. F. Stout, 1994, Parallel Algorithms for Regular Architectures, MIT Press, Cambridge, MA.
26. Nassimi D., Sahni S. Data broadcasting in SIMD computers. IEEE Trans. Comput. 30:1981;101-107.
27. Olariu S., Schwing J. L., Zhang J. On the power of two-dimensional processor arrays with reconfigurable bus systems. Parallel Process. Lett. 1:Sep. 1991;29-34.
28. Preparata F. P., Vuillemin J. The cube-connected cycles: A versatile network for parallel computations. Comm. ACM. 24:1981;300-309.
29. Ranka S., Sahni S. Hypercube Algorithms With Applications to Image Processing and Pattern Recognition. 1990;Springer-Verlag, New York.
30. Reed D. A., Fujimoto R. M. Multicomputer Networks: Message-Based Parallel Processing. 1987;MIT Press, Cambridge.
31. Trew A., Wilson G. Past, Present, Parallel: A Survey of Available Parallel Computer Systems. 1991;Springer-Verlag, Berlin/New York.
32. Upfal E., Wigderson A. How to share memory in a distributed system. J. Assoc. Comput. Mach. 34:1987;116-127.