Abstract
Efficient data communication is a critical issue to the performance of the parallel and distributed computer systems. In this work, we study data communication problems in the Incomplete Hypercube. In particular, we present efficient schemes for the following data communication primitives: (1) single node broadcasting and accumulation, (2) single node gather and scatter, and (3) multinode broadcasting and accumulation. Although the Incomplete Hypercube displays less regularity than the hypercube, most of our results are optimal in terms of minimal routing steps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D. P., Ozveren, C., Stamoulis, G. D., Tseng, P., and Tsitsiklis, J. N. Optimal communication algorithm for hypercubes. Journal of Parallel and Distributed Computing 11 (1991), 263–275.
Bertsekas, D. P., and Tsitsiklis, J. N. Parallel and Distributed Computation. Prentice Hall, 1989.
Chen, M.-S., and Shin, K. S. Processor allocation in an n-cube multiprocessor using Gray codes. IEEE Trans. Computers C-36, 12 (Dec. 1987), 1396–1407.
Dutt, S., and Hayes, J. P. Subcube allocation in hypercube computers. IEEE Trans. Computers C-40, 3 (Mar. 1991), 341–352.
Johnsson, S. L., and Ho, C.-T. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Computers C-38, 9 (Sept. 1989), 1249–1268.
Katseff, H. Incomplete hypercube. IEEE Trans. Computers C-37, 5 (May 1988), 604–608.
Liu, J. Graph Embedding and Data Communication in a Large Family of Network Topologies. PhD thesis, Michigan State University, Aug. 1992.
Liu, J., and Hsu, W.-J. Distributed algorithms for shortest-path, deadlock-free routing and broadcast in Fibonacci cubes. In Proc. 11th Phoenix Conf. on Computers and Communications (1992), pp. 23–30.
Liu, J., and Hsu, W.-J. Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in a class of interconnection topologies. In Proc. International Parallel Processing Symposium (1992), pp. 589–596.
Saad, Y., and Schultz, M. H. Data communication in hypercube. Tech. Rep. YALEU/DCS/RR-428, Dept. of Computer Science, Yale Univ., 1985.
Saad, Y., and Schultz, M. H. Topological properties of the hypercubes. IEEE Trans. Computers C-37, 7 (July 1988), 867–872.
Sullivan, H., and Bashkow, T. R. A large scale homogeneous, full distributed parallel machine, I. In Proc. 4th Symp. Comput. Architecture (1977), pp. 105–117.
Tien, J.-Y., Ho, C.-T., and Yang, W.-P. Broadcasting on incomplete hypercubes. Tech. Rep. RJ 8130, IBM Corp., 1991.
Tzeng, N.-F. Structural properties of incomplete hypercube computers. In Proc. Intn'l Conf. on Distributed Computing Systems (1990), pp. 262–269.
Tzeng, N.-F., Chen, H.-L., and Chuang, P.-J. Embeddings in incomplete hypercubes. In Proc. Intn'l Conf. on Parallel Processing (1990), pp. III-335–III-339.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Hsu, WJ. (1994). Efficient data communication in Incomplete Hypercube. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_86
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive