A BROADCAST ALGORITHM FOR ALL PORT WORMHOLE ROUTED TORUS NETWORKS

A new approach to broadcast in wormhole-routed two- and three-dimensio nal torus networks is proposed. The underlying network is assumed to s upport only deterministic, dimension-ordered unicast routing. The appr oach extends the graph theoretical concept of dominating nodes by acco unting for the relative distance-insensitivity of the wormhole routing switching strategy. The proposed algoritum also takes advantage of an all-port communication architecture, which allows each node to simult aneously transmit messages on different outgoing channels. The resulti ng broadcast operation is based on a tree structure that uses multiple levels of extended dominating nodes (EDNs). Performance results are p resented that confirm the advantage of this method over the approaches .