Data transmission method, device and equipment based on GLink bus network and storage medium

Abstract

The invention relates to the technical field of data transmission, and discloses a data transmission method, device and equipment based on a GLink bus network and a storage medium, the GLink bus network is composed of a plurality of GLink nodes, the adjacent GLink nodes are in two-way communication connection, the method is executed by the GLink nodes, and the GLink nodes are in two-way communication connection with the GLink nodes. And if the current node is the target node, the searching of the optimal transmission path is completed. And if the current node is not the target node, searching an adjacent node with the maximum transmission rate from the current node, and sending the ID of the target node to the adjacent node to continuously search the target node until the target node is found and an optimal transmission path is generated. By monitoring the effective transmission rate of the transmission channel between the adjacent nodes and dynamically and reasonably planning the path of data transmission, the data congestion and loss of the whole network can be avoided, the time delay of data transmission is effectively reduced, and the bandwidth utilization rate of the Glink bus is remarkably improved.

Description

Technical Field

[0001] The present invention relates to the technical field of data transmission, and in particular to a data transmission method, device, equipment and storage medium based on a GLink bus network. Background Art

[0002] The existing GLink bus network data transmission system is generally composed of multiple nodes and switching routes, and supports multiple nodes to transmit data simultaneously. In the GLink bus ring network, any two nodes can exchange data through a certain network path. At present, the data transmission of the existing GLink bus network lacks reasonable management of the data transmission path, and generally adopts a designated path to directly realize the data interaction between two nodes. However, when there are multiple nodes working at the same time in the system, using the previous fixed path transmission, when transmitting high-speed, high-capacity data at the same time, the corresponding transmission path rate may not meet the requirements, which will cause the data transmission of the path to be blocked, affecting the transmission efficiency of the entire network, as well as the reliability of the transmission.

[0003] Therefore, there is an urgent need for a method that can dynamically generate the optimal data transmission path in the GLink bus network to solve the problems of network data blocking and loss caused by the fixed path in the existing solution. Summary of the invention

[0004] In view of this, the present application provides a data transmission method, device, equipment and storage medium based on the GLink bus network. By dynamically monitoring the effective transmission rate of each transmission channel in the GLink bus network and dynamically planning the optimal data transmission path between any two nodes, the entire GLink bus network data blocking and loss can be effectively avoided. The technical solution is as follows.

[0005] In a first aspect, the present invention provides a data transmission method based on a GLink bus network. The method is applied to a GLink bus network, which is composed of a plurality of GLink nodes. Each adjacent GLink node is bidirectionally connected to each other. The method is executed by any GLink node and includes the following steps.

[0006] Get the target node ID; When the current node ID is consistent with the target node ID, a data transmission path between the source node and the target node is generated; When the current node ID is inconsistent with the target node ID, the first node is obtained, and the target node ID is sent to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node.

[0007] The data transmission method based on the GLink bus network provided by the present invention has the following advantages: The data transmission method based on the GLink bus network of the present invention is executed by any GLink node in the GLink bus network. When the node completes the optimal adjacent path search, the target node ID is sent to the optimal adjacent node on the optimal adjacent path. Therefore, when searching for the data transmission path, each node on the optimal transmission path will receive the target node ID. Since the method is executed by any GLink node, it is necessary to determine whether the current node is the target node, and it is not necessary to determine whether the current node is the source node. The target node ID received by the source node can be directly sent by the system or directly configured to the source node, and the target node ID of the remaining nodes is sent by the previous node, so there is no essential difference in the way the node receives the target node ID. If the current node is the target node, it indicates that the search for the optimal transmission path has been completed, and the source node is notified to perform data transmission between the source node and the target node according to the transmission path of the target node ID. If the current node is not the target node, the target node ID is transmitted to the first node, which is the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node. After receiving the target node ID, the first node makes another judgment to determine whether the first node is the target node. If so, the search for the optimal transmission path is completed. If not, the search for the target node continues according to the method until the target node is found to generate the optimal transmission path between the source node and the target node. By dividing the optimal transmission path between the source node and the target node into multiple optimal adjacent node transmission path searches, monitoring the effective transmission rate of each adjacent node transmission path, dynamically planning the data transmission path, and finding the optimal data transmission path between the source node and the target node, the entire network data blocking and loss can be effectively avoided, ensuring the stability and reliability of the entire network data transmission. At the same time, the use of a real-time system, without the need for an operating system, driver, and host computer software, can effectively reduce the delay of data transmission; and significantly improve the bandwidth utilization of the Glink bus.

