CN102984084B - Data transmission method and system between computer cluster interior joint - Google Patents
Data transmission method and system between computer cluster interior joint Download PDFInfo
- Publication number
- CN102984084B CN102984084B CN201210475396.6A CN201210475396A CN102984084B CN 102984084 B CN102984084 B CN 102984084B CN 201210475396 A CN201210475396 A CN 201210475396A CN 102984084 B CN102984084 B CN 102984084B
- Authority
- CN
- China
- Prior art keywords
- data transmission
- node
- data
- order
- sends
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 138
- 238000000034 method Methods 0.000 title claims abstract description 103
- 230000009471 action Effects 0.000 claims abstract description 55
- 238000004891 communication Methods 0.000 claims abstract description 23
- 230000006870 function Effects 0.000 description 13
- 230000008569 process Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 230000008901 benefit Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention discloses data transmission method and system between a kind of computer cluster interior joint.Wherein data transmission system includes N number of node, and the data transmission procedure of described N number of node is divided into N-1 to take turns, N >=2；Wherein, each node includes: transmitting element, for taking turns in data transmission procedure each, performs a sending action, and described sending action is specially and sends data according to the data transmission order of self；Described data transmission order randomly chooses, and described data transmission order is to receive node the putting in order according to round of the data that this node sends in data transmission procedure；Receive unit, arrive first, for basis, the mode first received and receive data；Wherein, described transmitting element is specifically for adopting non-block communication method to perform sending action.Between computer cluster interior joint provided by the invention, data transmission method and system are by data distributed transmission, it is ensured that the network interface card of each node can utilize maximum transmission bandwidth to work comparatively fully.
Description
Technical field
The present invention relates to communication technical field, be specifically related to data transmission method and system between a kind of computer cluster interior joint.
Background technology
Beowulf (Beowulf) cluster is a kind of high performance parallel computer cluster topology, it is the multiple processor system of the loose coupling built by the computer system of one group of independence, in system, each process is by real-time performance communication, shared drive transmission information, thus realizing Distributed Parallel Computing.The design object of Beowulf cluster is the supercomputer system making the department of computer science of general university and small research mechanism have the ability to set up oneself, per second runs 1,000,000,000 instructions.Beowulf Clustering addresses how the problem by using common computer to reach high-performance, high real-time computing system.In recent years, Beowulf group system develops rapidly, the process performance being primarily due to the workstation system as clustered node is more and more stronger, processor and more efficient multi-CPU machine come into the market in a large number faster, and the introducing of LAN new technique and new agreement, communication between clustered node can obtain higher bandwidth and less delay, and group system is easier to be fused in existing network system than traditional parallel computer.At present, the developing instrument of group system is ripe day by day, and its price is also further cheap and is prone to build.It addition, the extensibility of group system is good, the performance of node is also easily via increasing internal memory or improving processor performance acquisition raising.
Messaging interface (MessagePassingInterface, MPI) is a kind of program message passing interface, it provides the multilingual collection of functions realizing one series interfaces.MPI is message passing mechanism conventional on Beowulf cluster, and concurrent program is frequently used MPI to carry out transmission and the reception of data.MPI standard defines one group of function, makes application program from a MPI process, message can be delivered to another MPI process.
In Beowulf group system, when using MPI to carry out data transmission between N number of node (such as computer), generally adopt sequentially mode.Specifically, first give each node numbered successively, from 0, until N-1.Fig. 1 a illustrates that the 1st of prior art takes turns the schematic diagram of data transmission procedure, and Fig. 1 b illustrates that the 1st of prior art is taken turns the schematic diagram of DRP data reception process, Fig. 1 a and Fig. 1 b and illustrated the situation of 6 nodes.As illustrated in figs. ia and ib, take turns in data transmission procedure the 1st, other node except node 0 all uses MPI to send (MPI_Send) function and sends data to node 0, and now node 0 uses MPI to receive (MPI_Recv) function in a Do statement and receives the data sended over from node 1 to N-1 successively.Taking turns in data transmission procedure the 2nd, other node except node 1 all uses MPI_Send function to send data to node 1, and now node 1 uses MPI_Recv function to receive successively from node 0,2 to the N-1 data sended in a Do statement.The like, after terminating until N wheel data transmission procedure, all nodes all obtain the data that other nodes send over, and whole data transmission procedure completes.
The data transmission method of above-mentioned employing sequentially mode has a disadvantage in that under normal conditions, and in group system, the network interface card of all nodes is all isomorphism, so their maximum transmission bandwidth is identical.Owing to taking turns in data transmission procedure each, all nodes all can send data to same node, and when the bandwidth of receiving node being made, the bandwidth of all sending nodes is useless full, so causes the waste of overall transfer bandwidth.
Summary of the invention
In view of the above problems, it is proposed that the present invention in case provide a kind of overcome the problems referred to above or solve the computer cluster interior joint of the problems referred to above at least in part between data transmission method between data transmission system and corresponding computer cluster interior joint.
According to an aspect of the invention, it is provided data transmission method between a kind of computer cluster interior joint, including:
It is divided into N-1 to take turns the data transmission procedure of N number of node, N >=2；
For each node, randomly choosing the data transmission order of this node, described data transmission order is to receive node the putting in order according to round of the data that this node sends in data transmission procedure；
Taking turns in data transmission procedure each, each node is carried out a sending action, and the node performing sending action sends data according to the data transmission order of self；The node performing reception action receives data according to arriving first the mode first received；
Wherein, described sending action adopts non-block communication method to perform.
According to a further aspect in the invention, it is provided that data transmission system between a kind of computer cluster interior joint, including N number of node, the data transmission procedure of described N number of node is divided into N-1 to take turns, N >=2；
Wherein, each node includes:
Transmitting element, for taking turns in data transmission procedure each, performs a sending action, and described sending action is specially and sends data according to the data transmission order of self；Described data transmission order randomly chooses, and described data transmission order is to receive node the putting in order according to round of the data that this node sends in data transmission procedure；
Receive unit, arrive first, for basis, the mode first received and receive data；
Wherein, described transmitting element is specifically for adopting non-block communication method to perform sending action.
According to data transmission method and system between computer cluster interior joint provided by the invention, take turns in data transmission procedure each, the data transmission order that the node of execution sending action randomly chooses according to self sends data, the probability so simultaneously mailing to same node greatly reduces, few situation occurring that a node receives the data that every other node sends simultaneously, by data distributed transmission, it is ensured that the network interface card of each node can utilize maximum transmission bandwidth to work comparatively fully.The node performing reception action receives data according to arriving first the mode first received, it is achieved that undelayed data receiver.
Described above is only the general introduction of technical solution of the present invention, in order to better understand the technological means of the present invention, and can be practiced according to the content of description, and in order to above and other objects of the present invention, feature and advantage can be become apparent, below especially exemplified by the specific embodiment of the present invention.
Accompanying drawing explanation
By reading hereafter detailed description of the preferred embodiment, various other advantage and benefit those of ordinary skill in the art be will be clear from understanding.Accompanying drawing is only for illustrating the purpose of preferred implementation, and is not considered as limitation of the present invention.And in whole accompanying drawing, it is denoted by the same reference numerals identical parts.In the accompanying drawings:
Fig. 1 a illustrates that the 1st of prior art takes turns the schematic diagram of data transmission procedure；
Fig. 1 b illustrates that the 1st of prior art takes turns the schematic diagram of DRP data reception process；
Fig. 2 illustrates the flow chart of data transmission method between computer cluster interior joint according to an embodiment of the invention；
Fig. 3 a illustrates in the embodiment of the present invention that the 1st takes turns the schematic diagram of data transmission procedure；
Fig. 3 b illustrates in the embodiment of the present invention that the 1st takes turns the schematic diagram of DRP data reception process；
Fig. 4 illustrates the structural representation of data transmission system between computer cluster interior joint according to an embodiment of the invention.
Detailed description of the invention
It is more fully described the exemplary embodiment of the disclosure below with reference to accompanying drawings.Although accompanying drawing showing the exemplary embodiment of the disclosure, it being understood, however, that may be realized in various forms the disclosure and should do not limited by embodiments set forth here.On the contrary, it is provided that these embodiments are able to be best understood from the disclosure, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
Sequentially mode is adopted to adopt minute wheel to receive and dispatch model at random the difference is that the data transmission method of, the present invention with the data transmission method of prior art.The group system of the present invention includes N number of node, N >=2, then the data transmission procedure of this N number of node is divided into N-1 wheel.Fig. 2 illustrates the flow chart of data transmission method according to an embodiment of the invention.As in figure 2 it is shown, data transmission method comprises the steps: between this computer cluster interior joint
Step 101, for each node in N number of node, randomly choose the data transmission order of this node.
This data transmission order refers in data transmission procedure, receives node the putting in order according to round of the data that this node sends.This data transmission order defines node and takes turns data transmission procedure sends data to which node each.The data transmission order of each node randomly chooses, once select this data transmission order, in the data transmission procedure of N-1 wheel, each node sends data according to corresponding data transmission order to appointment node.
If N is 6, giving these 6 nodes numbered respectively is 0,1,2,3,4,5.For each node therein, randomly choose the data transmission order of correspondence.Table 1 illustrates as the data transmission order that each node randomly chooses.
Table 1. node and the data transmission corresponding table of order
As it can be seen from table 1 data transmission order defines each node takes turns data transmission procedure sends data to which node each.For node 0, take turns in data transmission procedure the 1st, send data to node 3；Take turns in data transmission procedure the 2nd, send data to node 5；Take turns in data transmission procedure the 3rd, send data to node 4；Take turns in data transmission procedure the 4th, send data to node 2；Take turns in data transmission procedure the 5th, send data to node 1.For other node, each, table 1 all shows takes turns data transmission procedure should send data to which node.
Step 102, taking turns in data transmission procedure each, each node is carried out a sending action, and the node performing sending action sends data according to the data transmission order of self；The node performing reception action receives data according to arriving first the mode first received.
For the data transmission order shown in above-mentioned table 1, Fig. 3 a illustrates in the embodiment of the present invention that the 1st takes turns the schematic diagram of data transmission procedure, and Fig. 3 b illustrates in the embodiment of the present invention that the 1st takes turns the schematic diagram of DRP data reception process.Taking turns in data transmission procedure the 1st, each node is carried out a sending action, and node 0 sends data to node 3, node 1 sends data to node 2, and node 2 sends data to node 0, and node 3 sends data to node 2, node 4 sends data to node 1, and node 5 sends data to node 4.The node performing reception action receives data according to arriving first the mode first received, and all Exactly-once reception actions of its interior joint 0, node 1, node 2 and node 4, node 2 performs twice reception action.For node 2, if the data of node 1 arrive first just first receive, wait until node 3 data to after receive again；If the data of node 3 arrive first just first receive, wait until node 1 data to after receive again, so can realize undelayed reception.
General data communications method is divided into block type and non-block type.For sending action, under obstruction mode, sending node after sending data, can wait the data acknowledgment message of receiving node feedback always, just can perform other actions after receiving this data acknowledgment message；And under non-blocking fashion, sending node does not wait for the data acknowledgment message of receiving node feedback after sending data, will go to perform other actions.
Based on the Principle of Communication of above two communication mode, as the preferred embodiment of the present invention, sending action adopts non-block communication method to perform.This is in order to avoid at a kind of Deadlock in particular cases.These special circumstances particularly as follows:
Taking turns in data transmission procedure a certain, node A to send data to node B, and node B also to send data to node A.If sending action adopts block communication method, after node A sends data to node B, before these data do not arrive node B, node B also have sent data to node A, so node A can wait that the node B data acknowledgment message fed back does not go the receiving node B data sent always, node B also can wait that the node A data acknowledgment message fed back does not go the receiving node A data sent always, thus will produce Deadlock.
In the present embodiment, sending action adopts non-block communication method to perform, it is possible to avoid the above-mentioned Deadlock in particular cases produced.For reception action, arrive first, owing to adopting, the mode first received, do not have above-mentioned special circumstances, so reception action both can adopt block communication method to perform, it would however also be possible to employ non-block communication method performs.Owing to block communication method is compared to non-block communication method, it is achieved more simple, it is simple to control, it is preferable that the reception action of the present embodiment adopts block communication method to perform.
The data transmission method that above-described embodiment provides may be used in Beowulf group system, and namely above-mentioned N number of node belongs to Beowulf group system.In Beowulf group system, when sending data, do not send successively according still further to node serial number, but adopt the mode that the data transmission randomly choosed order selects receiving node to be transmitted, sending action adopts the MPI of non-block type to send function and realizes, for instance MPI_Isend function.When receiving data, from existing according to node serial number strictly successively receive data different, adopt and arrive first the mode first received, the i.e. working method of MPI_ANY_SOURCE, for certain receiving node, the data of which sending node first arrive, and this receiving node just receives the data of this sending node, it is achieved without postponing to receive.Reception action adopts the MPI receiver function of block type to realize, for instance MPI_Recv function.Here it is the minute wheel described in the present invention receives and dispatches model at random.
According to the data transmission method that the present embodiment provides, take turns in data transmission procedure each, the data transmission order that the node of execution sending action randomly chooses according to self sends data, the probability so simultaneously mailing to same node greatly reduces, few situation occurring that a node receives the data that every other node sends simultaneously, by data distributed transmission, it is ensured that the network interface card of each node can utilize maximum transmission bandwidth to work comparatively fully.The node performing reception action receives data according to arriving first the mode first received, it is achieved that undelayed data receiver.
Fig. 4 illustrates the structural representation of data transmission system between computer cluster interior joint according to an embodiment of the invention.This data transmission system includes N number of node, and the data transmission procedure of this N number of node is divided into N-1 to take turns, wherein N >=2.Two node A that Fig. 4 only show between this computer cluster interior joint in data transmission system and node B.
As shown in Figure 4, node A includes: the first transmitting element 40 and first receives unit 41, and the first transmitting element 40, for taking turns in data transmission procedure each, performs a sending action, and sending action is specially and sends data according to the data transmission order of self；Data transmission order randomly chooses, and data transmission order is to receive node the putting in order according to round of this node A data sent in data transmission procedure；First reception unit 41 arrives first, for basis, the mode first received and receives data.
Node B includes: the second transmitting element 42 and second receives unit 43, and the second transmitting element 42, for taking turns in data transmission procedure each, performs a sending action, and sending action is specially and sends data according to the data transmission order of self；Data transmission order randomly chooses, and data transmission order is to receive node the putting in order according to round of this node B data sent in data transmission procedure；Second reception unit 43 arrives first, for basis, the mode first received and receives data.
Taking turns in data transmission procedure a certain shown in Fig. 4, first transmitting element 40 of node A receives unit 43 to the second of node B and sends data, and second transmitting element 42 of node B receives unit 41 to the first of node A and sends data.
Preferably, above-mentioned first transmitting element 40 and the second transmitting element 42 are specifically for adopting non-block communication method to perform sending action.Above-mentioned first receives unit 41 and second receives unit 43 specifically for adopting block communication method to perform reception action.
The data transmission system that the present embodiment provides can be Beowulf group system.In Beowulf group system, the first transmitting element 40 and the second transmitting element 42 are specifically for adopting the MPI of non-block type to send function to realize sending action.First receives unit 41 and second receives unit 43 specifically for adopting the MPI receiver function of block type to realize reception action.
According to the data transmission system that the present embodiment provides, take turns in data transmission procedure each, the data transmission order that the node of execution sending action randomly chooses according to self sends data, the probability so simultaneously mailing to same node greatly reduces, few situation occurring that a node receives the data that every other node sends simultaneously, by data distributed transmission, it is ensured that the network interface card of each node can utilize maximum transmission bandwidth to work comparatively fully.The node performing reception action receives data according to arriving first the mode first received, it is achieved that undelayed data receiver.
Not intrinsic to any certain computer, virtual system or miscellaneous equipment relevant in algorithm and the display of this offer.Various general-purpose systems can also with use based on together with this teaching.As described above, the structure constructed required by this kind of system is apparent from.Additionally, the present invention is also not for any certain programmed language.It is understood that, it is possible to utilize various programming language to realize the content of invention described herein, and the description above language-specific done is the preferred forms in order to disclose the present invention.
In description mentioned herein, describe a large amount of detail.It is to be appreciated, however, that embodiments of the invention can be put into practice when not having these details.In some instances, known method, structure and technology it are not shown specifically, in order to do not obscure the understanding of this description.
Similarly, it is to be understood that, one or more in order to what simplify that the disclosure helping understands in each inventive aspect, herein above in the description of the exemplary embodiment of the present invention, each feature of the present invention is grouped together in single embodiment, figure or descriptions thereof sometimes.But, the method for the disclosure should be construed to and reflect an intention that namely the present invention for required protection requires feature more more than the feature being expressly recited in each claim.More precisely, as the following claims reflect, inventive aspect is in that all features less than single embodiment disclosed above.Therefore, it then follows claims of detailed description of the invention are thus expressly incorporated in this detailed description of the invention, wherein each claim itself as the independent embodiment of the present invention.
Those skilled in the art are appreciated that, it is possible to carry out the module in the equipment in embodiment adaptively changing and they being arranged in one or more equipment different from this embodiment.Module in embodiment or unit or assembly can be combined into a module or unit or assembly, and multiple submodule or subelement or sub-component can be put them in addition.Except at least some in such feature and/or process or unit excludes each other, it is possible to adopt any combination that all processes or the unit of all features disclosed in this specification (including adjoint claim, summary and accompanying drawing) and so disclosed any method or equipment are combined.Unless expressly stated otherwise, each feature disclosed in this specification (including adjoint claim, summary and accompanying drawing) can be replaced by the alternative features providing purpose identical, equivalent or similar.
In addition, those skilled in the art it will be appreciated that, although embodiments more described herein include some feature included in other embodiments rather than further feature, but the combination of the feature of different embodiment means to be within the scope of the present invention and form different embodiments.Such as, in the following claims, the one of any of embodiment required for protection can mode use in any combination.
The all parts embodiment of the present invention can realize with hardware, or realizes with the software module run on one or more processor, or realizes with their combination.It will be understood by those of skill in the art that the some or all functions of the some or all parts that microprocessor or digital signal processor (DSP) can be used in practice to realize between computer cluster interior joint according to embodiments of the present invention in data transmission system.The present invention is also implemented as part or all the equipment for performing method as described herein or device program (such as, computer program and computer program).The program of such present invention of realization can store on a computer-readable medium, or can have the form of one or more signal.Such signal can be downloaded from internet website and obtain, or provides on carrier signal, or provides with any other form.
The present invention will be described rather than limits the invention to it should be noted above-described embodiment, and those skilled in the art can design alternative embodiment without departing from the scope of the appended claims.In the claims, any reference marks that should not will be located between bracket is configured to limitations on claims.Word " comprises " and does not exclude the presence of the element or step not arranged in the claims.Word "a" or "an" before being positioned at element does not exclude the presence of multiple such element.The present invention by means of including the hardware of some different elements and can realize by means of properly programmed computer.In the unit claim listing some devices, several in these devices can be through same hardware branch and specifically embody.Word first, second and third use do not indicate that any order.Can be title by these word explanations.
Claims (8)
1. a data transmission method between computer cluster interior joint, adopts minute wheel to receive and dispatch model at random, including:
It is divided into N-1 to take turns the data transmission procedure of N number of node, N >=2；
For each node, randomly choose the data transmission order of this node, described data transmission order is to receive node the putting in order according to round of the data that this node sends in data transmission procedure, once this data transmission order selected, in the data transmission procedure of N-1 wheel, each node sends data according to corresponding data transmission order to appointment node；
Taking turns in data transmission procedure each, each node is carried out a sending action, and the node performing sending action sends data according to the data transmission order of self；The node performing reception action receives data according to arriving first the mode first received；
Wherein, described sending action adopts non-block communication method to perform.
2. data transmission method according to claim 1, described reception action adopts block communication method to perform.
3. data transmission method according to claim 1 and 2, described N number of node belongs to Beowulf's group system, and described sending action adopts the MPI of non-block type to send function and realizes.
4. data transmission method according to claim 2, described N number of node belongs to Beowulf's group system, and described reception action adopts the MPI receiver function of block type to realize.
5. a data transmission system between computer cluster interior joint, adopts minute wheel to receive and dispatch model at random, and including N number of node, the data transmission procedure of described N number of node is divided into N-1 to take turns, N >=2；
Wherein, each node includes:
Transmitting element, for taking turns in data transmission procedure each, performs a sending action, and described sending action is specially and sends data according to the data transmission order of self；Described data transmission order randomly chooses, described data transmission order is to receive node the putting in order according to round of the data that this node sends in data transmission procedure, once this data transmission order selected, in the data transmission procedure of N-1 wheel, each node sends data according to corresponding data transmission order to appointment node；
Receive unit, arrive first, for basis, the mode first received and receive data；
Wherein, described transmitting element is specifically for adopting non-block communication method to perform sending action.
6. data transmission system according to claim 5, described reception unit performs reception action specifically for adopting block communication method.
7. the data transmission system according to claim 5 or 6, described data transmission system is Beowulf's group system, and described transmitting element sends function to realize described sending action specifically for adopting the MPI of non-block type.
8. data transmission system according to claim 6, described data transmission system is Beowulf's group system, and described reception unit realizes described reception action specifically for adopting the MPI receiver function of block type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210475396.6A CN102984084B (en) | 2012-11-21 | 2012-11-21 | Data transmission method and system between computer cluster interior joint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210475396.6A CN102984084B (en) | 2012-11-21 | 2012-11-21 | Data transmission method and system between computer cluster interior joint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102984084A CN102984084A (en) | 2013-03-20 |
| CN102984084B true CN102984084B (en) | 2016-06-29 |
Family
ID=47857842
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210475396.6A Active CN102984084B (en) | 2012-11-21 | 2012-11-21 | Data transmission method and system between computer cluster interior joint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102984084B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105681214B (en) * | 2015-12-28 | 2018-11-27 | 无锡城市云计算中心有限公司 | A kind of large scale network transmission optimization method and system |
| CN106993058A (en) * | 2017-05-24 | 2017-07-28 | 儒安科技有限公司 | The transfer method and apparatus of network request |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1874288A (en) * | 2005-06-01 | 2006-12-06 | 汤姆森特许公司 | Method for determining connection topology of home network |
| CN101324662A (en) * | 2008-07-21 | 2008-12-17 | 中山大学 | Human body infrared positioning apparatus and method facing to wireless sensor network |
| EP0939530A3 (en) * | 1998-02-24 | 2009-11-11 | Canon Kabushiki Kaisha | Data communication system data communication method and data communication apparatus |
| CN102183759A (en) * | 2011-01-25 | 2011-09-14 | 中国船舶重工集团公司第七一五研究所 | Method for implementing sonar real-time signal processing based on Linux group |
| CN102316138A (en) * | 2010-07-02 | 2012-01-11 | 深圳市财付通科技有限公司 | Client end and load balance method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102387204B (en) * | 2011-10-21 | 2014-12-10 | 中国科学院计算技术研究所 | Method and system for maintaining consistency of cluster caching |
-
2012
- 2012-11-21 CN CN201210475396.6A patent/CN102984084B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0939530A3 (en) * | 1998-02-24 | 2009-11-11 | Canon Kabushiki Kaisha | Data communication system data communication method and data communication apparatus |
| CN1874288A (en) * | 2005-06-01 | 2006-12-06 | 汤姆森特许公司 | Method for determining connection topology of home network |
| CN101324662A (en) * | 2008-07-21 | 2008-12-17 | 中山大学 | Human body infrared positioning apparatus and method facing to wireless sensor network |
| CN102316138A (en) * | 2010-07-02 | 2012-01-11 | 深圳市财付通科技有限公司 | Client end and load balance method |
| CN102183759A (en) * | 2011-01-25 | 2011-09-14 | 中国船舶重工集团公司第七一五研究所 | Method for implementing sonar real-time signal processing based on Linux group |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102984084A (en) | 2013-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101764730B (en) | CAN bus data transmission method | |
| CN103905300B (en) | A kind of data message sending method, equipment and system | |
| CN101552785B (en) | CAN bus communication method based on message mechanism used for massive data transmission | |
| RU2014145179A (en) | PHYSICAL LEVEL OF HIGH PERFORMANCE INTERCONNECTIONS | |
| CN103077148B (en) | A kind of host communication method of Based PC IE and main frame | |
| CN106330630A (en) | Method for flexibly transmitting data stream of Ethernet, transmitter and receiver | |
| US8751655B2 (en) | Collective acceleration unit tree structure | |
| CN102394732B (en) | Multi-micropacket parallel processing structure | |
| CN103618673A (en) | NoC routing method guaranteeing service quality | |
| CN102868635A (en) | Multi-core and multi-thread method and system for preserving order of messages | |
| CN106484652B (en) | A kind of more queue communication method and system based on NTB hardware | |
| CN102937944B (en) | A kind of based on Arcnet serial server | |
| CN102984084B (en) | Data transmission method and system between computer cluster interior joint | |
| CN104506280A (en) | Reliable data transmitting method based on time division multiple access space dynamic network | |
| CN102970245B (en) | Data transmission method and system | |
| CN109688200A (en) | A kind of message treatment method, device and equipment | |
| CN1819550A (en) | Method and apparatus to provide efficient communication between processing elements in a processor unit | |
| CN105634960A (en) | Data release device based on fractal tree structure, method, control device and intelligent chip | |
| CN102420734A (en) | System for realizing topological structure of controller area network (CAN) bus | |
| CN103106174A (en) | Complex system on-chip (SOC) communication method | |
| CN102446157B (en) | Communication method and device of processor cores based on array structure | |
| CN107547454A (en) | Message method for dividing and processing in network control chip based on particular communication protocol | |
| CN103078720A (en) | Message processing method and message processing device | |
| CN105099505B (en) | A kind of communication system suitable for pulse ultra-broad band wireless network | |
| CN203658995U (en) | Serial data transmission system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220714 Address after: Room 801, 8th floor, No. 104, floors 1-19, building 2, yard 6, Jiuxianqiao Road, Chaoyang District, Beijing 100015 Patentee after: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Address before: 100088 room 112, block D, 28 new street, new street, Xicheng District, Beijing (Desheng Park) Patentee before: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Patentee before: Qizhi software (Beijing) Co.,Ltd. |
|
| TR01 | Transfer of patent right |