Abstract

ABSTRACTInterconnection networks are introduced when dealing with the connection of a significant number of processors in massively parallel systems. TM topology is one of the latest interconnection networks to solve the deadlock problem and achieve high performance in massively parallel systems. This topology is derived from a Torus topology with removing cyclic channel dependencies. In this paper, we derive a mathematical model for TM topology under uniform and hotspot traffic patterns to compute the average delay. The average delay is formulated from the sum of the average delay of network, the average waiting time of the source node and the average degree of virtual channels. The results obtained from the mathematical model exhibit a close agreement with those predicted by simulation. In addition, sufficient simulation results are presented to revisit the TM topology performance under various traffic patterns.

Highlights

  • High-performance computing is needed to solve a variety of well-known problems in many research areas, such as the development of new materials and sources of energy, development of new medicines and improved health care, weather forecasting, and for scientific research including the origins of matter and the universe

  • We derive a mathematical model for TM topology under uniform and hotspot traffic patterns to compute the average delay

  • The goal of this paper is to present the mathematical model for TM topology and provide a detailed comparative evaluation between the TM, Torus and Mesh topologies under different traffic patterns

Read more

Summary

Introduction

High-performance computing is needed to solve a variety of well-known problems in many research areas, such as the development of new materials and sources of energy, development of new medicines and improved health care, weather forecasting, and for scientific research including the origins of matter and the universe. Interest has increased in the interconnection network as an essential component, so it is important to have a better conception of its performance. In such computers, with millions of nodes, the performance of the entire system is determined by the main interconnection network [6]. As the routing decision is significant to the performance of an interconnection network, the routing decision process must be as fast as possible to reduce network delay. TM topology is validated mathematically with considering the deterministic routing algorithm in a different simulation environment. The accuracy of the proposed mathematical model for TM topology is proved by the simulation results

TM topology
Deadlock avoidance scheme
Mathematical model
Assumptions
Model derivation
Performance evaluation
Mathematical results
Simulation results
Findings
Conclusion

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 call

Disclaimer: 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.