[0008] In an optional implementation, before acquiring the first node, the method further includes: acquiring the first node when the adjacent nodes of the current node do not include the target node ID.

[0009] In an optional embodiment, before obtaining the first node, it also includes: when the adjacent node of the current node includes the target node ID, obtaining the second node, and generating a data transmission path between the source node, the second node and the target node; the second node is an adjacent node among the adjacent nodes of the current node that includes the target node ID.

[0010] The data transmission method based on the GLink bus network provided by the present invention, when the current node is not the target node, determines whether the target node ID is included in the adjacent nodes of the current node. If it is included, it indicates that the adjacent node has found the optimal transmission path between the target node and the adjacent node. At this time, data transmission can be performed according to the transmission path between the source node, the adjacent node and the target node. When the network resources do not fluctuate greatly, it can be ensured that the path at this time is still the optimal data transmission path. If it is not included, it indicates that the adjacent node has not performed the action of searching for the target node, and the search can be continued according to the search method of the target node. Adding such a judgment mechanism can save network resources, and it is not necessary to search for the optimal path every time, thereby avoiding network congestion.

[0011] In an optional implementation, the GLink node includes an FPGA module, a GLink bus chip, and a non-volatile memory, and the FPGA module is communicatively connected to the GLink bus chip and the non-volatile memory, respectively.

[0012] In an optional embodiment, the step of obtaining the first node includes: generating test data through the FPGA module of the current node, and sending the test data to the adjacent nodes of the current node through the GLink bus chip of the current node; obtaining the effective transmission rate between the current node and the adjacent nodes of the current node; and taking the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node as the first node.

[0013] The data transmission method based on the GLink bus network provided by the present invention generates test data through the FPGA module of the GLink node, obtains the effective transmission rate of the adjacent nodes through the test data, and after the adjacent nodes with the maximum transmission rate are obtained to generate the optimal data transmission path, the source node is notified to send valid data.

[0014] In a second aspect, the present invention provides a data transmission device based on a GLink bus network, wherein the GLink bus network is composed of a plurality of GLink nodes, and each adjacent GLink node is bidirectionally connected to each other. The device is executed by the GLink node, and the device comprises: The target node acquisition module is used to obtain the target node ID; A target node confirmation module, used to generate a data transmission path between the source node and the target node when the current node ID is consistent with the target node ID; A target node search module is used to obtain a first node when the current node ID is inconsistent with the target node ID, and send the target node ID to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is an adjacent node with the maximum effective transmission rate between the current node and the adjacent nodes of the current node.

[0015] In an optional implementation, the target node search module is specifically used to: Generate test data through the FPGA module of the current node, and send the test data to the adjacent nodes of the current node through the GLink bus chip of the current node; obtain the effective transmission rate between the current node and the adjacent nodes of the current node; and take the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node as the first node.

[0016] In an optional implementation, the device further includes an adjacent node confirmation module, configured to obtain the first node when the adjacent nodes of the current node do not include the target node ID.

[0017] In an optional embodiment, the adjacent node confirmation module is also used to: when the adjacent nodes of the current node include the target node ID, obtain a second node and generate a data transmission path between the source node, the second node and the target node; the second node is an adjacent node among the adjacent nodes of the current node that includes the target node ID.

[0018] In a third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the data transmission method based on the GLink bus network of the above-mentioned first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0019] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the data transmission method based on the GLink bus network of the above-mentioned first aspect or any corresponding embodiment thereof.

[0020] In a fifth aspect, the present invention provides a computer program product, comprising computer instructions, wherein the computer instructions are used to enable a computer to execute the data transmission method based on the GLink bus network of the above-mentioned first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0022] Figure 1 It is a flow chart of a data transmission method based on a GLink bus network provided by an embodiment of the present invention.

[0023] Figure 2 It is a schematic diagram of a GLink bus ring network hybrid bidirectional ring topology structure according to an exemplary embodiment.

[0024] Figure 3 is a block diagram of the hardware structure of a GLink node according to an exemplary embodiment.

[0025] Figure 4 It is a method flow chart of a data transmission method based on a GLink bus network according to an exemplary embodiment.

