IDEAS home Printed from https://ideas.repec.org/a/epw/comput/v3y2023i4id10092.html

An Innovative Topologies Based on Hypercube Network Interconnection

Author

Listed:
  • Moslim Mohsin
  • Adil AL Rammahi
  • Furkan Rabee

Abstract

A parallel processing system's most crucial part is a network interconnection that links its processors. The hypercube topology has interesting features that make it a great option for parallel processing applications. This paper presents two innovative configurations of interconnection networks based on fractal Sierpinski and a hypercube. These are called the Sierpinski Triangle Topology (STT) and Sierpinski Carpet Topology (SCT). Compared to a hypercube, the Sierpinski Triangle topology (STT) noticed a significant decrease in the number of nodes and links as large networks grew. Hence, it is considered a great way to reduce costs because it uses fewer nodes and links. The average distance is also shorter, which is better. Despite it having a smaller bisection width and a higher degree than a hypercube by one. The Sierpinski Carpet Topology (SCT) has the advantage of having a high bisection width compared to a hypercube. That is preferable because it places a lower restriction on the difficulty of parallel algorithms. While the drawback of this topology is that it has a diameter and average distance more than a hypercube.

Suggested Citation

  • Moslim Mohsin & Adil AL Rammahi & Furkan Rabee, 2023. "An Innovative Topologies Based on Hypercube Network Interconnection," European Journal of Information Technologies and Computer Science, European Open Science, vol. 3(4), pages 7-13, September.
    • Handle: RePEc:epw:comput:v:3:y:2023:i:4:id:10092
    DOI: 10.24018/compute.2023.3.4.92
    as

    Download full text from publisher

    File URL: https://eu-opensci.org/index.php/compute/article/view/10092
    File Function: Abstract page
    Download Restriction: no
    File URL: https://eu-opensci.org/index.php/compute/article/download/10092/1831
    File Function: Full text
    Download Restriction: no
    File URL: https://libkey.io/10.24018/compute.2023.3.4.92?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:epw:comput:v:3:y:2023:i:4:id:10092. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Support Team (email available below). General contact details of provider: https://eu-opensci.org/index.php/compute .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.