Parallel Data Transmission Method on Extended Cube Structure Multiprocessor Network

Abstract

The invention discloses a parallel data transmission method on an extended cube structure multi-processor network. When a processor is designated as a source processor in the invention, a group of edge-independent spanning trees can be constructed in parallel with the processor as the center, so that There are 2n-1 edge-disjoint paths from this processor to any other processor. Data can be decomposed into these 2n‑1 paths for parallel transmission without interfering with each other. According to any given vertex, the present invention can construct 2n-1 edge-independent spanning trees in parallel; there are 2n-1 edge-disjoint paths between the root vertex and any other vertex; each tree can be constructed independently. The invention has better topology properties, can greatly reduce hardware cost and communication overhead, and improve the balance of communication cost, and has broad market prospects in the popularization of interconnection network structure.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a data parallel transmission method on an extended cube structure multiprocessor network. Background technique [0002] Augmented Cube structure multiprocessor network is an important variant of hypercube network, which has attracted extensive attention of scholars. n-dimensional extended cube AQ n has 2 n Processors are also (2n-1)-edge-connected and (2n-1)-vertex-connected. 1D Extended Cube AQ 1 is a complete graph with two vertices. n-dimensional extended cube AQ n (n≥2) is composed of two n-1-dimensional extended cubes AQ n-1 connected. These two AQs n-1 Expressed as with with Add 2×2 between n-1 The borders are as follows: Order with Vertex a=0a in n-1 a n-1 ...a 1 and Vertex b=1b in n-1 b n-2 ...b 2 Adjacent if and only if for any i, 1≤i≤n-1, a i =b i or for any i, 1≤i≤n-1, [0003] Using AQ n In a multi-processor netwo...

AI Technical Summary

Problems solved by technology

The existing construction method of independent spanning tree on the extended cube structure multiprocessor network is a recursive construction method, the corresponding algorithm time complexity is high and the maximum height of a set of trees constructed by this method is also high

[0004] Existing AQs about Expanding Cubes n The above construction method of independent spanning tree can only solve the serial construction of 2n-1 edge independent spanning trees. This method has the disadvantage of interdependence between the structures of trees and trees, which makes the construction process of trees complicated and low in efficiency.

Images