[0026] Figure 5 It is a structural schematic diagram of a data transmission device based on a GLink bus network provided in an embodiment of the present application.

[0027] Figure 6 It is a structural schematic diagram of a computer device provided by an optional embodiment of the present invention. DETAILED DESCRIPTION

[0028] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without making creative work are within the scope of protection of this application.

[0029] It should be understood that the "indication" mentioned in the embodiments of the present application can be a direct indication, an indirect indication, or an indication of an association relationship. For example, A indicates B, which can mean that A directly indicates B, for example, B can be obtained through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can be obtained through C; it can also mean that there is an association relationship between A and B.

[0030] In the description of the embodiments of the present application, the term "corresponding" may indicate a direct or indirect correspondence between two items, or an association relationship between the two items, or a relationship between indication and being indicated, configuration and being configured, and the like.

[0031] In an embodiment of the present application, "predefinition" may be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including a terminal device and a network device). The present application does not limit its specific implementation method.

[0032] The existing GLink bus data transmission system uses optical fiber for data transmission, with a transmission rate of up to 5Gb / s. It is generally composed of multiple GLink nodes and switching routes. Therefore, the GLink bus ring network supports multiple nodes to transmit data at the same time, and uses the GLink bus to transmit high-speed and large-capacity data, which can better play the advantages of the GLink bus protocol. In the GLink bus ring network, any two nodes can interact with each other through a certain network path. At present, the general method of specifying a path is to directly realize the data interaction between two nodes. Therefore, the entire Glink bus data transmission system does not reasonably manage the data transmission path; when there are multiple nodes working at the same time in the system, the previous fixed path transmission is used. When transmitting high-speed and high-capacity data at the same time, the corresponding transmission path rate may not meet the requirements, which will cause the data transmission of the path to be blocked, affecting the transmission efficiency of the entire network and the reliability of transmission.

[0033] Therefore, an embodiment of the present invention provides a data transmission method based on a GLink bus network, which divides the optimal transmission path between the source node and the target node into multiple optimal adjacent node transmission paths, monitors the effective transmission rate of each adjacent node transmission path, and dynamically plans the data transmission path to find the optimal data transmission path between the source node and the target node. This can effectively avoid data congestion and loss in the entire network and ensure the stability and reliability of data transmission in the entire network.

[0034] The data transmission method based on the GLink bus network provided by the embodiment of the present invention is applied to the GLink bus network, where the GLink bus network is composed of a plurality of GLink nodes, and each adjacent GLink node is bidirectionally connected to each other. The method is executed by any GLink node, such as Figure 1 As shown, the following steps are included.

[0035] S101. Obtain target node ID.

[0036] Specifically, in step S101, the method is executed by any GLink node, and it can be seen that the source node and the remaining nodes have different ways of obtaining the target node ID. Since the source node does not have a previous node, the target node ID can be directly sent to the source node through the system or directly written into the configuration file of the source node. All nodes except the source node can obtain the target node ID from the previous node.

[0037] Optionally, in step S101, the GLink node includes an FPGA module, a GLink bus chip and a non-volatile memory, and the FPGA module is communicatively connected to the GLink bus chip and the non-volatile memory respectively.

[0038] S102: When the current node ID is consistent with the target node ID, generate a data transmission path between the source node and the target node.

[0039] Specifically, in step S102, after the current node receives the target node ID, it compares the target node ID with its own ID. If the current node ID is consistent with the acquired target node ID, it indicates that the search for the target node has been completed. At this time, the source node can be notified to transmit valid data according to the transmission path of the target node ID.

[0040] S103. When the current node ID is inconsistent with the target node ID, obtain the first node and send the target node ID to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is the adjacent node with the maximum effective transmission rate between the current node and the adjacent nodes of the current node.

[0041] Specifically, in step S103, if the current node ID is inconsistent with the target node ID, it indicates that the target node has not been found and needs to be searched further. At this time, the target node ID is transmitted to the first node, which is the adjacent node with the highest effective transmission rate between the current node and the adjacent nodes of the current node. After the first node receives the target node ID, it repeats steps S101 to S103 until the target node is found. After the target node is found, the source node is notified to perform data transmission of effective data according to the transmission path of the target node ID.

