Date of Award
1993
Document Type
Dissertation
Degree Name
Doctor of Philosophy (PhD)
First Advisor
Said Bettayeb
Abstract
To obtain a greater performance, many processors are allowed to cooperate to solve a single problem. These processors communicate via an interconnection network or a bus. The most essential function of the underlying interconnection network is the efficient interchanging of messages between processes in different processors. Parallel machines based on the hypercube topology have gained a great respect in parallel computation because of its many attractive properties. Many versions of the hypercube have been introduced by many researchers mainly to enhance communications. The twisted hypercube is one of the most attractive versions of the hypercube. It preserves the important features of the hypercube and reduces its diameter by a factor of two. This dissertation investigates relations and transformations between various interconnection networks and the twisted hypercube and explore its efficiency in parallel computation. The capability of the twisted hypercube to simulate complete binary trees, complete quad trees, and rings is demonstrated and compared with the hypercube. Finally, the fault-tolerance of the twisted hypercube is investigated. We present optimal algorithms to simulate rings in a faulty twisted hypercube environment and compare that with the hypercube.
Recommended Citation
Abuelrub, Emadeddin Mohamed, "Interconnection Networks Embeddings and Efficient Parallel Computations." (1993). LSU Historical Dissertations and Theses. 5554.
https://repository.lsu.edu/gradschool_disstheses/5554
Pages
111
DOI
10.31390/gradschool_disstheses.5554