Abstract
In this paper, we analyze the delay of an average message going through an arbitrary link of the N-cube. We view each link as an M/M/1 queue and find analytic recursive relations for the arrival rate of messages at an arbitrary link. Then, we calculate the delay per link as a function of the message generation rate at the processor. We investigate two model of communication. The first, uniform communication where each processor communicate with any other processor with the same probability. The second is clustered communication, where neighboring processors communicate more than distant processors do. Finally, we investigate the effect of adding one more link at each node of the cube (Folded Hypercube) on the delay and the maximum number of hops.
This work was partially supported by a grant from the Engineering Council of Canada grant number NSERC-OGP0043688.
This work was completed while the author was with the EE Department of Purdue University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
S. Abraham and K. Padmanabhan, “Performance of the Direct Binary n-Cube Network for Multiprocessors,” IEEE Transactions on Computers, Vol. 38, No. 7, July 1989, pp. 1000–1011.
A. O. Allen, Probability, Statistics, and Queueing Theory, Academic Press, 1978.
K. E. Batcher, “Design of a Massively Parallel Processor,” Trans. on Computers, Vol. C-29,N9, Sept. 1980, pp. 836–840.
G. Fox, The Performance of the Caltech Hypercube in Scientific Calculations, Caltech Report CALT-68-1298, Caltech, 1985.
K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, 1984.
L. Kleinrock, Queueing Systems, Volume 1: Theory, John Wiley and Sons, 1976.
L. Kleinrock, Queueing Systems, Volume 2: Computer Applications, John Wiley and Sons, 1976.
D. J. Kuck and R. A. Stokes, “The Burroughs Scientific Processor (BSP),” IEEE Transactions on Computers, Vol. C-31, May 1982, pp. 363–376.
S. Latif and A. El-Amawy, “On Folded Hypercubes,” Proc. of International Conference on Parallel Processing, 1989.
NCUBE Corp., NCUBE Handbook, version 1.0, NCUBE Corp., Beaverton, Oregon, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aboelaze, M.A., Houstis, C.E. (1991). Delay analysis of the N-cube network. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038485
Download citation
DOI: https://doi.org/10.1007/BFb0038485
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97628-0
Online ISBN: 978-0-387-34815-5
eBook Packages: Springer Book Archive