The wrap-around banyan-hypercube networks

مقدم أطروحة جامعية

Faiq, Jamal

مشرف أطروحة جامعية

Bellaachia, Abd al-Ghani

الجامعة

جامعة الأخوين

الكلية

كلية الهندسة و العلوم

القسم الأكاديمي

علوم الحاسب

دولة الجامعة

المغرب

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

1998

الملخص الإنجليزي

Ihe banyan-hypercube (uh) is one or tne recently jutroduced hypercube-based interconnection netw’orks.

It is a synthesis of banyan networks and hypercube networks.

A banyan-hypercubc network is denvad by interconnecting the nodes of each banyan level by a hypercube network.

BHs are fc^liown to combine the advantageous features of banyans and hypercubes.

In particular, many hypercube features in routing, embedding, and partitioning were incorporated into banyan hypercubes and new gains were achieved in diameter, averages distance, embedding efficiency and partitioning flexibility.

In this work, we ext^ind BHs tjy connecting the bottom and top levels of the BH and thereby define the family of wrap-around banyan-hypercubes (WABHa).

This very low cost extension keeps all the advantages of BHs and enables WABHs to have additional features.

We shall show that WABHs have better fault tolerance capabilities and can efficiently embed new interconnection networks such as tori and cube connected cycles [CCC), Furthermore, WABHs have a regular degree for every node and smaller average distance than both BHs and hypercubes.

We also give both a routing algorithm and a broadcasting algorithm for WABHs.

To sustain theoretical results, intensive simulations of message routing were conducted.

They confirm the higher performance of WABHs over BHs and hypercubes.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

• البرمجة المتوازية(الحاسبات الإلكترونية)
• برمجيات الحاسوب

عدد الصفحات

53

قائمة المحتويات

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-645406