Year-end Sale % OFF 
Abstract
In communication system of network routing algorithm acts an important role. The efficiency of a parallel system depends on the reliable and efficient routing algorithm which is used to route the messages between the fault-free nodes. In this paper a new class of interconnection network of Octagon-Cell is introduced, which is called Multilayer Octagon-Cell (MLO). The structure of Multilayer Octagon-cell is recursive in nature. It can be expanded, if we increase the depth of MLO. This paper introduces the node degree, diameter, number of links, bisection width of the MLO network and we have also developed the optimal routing algorithm of MLO.
Highlights
The efficiency of communication system depends on the routing algorithm adopted in the system
Some features in the network of parallel machines are highly desirable such as minimal communication cost, efficient routing and the capability of topological structures [3]
In this paper we have described a new topological structure called Multilayer Octagon-Cell (MLO) with its optimal routing algorithm
Summary
The efficiency of communication system depends on the routing algorithm adopted in the system. The degree of a node in an interconnection network is related to the cost of hardware and message passing time is related to diameter of the network [16]. Throughput is increased if the degree of network is decreased. Some features in the network of parallel machines are highly desirable such as minimal communication cost, efficient routing and the capability of topological structures [3]. The underlying communication network and the matching of the algorithm with the network structure strongly affect the performance of parallel machines. In this paper we have described a new topological structure called MLO with its optimal routing algorithm
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