[0042] Optionally, in step S103, before obtaining the first node, it is also necessary to determine whether the neighboring nodes of the current node include the target node ID. If not, it indicates that the neighboring nodes of the current node have not been searched, and the first node is obtained and the search for the target node continues. If it is included, it indicates that the neighboring nodes of the current node have been searched, and the second node is obtained, and a data transmission path between the source node, the second node and the target node is generated; the second node is an adjacent node among the neighboring nodes of the current node that includes the target node ID.

[0043] It should be noted that before obtaining the first node, the reason why it is necessary to determine whether the neighboring nodes of the current node contain the target node ID is that if it does, it means that the neighboring node has found the optimal transmission path between the target node and the source node, and at this time, data can be transmitted according to the transmission path between the source node, the neighboring node and the target node. When there is no large fluctuation in network resources, it can ensure that the path at this time is still the optimal data transmission path. If it does not contain it, it means that the neighboring node has not searched for the target node, and it can continue to search according to the search method for the target node. Adding such a judgment mechanism can save network resources, and it is not necessary to search for the optimal path every time, avoiding network congestion.

[0044] Optionally, in step S203, the step of taking the first node includes: generating test data through the FPGA module of the current node, and sending the test data to the adjacent nodes of the current node through the GLink bus chip of the current node; obtaining the effective transmission rate between the current node and the adjacent nodes of the current node; and taking the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node as the first node. Generate test data through the FPGA module of the GLink node, obtain the effective transmission rate of the adjacent nodes through the test data, and after obtaining the adjacent node with the maximum transmission rate to generate the optimal data transmission path, notify the source node to send valid data.

[0045] In summary, the data transmission method based on the GLink bus network provided by the embodiment of the present invention is executed by any GLink node in the GLink bus network. When the node completes the optimal adjacent path search, the target node ID will be sent to the optimal adjacent node on the optimal adjacent path. Therefore, when searching for the data transmission path, each node on the optimal transmission path will receive the target node ID. Since the method is executed by any GLink node, it is necessary to determine whether the current node is the target node, and it is not necessary to determine whether the current node is the source node. The target node ID received by the source node can be sent directly by the system or directly configured to the source node, and the target node ID of the remaining nodes is sent by the previous node, so there is no essential difference in the way the node receives the target node ID. If the current node is the target node, it indicates that the search for the optimal transmission path has been completed, and the source node is notified to perform data transmission between the source node and the target node according to the transmission path of the target node ID. If the current node is not the target node, the target node ID is transmitted to the first node, which is the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node. After receiving the target node ID, the first node makes another judgment to determine whether the first node is the target node. If so, the search for the optimal transmission path is completed. If not, the search for the target node continues according to the method until the target node is found to generate the optimal transmission path between the source node and the target node. By dividing the optimal transmission path between the source node and the target node into multiple optimal adjacent node transmission path searches, monitoring the effective transmission rate of each adjacent node transmission path, dynamically planning the data transmission path, and finding the optimal data transmission path between the source node and the target node, the entire network data blocking and loss can be effectively avoided, ensuring the stability and reliability of the entire network data transmission. At the same time, the use of a real-time system, without the need for an operating system, driver, and host computer software, can effectively reduce the delay of data transmission; and significantly improve the bandwidth utilization of the Glink bus.

[0046] Based on the above embodiments, an example is used below to illustrate the data transmission method based on the GLink bus network provided by the embodiment of the present invention. The GLink bus network of this example adopts Figure 2 The GLink bus ring network hybrid bidirectional ring topology network structure shown in the figure is composed of multiple LOOP loops, and each LOOP loop is composed of multiple GLink nodes and switching routes. The hardware framework of each GLink node is as follows Figure 3 As shown, it includes an FPGA module, a JLK1263 chip (GLink bus chip), DDR3 and FLASH. The FPGA module is respectively connected to the JLK1263 chip and the DDR3 and FLASH are communicated with each other.

