In direct interconnection networks, the collective communication operation one to all, which is usually refe1Ted to as broadcasting, can be generalized to allow one source node to send a message to a rectangular region of nodes, rather than to all nodes. Most of the proposed routing algorithms for direct mesh and torus networks use a broadcast tree of unicast messages. While the Minimum Spanning Tree tree-based region broadcasting is not deadlock free, unless the network is partitioned into many virtual sub-networks, where the number of virtual channels grows exponentially with the dimension of the network, the Minimum Spanning Tree Safe algorithm is deadlockfree even with one virtual channel. The Minimum Spanning Tree Safe algorithm perfo1ms very well if the source nodes of broadcast messages are part of their broadcast regions; otherwise, broadcast messages may need to be ejected as soon as they reach the first node in their region and then re-injected in order to avoid deadlock. This thesis proposes two versions of the Minimum Spanning Tree region-broadcasting algorithm that are based on the idea of starting always at a comer of a region. The first algorithm uses always a fixed comer, while the second one uses the nearest comer. The two proposed algorithms are deadlock free even when source node is located outside the broadcast region without the need for intermediate ejection and re-injection that is required by the Minimum Spanning Tree Safe. Both algorithms use virtual cut through for buffering blocked packets and can be safely mixed with dimension order unicast routing algorithms. The performance of two dimensional and four dimensional mesh networks was evaluated using the two proposed tree-based broadcast algorithms and compared to other existing algorithms which are: the Recursive Doubling, the Column Path, and the Minimum Spanning Tree Safe. The results obtained are encouragmg.
Computer Science & Engineering Department
MS in Computer Science
Date of Award
Online Submission Date
Committee Member 1
Committee Member 2
Committee Member 3
Amr El Kadi
98 leaves :
Library of Congress Subject Heading 1
The author retains all rights with regard to copyright. The author certifies that written permission from the owner(s) of third-party copyrighted matter included in the thesis, dissertation, paper, or record of study has been obtained. The author further certifies that IRB approval has been obtained for this thesis, or that IRB approval is not necessary for this thesis. Insofar as this thesis, dissertation, paper, or record of study is an educational record as defined in the Family Educational Rights and Privacy Act (FERPA) (20 USC 1232g), the author has granted consent to disclosure of it to anyone who requests a copy.
(2003).Tree-based regional broadcasting in MESH direct networks [Thesis, the American University in Cairo]. AUC Knowledge Fountain.
Haddad, Hadeel Youssef Samaan. Tree-based regional broadcasting in MESH direct networks. 2003. American University in Cairo, Thesis. AUC Knowledge Fountain.
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.