A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers

From disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large numbe...

Full description

Bibliographic Details
Main Authors: M M Hafizur Rahman, Mohammed Al-Naeem, Mohammed Mustafa Ghowanem, Eklas Hossain
Format: Article
Language:English
Published: MDPI AG 2021-11-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/11/22/10798
_version_ 1797511328743555072
author M M Hafizur Rahman
Mohammed Al-Naeem
Mohammed Mustafa Ghowanem
Eklas Hossain
author_facet M M Hafizur Rahman
Mohammed Al-Naeem
Mohammed Mustafa Ghowanem
Eklas Hossain
author_sort M M Hafizur Rahman
collection DOAJ
description From disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large number of nodes are gaining popularity. To interconnect these huge numbers of nodes efficiently, hierarchical interconnection networks are an attractive and feasible option. A Tori-connected flattened butterfly network (TFBN) has been proposed by the authors in a prior work for future generation MPC systems. In the previous study, the static network performance and static cost-effectiveness were evaluated. In this research, a novel trade-off factor named message traffic congestion vs. packing density trade-off factor has been proposed, which characterizes the message congestion in the network and its packing density. The factor is used to statically assess the suitability of the implementation of an interconnection network. The message traffic density, packing density, and new factor have been evaluated for the proposed network and similar competitive networks such as TTN, TESH, 2D-Mesh, 3D-Mesh, 2D-Torus, and 3D-Torus. It has been found that the performance of the TFBN is superior to the other networks.
first_indexed 2024-03-10T05:44:45Z
format Article
id doaj.art-ffbb810f24a543e7aedadfadd0c2be8c
institution Directory Open Access Journal
issn 2076-3417
language English
last_indexed 2024-03-10T05:44:45Z
publishDate 2021-11-01
publisher MDPI AG
record_format Article
series Applied Sciences
spelling doaj.art-ffbb810f24a543e7aedadfadd0c2be8c2023-11-22T22:19:05ZengMDPI AGApplied Sciences2076-34172021-11-0111221079810.3390/app112210798A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel ComputersM M Hafizur Rahman0Mohammed Al-Naeem1Mohammed Mustafa Ghowanem2Eklas Hossain3Department of Computer Networks & Communications, CCSIT, King Faisal University, Al Hassa 31982, Saudi ArabiaDepartment of Computer Networks & Communications, CCSIT, King Faisal University, Al Hassa 31982, Saudi ArabiaDepartment of Computer Networks & Communications, CCSIT, King Faisal University, Al Hassa 31982, Saudi ArabiaOregon Renewable Energy Center (OREC), Department of Electrical Engineering and Renewable Energy, Oregon Institute of Technology, Klamath Falls, OR 97601, USAFrom disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large number of nodes are gaining popularity. To interconnect these huge numbers of nodes efficiently, hierarchical interconnection networks are an attractive and feasible option. A Tori-connected flattened butterfly network (TFBN) has been proposed by the authors in a prior work for future generation MPC systems. In the previous study, the static network performance and static cost-effectiveness were evaluated. In this research, a novel trade-off factor named message traffic congestion vs. packing density trade-off factor has been proposed, which characterizes the message congestion in the network and its packing density. The factor is used to statically assess the suitability of the implementation of an interconnection network. The message traffic density, packing density, and new factor have been evaluated for the proposed network and similar competitive networks such as TTN, TESH, 2D-Mesh, 3D-Mesh, 2D-Torus, and 3D-Torus. It has been found that the performance of the TFBN is superior to the other networks.https://www.mdpi.com/2076-3417/11/22/10798Tori-connected flattened butterfly networkmassively parallel computerhierarchical interconnection networkstatic network performancepacking densitymessage traffic density
spellingShingle M M Hafizur Rahman
Mohammed Al-Naeem
Mohammed Mustafa Ghowanem
Eklas Hossain
A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
Applied Sciences
Tori-connected flattened butterfly network
massively parallel computer
hierarchical interconnection network
static network performance
packing density
message traffic density
title A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
title_full A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
title_fullStr A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
title_full_unstemmed A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
title_short A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers
title_sort novel tradeoff analysis between traffic congestion and packing density of interconnection networks for massively parallel computers
topic Tori-connected flattened butterfly network
massively parallel computer
hierarchical interconnection network
static network performance
packing density
message traffic density
url https://www.mdpi.com/2076-3417/11/22/10798
work_keys_str_mv AT mmhafizurrahman anoveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT mohammedalnaeem anoveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT mohammedmustafaghowanem anoveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT eklashossain anoveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT mmhafizurrahman noveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT mohammedalnaeem noveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT mohammedmustafaghowanem noveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers
AT eklashossain noveltradeoffanalysisbetweentrafficcongestionandpackingdensityofinterconnectionnetworksformassivelyparallelcomputers