[0047] Among them, the FPGA module is used as the main control chip to configure the peripheral circuit, which is used to forward data, control the memory, and find the best data transmission path; it communicates with the data acquisition device and the data playback device through a high-speed interface. The data acquisition device can use ADC chips and image acquisition devices; it is used to collect the original data to be transmitted and transmit it to the FPGA module through various high-speed interfaces, such as video image interface (including but not limited to HDMI / VGA / Cameralink / SDI / DP), optical fiber, and JESD204B. The data playback device can use DAC chips and video displays; the GLink bus data received by the FPGA is output to the playback device through a high-speed interface. The JLK1263 chip is used to convert the collected data into GLink protocol data, which is sent and received through optical fiber; and the effective rate of optical fiber data is monitored, and the transmission and reception of high-speed serial data is realized through the SerDes (Serializer / Deserializer) interface. The FPGA module and the JLK1263 chip are connected through the EMIF (External Memory Interface) interface and the FIFO (First In, First Out) interface. The control interface is used to configure the source node ID and the target node ID, and configure other parameters to enable the node to work properly; the JTAG interface is used for debugging the FPGA module and downloading programs; DDR3 is used to cache transmitted data; and FLASH is used to store the startup file loaded when the FPGA is powered on.

[0048] Based on the above GLink bus ring network hybrid bidirectional ring topology network and the hardware framework of the GLink node, the data transmission method based on the GLink bus network of this example is as follows: Figure 4 As shown, the optimal data transmission path between the source node and the target node is found, starting from the source node, and includes the following steps.

[0049] Configure the basic parameters of the source node and the ID of the target node to make the source node work properly. Generate test data inside the FPGA module of the source node and send the test data to the adjacent nodes through the JLK1263 chip; read the JLK1263 chip register to obtain the effective transmission rate of each adjacent node, and compare whether the adjacent node contains the ID of the target node.

[0050] If the adjacent node contains the target node ID, it means that the target node has been found and the search for the optimal data transmission path has been completed. If the adjacent node does not contain the target node ID, compare the effective transmission rates of each adjacent node, select the path with the highest rate, and send the target node ID to the node. Determine whether the node ID is consistent with the target node ID. If they are consistent, it means that the target node has been found, and the source node is notified to send valid data; otherwise, continue to search for the target node and the corresponding optimal data transmission path.

[0051] When the target node is found, the source node can be notified to send valid data to the target node for data transmission and start the timer. At this time, it is necessary to dynamically monitor the rate of the entire network at regular intervals (set to 10 milliseconds in this example) to determine whether the path is still the optimal path. During the data transmission process, it is determined whether the data has been sent. If the data has been sent, the sending is terminated.

[0052] by Figure 2 For example, when node 1 of loop 1 sends data to node 1 of loop 2, the existing method is to directly specify node 1 of loop 1 → node 5 of loop 1 → node 4 of loop 1 (node ​​4 of loop 2) → node 1 of loop 2; or specify other paths. However, the transmission efficiency and rate of the entire path cannot be controlled, which may lead to data blocking and loss.

[0053] According to the method of this example, node 1 of loop 1 first sends test data to node 5 of loop 1 and node 2 of loop 1 at the same time, and obtains the effective rate of the two paths, and selects the path with the larger rate. If it is node 2 of loop 1, the node will receive the target node information, that is, node 1 of loop 2. The two are not the same ID, and continue to search down, and so on, until node 1 of loop 2 is found. For other GLink network topology diagrams, this method can also be used to find the optimal data transmission path in the network to ensure the stability and reliability of data transmission in the entire network.

[0054] To summarize, the data transmission method based on the GLink bus network provided in this example divides the optimal transmission path between the source node and the target node into multiple optimal adjacent node transmission paths, monitors the effective transmission rate of each adjacent node transmission path, and dynamically plans the data transmission path to find the optimal data transmission path between the source node and the target node. This can effectively avoid data congestion and loss in the entire network and ensure the stability and reliability of data transmission in the entire network.

[0055] On the basis of the above-mentioned embodiments, a data transmission device based on a GLink bus network is also provided in the embodiments of the present application, and the device is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0056] The present application embodiment provides a data transmission device based on a GLink bus network. Figure 5 : is a structural diagram of a data transmission device based on a GLink bus network provided in an embodiment of the present application, the device comprising: The target node acquisition module 501 is used to acquire the target node ID.

[0057] The target node confirmation module 502 is used to generate a data transmission path between the source node and the target node when the current node ID is consistent with the target node ID.

[0058] The target node search module 503 is used to obtain the first node when the current node ID is inconsistent with the target node ID, and send the target node ID to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node.

[0059] In an optional implementation, the target node search module 503 is specifically configured to: Generate test data through the FPGA module of the current node, and send the test data to the adjacent nodes of the current node through the GLink bus chip of the current node; obtain the effective transmission rate between the current node and the adjacent nodes of the current node; and take the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node as the first node.

