1 research outputs found
Recommended from our members
Properties and communication algorithms for k-ary n-cube interconnection networks
The k-ary n-cube structure is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. Machines based on the k-ary n-cube topology have been advocated as ideal parallel architectures for their powerful interconnecting features.
In this paper, we examine the k-ary n-cube from the graph theory point of view and consider those features that make its connectivity so attractive. Among other things, we propose several effective global data communication algorithms on the k-ary n-cube interconnection network