Leafy Crossed Cube: An Efficient PIN for High Speed Computing

5 Pages Posted: 24 Jan 2020

See all articles by Nibedita Adhikari

Nibedita Adhikari

Biju Patnaik University of Technology

Tapaswini Dash

Biju Patnaik Institute of Information Technology

Date Written: January 8, 2020

Abstract

This paper attempts to suggest a new derived parallel interconnection network for high end computing system namely the Leafy Cross cube (LCC). As compared to the other interconnection networks LCC is found to be more attractive in terms of topological parameters such as diameter, average node distance and message traffic density etc. It helps to improving the node packing density in the interconnection network.

Keywords: HC, CC, Message traffic density, topological parameters, complexity

Suggested Citation

Adhikari, Nibedita and Dash, Tapaswini, Leafy Crossed Cube: An Efficient PIN for High Speed Computing (January 8, 2020). Proceedings of Industry Interactive Innovations in Science, Engineering & Technology (I3SET2K19), Available at SSRN: https://ssrn.com/abstract=3515868 or http://dx.doi.org/10.2139/ssrn.3515868

Nibedita Adhikari (Contact Author)

Biju Patnaik University of Technology ( email )

Rourkela 769004
India

Tapaswini Dash

Biju Patnaik Institute of Information Technology ( email )

Plot No:- 216/A, Zone-B,
Mancheswar Ind State
Bhubaneswar, Orissa 751010
India

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
44
Abstract Views
320
PlumX Metrics