[0060] In an optional embodiment, the device further comprises: The adjacent node confirmation module 504 is used to obtain the first node when the adjacent nodes of the current node do not include the target node ID.

[0061] In an optional implementation manner, the neighbor node confirmation module 504 is further configured to: When the neighboring nodes of the current node include the target node ID, a second node is acquired, and a data transmission path is generated between the source node, the second node and the target node; the second node is an adjacent node among the neighboring nodes of the current node that includes the target node ID.

[0062] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0063] The data transmission device based on the GLink bus network in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0064] The embodiment of the present invention also provides a computer device having the above Figure 5 The data transmission device based on the GLink bus network is shown.

[0065] See also Figure 6 , Figure 6 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Figure 6 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the computer device, including instructions stored in or on the memory to display graphic information in a graphical user interface on an external input / output device (such as a display device coupled to an interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 6 A processor 10 is taken as an example.

[0066] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0067] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0068] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0069] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0070] The computer device also includes an input device 30 and an output device 40. The processor 10, the memory 20, the input device 30 and the output device 40 may be connected via a bus or other means. Figure 6 The example of connecting through bus is taken in the following.

[0071] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0072] A part of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the existence of the computer program instruction in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc., and accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium accessible to the computer.

[0073] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A data transmission method based on a GLink bus network, characterized in that: The GLink bus network is composed of a plurality of GLink nodes, and each adjacent GLink node is bidirectionally connected to each other. The method is executed by the GLink node and includes: Get the target node ID; When the current node ID is consistent with the target node ID, a data transmission path between the source node and the target node is generated; When the current node ID is inconsistent with the target node ID, the first node is obtained, and the target node ID is sent to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is the adjacent node with the largest effective transmission rate between the current node and the adjacent nodes of the current node.

2. The method according to claim 1, characterized in that Before obtaining the first node, the method further includes: When the adjacent nodes of the current node do not include the target node ID, the first node is acquired.

3. The method according to claim 2, characterized in that Before obtaining the first node, the method further includes: When the neighboring nodes of the current node include the target node ID, a second node is acquired, and a data transmission path is generated between the source node, the second node and the target node; the second node is an adjacent node among the neighboring nodes of the current node that includes the target node ID.

4. The method according to claim 1, characterized in that: The GLink node includes an FPGA module, a GLink bus chip and a non-volatile memory, and the FPGA module is communicatively connected with the GLink bus chip and the non-volatile memory respectively.

5. The method according to claim 4, characterized in that The obtaining of the first node comprises: Generate test data through the FPGA module of the current node, and send the test data to the adjacent nodes of the current node through the GLink bus chip of the current node; Acquire an effective transmission rate between the current node and an adjacent node of the current node; The adjacent node with the largest effective transmission rate between the current node and the adjacent node of the current node is taken as the first node.

6. A data transmission device based on a GLink bus network, characterized in that: The GLink bus network is composed of a plurality of GLink nodes, each adjacent GLink node is bidirectionally connected to each other, and the device is executed by the GLink node, and the device includes: The target node acquisition module is used to obtain the target node ID; A target node confirmation module, used to generate a data transmission path between the source node and the target node when the current node ID is consistent with the target node ID; A target node search module is used to obtain a first node when the current node ID is inconsistent with the target node ID, and send the target node ID to the first node, so that the first node continues to search for the target node until a data transmission path between the source node and the target node is generated; the first node is an adjacent node with the maximum effective transmission rate between the current node and the adjacent nodes of the current node.

7. The data transmission device based on the GLink bus network according to claim 6, characterized in that: The device also includes: The adjacent node confirmation module is used to obtain the first node when the adjacent nodes of the current node do not include the target node ID.

8. The data transmission device based on the GLink bus network according to claim 7, characterized in that: The adjacent node confirmation module is further used for: When the neighboring node of the current node includes the target node ID, acquiring a second node, and generating a data transmission path between the source node, the second node and the target node; The second node is an adjacent node of the current node that contains the target node ID.

9. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the data transmission method based on the GLink bus network according to any one of claims 1 to 5 by executing the computer instructions.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the data transmission method based on the GLink bus network described in any one of claims 1 to 5.

Images