Thursday 23rd of November 2017
 

Embedding Hex-Cells into Tree-Hypercube Networks


Awad Ibrahim Qatawneh

Graph embedding or graph mapping is an important aspect for interconnection networks used for communication between processors in parallel systems. Some parallel algorithms use communication structures which can be represented by hex-cells. In order to run these algorithms on a tree-hypercube multiprocessor system, without changing the current topology and the running application, their communication graphs need to be embedded into tree- hypercube. In this research, we have designed an algorithm for embedding hex-cells of n nodes into tree-hypercube TH(2,d) where d = 2. The embedding has dilation one, congestion one, and expansion 1.1. In the algorithm an embedding of irregular shape of hex-cells into tree-hypercube TH(2,d) where d = 2 is performed.

Keywords: Graph Embedding, Hex-Cells, Tree-Hypercube networks, Parallel Systems

Download Full-Text


ABOUT THE AUTHOR

Awad Ibrahim Qatawneh
Awad Qatawneh is a Full Time Lecturer at the Computer and Information Department at Jazan University, Saudi Arabia. He earned his Bachelorís degree in Computer Science in 2004 from Mutah University, Jordan, and his Masters in Computer Science in 2009 from Middle East University for Graduate Studies, Jordan.


IJCSI Published Papers Indexed By:

 

 

 

 
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »