Font Size: a A A

2D-MESH Non-virtual Channel Fault-tolerant Routing Research

Posted on:2019-09-14Degree:MasterType:Thesis
Country:ChinaCandidate:H B ZhangFull Text:PDF
GTID:2438330545490748Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Multi-core processors typically use on-chip networking to provide on-chip communications,and 2D-Mesh is widely used in integrated circuit manufacturing because of its planar structure rules.The performance of the on-chip network is heavily dependent on the efficiency of routing algorithms.Routing algorithm to establish each message or message will be the implementation of the path,the literature can be seen in the routing algorithm is numerous,it is difficult to evaluate all of these different needs for the development of the routing algorithm.Since the routing algorithm for wormhole exchange is also effective for other switching techniques,the FB routing algorithm proposed in this paper is based on the technology of insect hole exchange.Routing algorithms are classified into deterministic routes and adaptive routes by adaptability.Most multicore processors use deterministic routes such as X-Y routing,but X-Y routes are not fault tolerant.A number of adaptive routing algorithms have been proposed,and some adaptive routing algorithms represent a compromise between flexibility and cost.The algorithm achieves the flexibility of fully adaptive routing by increasing the appropriate complexity.Most of the proposed Adaptive routing algorithm relies on ringless correlation between channels to avoid deadlocks.The turn model is proposed by Glass and Ni.It provides a system method for developing the minimum and non-least partial adaptive routing algorithms under given network conditions.The FB routing algorithm proposed in this paper is the turning model.Although the virtual channel can be used to reduce the message delay,improve network throughput,but it will increase the system cost,power consumption,increase the complexity of the system and heat,so the routing algorithm using fewer virtual channels do not even use the virtual channel,Which is of great importance to large-scale multi-computer systems and on-chip network systems.The routing algorithm proposed in this paper does not use any virtual channel under the prerequisite to ensure that the network without deadlock,you can tolerate one or more wrong,and other algorithms similar to the transmission delay,which is a considerable improvement.
Keywords/Search Tags:2D-Mesh, wormhole exchange, fault-tolerant routing, turn model, virtual channel, transmission delay
PDF Full Text Request
Related items