Adaptive routing method without dead lock in three-dimensional torus network

An adaptive, deadlock-free technology that can be used in data exchange networks, digital transmission systems, electrical components, etc., and can solve problems such as increased difficulty in methods

Inactive Publication Date: 2008-12-31
TSINGHUA UNIV
View PDF0 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, the number of virtual channels required to avoid deadlock becomes an important factor affecting the resource utilization efficiency of the routing method. Using fewer virtual channels can allocate more resources t

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Adaptive routing method without dead lock in three-dimensional torus network
  • Adaptive routing method without dead lock in three-dimensional torus network
  • Adaptive routing method without dead lock in three-dimensional torus network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0086] A physical network can be divided into several virtual subnets. Messages inserted into the network are restricted to routing within a certain virtual subnet. As long as there is no deadlock in each virtual subnet and there is no deadlock between virtual subnets, it can be guaranteed that there will be no deadlock in the entire network. The partitioning method proposed in this paper is mainly aimed at three-dimensional torus networks, and this method can also be extended to higher-dimensional networks.

[0087] The three-dimensional torus network is divided into the following eight virtual subnets: x+y+z+, x+y+z-, x+y-z+, x+y-z-, x-y+z+, x-y+z- , x-y-z+, x-y-z-, x+, x- means the route in the positive and negative directions on the x-axis, the same is true for the y-axis and z-axis;

[0088] Merge the above eight virtual subnets in pairs to obtain the following four virtual subnets: x+y+z * (c 1 +,c 1 +,c 1 ), x+y-z * (c 2 +,c 1 -, c 1 ), x-y * z+(c 1 -, c 2 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a deadlock-free self-adapting routing method of a three-dimensional torus network and belongs to the field of distributed high-performance fault-tolerance computing technology. The method is characterized in that each physical channel is divided into two virtual channels from the middle, and the two virtual channels are both two-way channels distributed into four virtual subnets of the three-dimensional torus network; some virtual channels are allowed to be shared among different subnets. Turning models are used so as to avoid possible deadlocks in and among the subnets and achieve higher self-adoption. Compared with the traditional Duato protocol and GOAL method, the method of the invention can significantly improve the practical network traffic and reduce transmission delay so as to improve the transmission performance of the entire network when the standardized input load and fault node quantity in the network increase.

Description

technical field [0001] The deadlock-free adaptive routing method in the three-dimensional torus network belongs to the technical field of distributed high-performance fault-tolerant computing. Background technique [0002] In today's experimental and commercial multi-computer systems, torus network is a widely used topology. The k-element n-dimensional torus network refers to an n-dimensional grid structure, with k nodes in each dimension, in which every two adjacent nodes are connected by physical channels, and there is a boundary between two boundary nodes in each dimension Channel Unicom. The performance of a multicomputer system depends to the greatest extent on the performance of the point-to-point communication methods in the system. Therefore, it is necessary to propose some high-performance routing methods applied to torus network. [0003] For the adaptive fault-tolerant routing method, it is usually necessary to divide each physical channel into a certain number...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/56H04L29/06H04L45/18
Inventor 向东陈振王琦
Owner TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap