CN114884617B - Block transmission method, computer device and storage medium - Google Patents
Block transmission method, computer device and storage medium Download PDFInfo
- Publication number
- CN114884617B CN114884617B CN202210494694.3A CN202210494694A CN114884617B CN 114884617 B CN114884617 B CN 114884617B CN 202210494694 A CN202210494694 A CN 202210494694A CN 114884617 B CN114884617 B CN 114884617B
- Authority
- CN
- China
- Prior art keywords
- transmission
- node
- data transmission
- block
- leader
- 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 204
- 238000000034 method Methods 0.000 title claims abstract description 35
- 239000012634 fragment Substances 0.000 claims abstract description 40
- 238000004590 computer program Methods 0.000 claims description 8
- 230000004044 response Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012856 packing Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
Abstract
The invention provides a block transmission method, a computer device and a storage medium, wherein the method comprises the following steps: in response to a data transmission with a first transmitting non-leader node of the belonging transmission group, recording data transmission quantity and data transmission time of the first transmission non-leading node and the current node so as to update the data transmission average rate of the first transmission non-leading node and the current node; ordering the non-leader nodes of the transmission group to which the data transmission average rate with the current node belongs in descending order to generate a first node list; determining a first fragment number according to the data volume of a first block to be transmitted; performing FEC coding on the first block to obtain a first number of first slices; taking a plurality of first fragment transmission groups from the first node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number of the first fragments to each first fragment transmission group; wherein the first group of fragmented transmissions includes a first number of fragmented nodes. The invention improves the data transmission efficiency of the block chain system.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a block transmission method, a computer device, and a storage medium.
Background
The objective situation that the transmission speed is different exists for each block chain node in the block chain network due to the factors of various software and hardware, when the volume of a certain block is larger, the block is transmitted to each block chain link point with slower transmission speed in the block chain network, which can take longer time, so that the overall propagation efficiency of the block chain system is not high.
Disclosure of Invention
In view of the foregoing drawbacks or shortcomings of the prior art, it is desirable to provide a block transfer method, a computer device, and a storage medium that improve data transfer efficiency of a blockchain system.
In a first aspect, the present invention provides a block transmission method applicable to a transmission leader node, where a blockchain network includes a plurality of transmission groups, the transmission groups include one transmission leader node and a plurality of transmission non-leader nodes, the transmission leader node is configured to perform data transmission with each transmission non-leader node of a transmission group to which the transmission leader node belongs and each transmission leader node of other transmission groups, and the transmission non-leader node is configured to perform data transmission with other nodes of the transmission group to which the transmission leader node belongs, and the method includes:
in response to a data transmission with a first transmitting non-leader node of the belonging transmission group, recording data transmission quantity and data transmission time of the first transmission non-leading node and the current node so as to update the data transmission average rate of the first transmission non-leading node and the current node;
ordering the non-leader nodes of the transmission group to which the data transmission average rate of the current node belongs in descending order to generate a first node list;
determining a first fragment number according to the data volume of a first block to be transmitted;
performing FEC coding on the first block to obtain a first number of first slices;
taking a plurality of first fragment transmission groups from the first node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number of the first fragments to each first fragment transmission group; wherein the first group of fragmented transmissions includes a first number of fragmented nodes.
In a second aspect, the present invention also provides a computer apparatus, including one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the block transfer method provided according to the embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program for causing a computer to execute the block transmission method according to the embodiments of the present invention.
According to the block transmission method, the computer equipment and the storage medium provided by the embodiments of the invention, the transmission efficiency of the data link is improved by configuring a plurality of transmission groups for transmitting data only through the transmission leader node among the transmission groups in the block chain network, and further, the transmission of the blocks can be completed in the transmission groups more quickly by the transmission leader node preferentially transmitting the fragments of the blocks to the transmission non-leader node with higher average data transmission rate with the current node, so that the data transmission efficiency of the block chain system is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings, in which:
fig. 1 is a flowchart of a block transmission method according to an embodiment of the present invention.
Fig. 2 is a flow chart of a preferred embodiment of the method of fig. 1.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be noted that, for convenience of description, only the portions related to the invention are shown in the drawings.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a flowchart of a block transmission method according to an embodiment of the present invention.
As shown in fig. 1, in this embodiment, the present invention provides a block transmission method applicable to a transmission leader node, where a block chain network includes a plurality of transmission groups, the transmission groups include one transmission leader node and a plurality of transmission non-leader nodes, the transmission leader node is configured to perform data transmission with each transmission non-leader node of a transmission group to which the transmission leader node belongs, each transmission leader node of other transmission groups, and the transmission non-leader node is configured to perform data transmission with other nodes of the transmission group to which the transmission leader node belongs, and the method includes:
s11: in response to a data transmission with a first transmitting non-leader node of the belonging transmission group, recording data transmission quantity and data transmission time of the first transmission non-leading node and the current node so as to update the data transmission average rate of the first transmission non-leading node and the current node;
s13: ordering the non-leader nodes of the transmission group to which the data transmission average rate of the current node belongs in descending order to generate a first node list;
s15: determining a first fragment number according to the data volume of a first block to be transmitted;
s17: performing FEC coding on the first block to obtain a first number of first slices; s19: taking a plurality of first fragment transmission groups from the first node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number of the first fragments to each first fragment transmission group; wherein the first group of fragmented transmissions includes a first number of fragmented nodes.
In this embodiment, the blockchain network A is configured with 10 transport groups G 1 -G 10 Each transmission group includes 1 transmission leader node and 8-15 unequal transmission non-leader nodes, e.g., transmission group G 1 Including a transmission leader node L 1 And transmitting non-leader node N 1 -N 13 Transmission group G 2 Including a transmission leader node L 2 And transmitting non-leader node N 14 -N 23 And so on. In further embodiments, the blockchain network may be configured with any number (obviously greater than 1) of transmission groups, and the transmission groups may be configured with any number (obviously also greater than 1) of transmission non-leader nodes, so as to achieve the same technical effect.
Each transmission leading node L 1 -L 10 Steps S11-S13 are performed each time a data transmission is performed with a respective transmitting non-leader node of the respective belonging transmission group to update the respective first node list.
To transmit the leader node L 1 And transmitting non-leader node N 7 The data transfer takes place as an example:
in step S11, L 1 Recording the data transmission quantity s of the data transmission 1 Data transmission time t 1 And according toData transmission quantity s 1 Data transmission time t 1 Updating N 7 Average rate v of data transmission with current node 7 。
Specifically, N 7 Average rate v of data transmission with current node 7 Can be according to N 7 Total historical data transmission amount (original total historical data transmission amount plus s) with current node 1 ) And, N 7 Total time length of historical data transmission with current node (original total time length of historical data transmission plus t) 1 ) Calculating to obtain; the data transmission total amount and the data transmission total duration in a certain period of time can be obtained through calculation; samples with too small a data transmission amount may be further excluded or the same technical effect may be achieved using other calculation means as will be appreciated by those skilled in the art.
In step S13, L 1 Per-transmission non-leader node N 1 -N 13 Descending order of average rate of data transmission to current node 1 -N 13 Ordering to generate a first list of nodes, e.g., (N) 5 ，N 8 ，N 12 ，N 1 ，N 4 ，N 13 ，N 10 ，N 6 ，N 7 ，N 3 ，N 2 ，N 11 ，N 9 )。
In step S15, when L 1 It is necessary to block the blocks 1 To the transmitting non-leader node N 1 -N 13 And L 2 -L 10 In time, according to the block 1 Determines a first number of slices (e.g., 47 Mb):
specifically, block 1 Can be made of N 1 -N 13 Any node in the same-genus transmission group G is generated by packing after obtaining the block packing weight of the corresponding block height and is transmitted to the same-genus transmission group G 1 Is a transmission leader node L of (1) 1 May also be composed of L 1 And obtaining the block packing weight of the corresponding block height, and then packing the block to generate the block.
In this embodiment, taking the calculation mode of the first number of slices as an example, the quotient of the data volume of the first block and the first threshold (10 Mb) is rounded up, and the number (3) of redundant coding slices is added, so as to make an exemplary explanation; in more embodiments, the calculation manner of the first number of slices may be configured as other reasonable calculation manners as will be understood by those skilled in the art according to actual needs, and the first threshold and the number of redundant coded slices may be configured as any reasonable values, which may all achieve the same technical effects, but are not limited to the above examples.
In step S17, L 1 To block 1 FEC encoding to obtain 8 slices f 1 -f 8 ；
In step S18, L 1 Taking 2 first sliced transmission groups from the first node list in a head-to-tail loop manner: (N) 5 ，N 8 ，N 12 ，N 1 ，N 4 ，N 13 ，N 10 ，N 6 )、(N 7 ，N 3 ，N 2 ，N 11 ，N 9 ，N 5 ，N 8 ，N 12 ) And then completing the transmission of each fragment through multiple rounds of transmission:
in the first round of transmission, 8 fragments f are respectively divided 1 -f 8 Is transmitted to the sliced transmission group (N 5 ，N 8 ，N 12 ，N 1 ，N 4 ，N 13 ，N 10 ，N 6 ) Then respectively dividing 8 fragments f 1 -f 8 Is transmitted to the sliced transmission group (N 7 ，N 3 ，N 2 ，N 11 ，N 9 ，N 5 ，N 8 ，N 12 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the non-leader node N is transmitted 1 -N 13 At the receiving transmission leader node L 1 After the transmitted fragments, the received fragments are also transmitted to each other in p2p or other transmission modes commonly used in the art;
in the second round of transport, the fragments f 1 -f 8 Out of order (e.g., f 8 -f 1 ) Respectively sequentially transmitting the 8 fragments after disorder to the two fragment transmission groups;
……
transmitting non-leader node N 1 -N 13 Only 8 fragments f need to be received 1 -f 8 Any 5 slices in the block can be restored according to the received 5 slices 1 . The specific principles may be referred to as FEC coding principles, and those skilled in the art will understand that they are not described herein.
Obviously, compared with the existing transmission scheme, the transmission group G 1 The block can be completed more quickly by the method 1 Transmission to each node within the group.
Transmission group G 2 -G 10 Transmission procedure in (a) and the above transmission group G 1 The transmission process in (a) is the same and will not be described in detail.
According to the embodiment, the plurality of transmission groups for transmitting data only through the transmission leader node are configured among the transmission groups in the blockchain network, so that the transmission efficiency of the data link is improved, and the transmission leader node preferentially transmits the fragments of the blocks to the transmission non-leader node with higher average data transmission rate with the current node, so that the fragments of the blocks can be rapidly transmitted inside the transmission groups, and the data transmission efficiency of the blockchain system is improved.
Fig. 2 is a flow chart of a preferred embodiment of the method of fig. 1.
In a preferred embodiment, as shown in fig. 2, the method further comprises:
s12: responding to data transmission with a first transmission leader node, and recording the data transmission quantity and the data transmission time of the first transmission leader node and a current node so as to update the data transmission average rate of the first transmission leader node and the current node;
s14: ordering the transmission leader nodes of other transmission groups in descending order of the average data transmission rate with the current node to generate a second node list;
s18: taking a plurality of second fragment transmission groups from the second node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number first fragments to each second fragment transmission group; wherein the second group of fragmented transmissions includes the first number of fragmented nodes.
Specifically, the principle of steps S12, S14, S18 is the same as that of steps S11, S13, S19, except that the transmission object of steps S11, S13, S19 is each transmission non-leader node of the belonging transmission group, and the transmission object of steps S12, S14, S18 is each transmission leader node of the other transmission group.
The principle of the method shown in fig. 2 can refer to the method shown in fig. 1, and the specific process will not be repeated.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 3, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage section 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data required for the operation of the device 300 are also stored. The CPU301, ROM302, and RAM303 are connected to each other through a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
The following components are connected to the I/O interface 305: an input section 306 including a keyboard, a mouse, and the like; an output portion 307 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 308 including a hard disk or the like; and a communication section 309 including a network interface card such as a LAN card, a modem, or the like. The communication section 309 performs communication processing via a network such as the internet. The drive 310 is also connected to the I/O interface 305 as needed. A removable medium 311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 310 as needed, so that a computer program read therefrom is installed into the storage section 308 as needed.
In particular, according to embodiments of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 309, and/or installed from the removable medium 311.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer readable storage medium stores one or more programs for use by one or more processors to perform the methods described herein.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, for example, the units may be software programs provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the invention referred to in this application is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or their equivalents without departing from the spirit of the application. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.
Claims (4)
1. A block transmission method, wherein a blockchain network includes a plurality of transmission groups, the transmission groups including a transmission leader node configured to perform data transmission with each transmission leader node of a transmission group to which the block is attached and each transmission leader node of other transmission groups to which the block is attached, and a plurality of transmission non-leader nodes configured to perform data transmission with other nodes of the transmission group to which the block is attached, the method being applicable to the transmission leader nodes, the method comprising:
responding to data transmission with a first transmission non-leading node of a transmission group, and recording data transmission quantity and data transmission time of the first transmission non-leading node and a current node so as to update the data transmission average rate of the first transmission non-leading node and the current node;
ordering the non-leader nodes of the transmission group to which the data transmission average rate of the current node belongs in descending order to generate a first node list;
determining a first fragment number according to the data volume of a first block to be transmitted;
FEC encoding the first block to obtain the first number of slices;
taking a plurality of first fragment transmission groups from the first node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number first fragments to each first fragment transmission group; wherein the first shard transport group includes the first shard number of nodes.
2. The method as recited in claim 1, further comprising:
responding to data transmission with a first transmission leader node, and recording the data transmission quantity and the data transmission time of the first transmission leader node and a current node so as to update the data transmission average rate of the first transmission leader node and the current node;
ordering the transmission leader nodes of other transmission groups in descending order of the average data transmission rate with the current node to generate a second node list;
taking a plurality of second fragment transmission groups from the second node list in a head-to-tail circulation mode, and sequentially transmitting the first fragment number first fragments to each second fragment transmission group; wherein the second group of fragmented transmissions includes the first number of fragmented nodes.
3. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-2.
4. A storage medium storing a computer program, which when executed by a processor implements the method of any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210494694.3A CN114884617B (en) | 2022-05-07 | 2022-05-07 | Block transmission method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210494694.3A CN114884617B (en) | 2022-05-07 | 2022-05-07 | Block transmission method, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114884617A CN114884617A (en) | 2022-08-09 |
| CN114884617B true CN114884617B (en) | 2023-12-26 |
Family
ID=82673726
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210494694.3A Active CN114884617B (en) | 2022-05-07 | 2022-05-07 | Block transmission method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114884617B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101917334A (en) * | 2010-08-03 | 2010-12-15 | 浙江大学 | Transmission network generation method by network coding of part of nodes |
| CN110300170A (en) * | 2019-06-28 | 2019-10-01 | 杭州复杂美科技有限公司 | Block chain distributed storage method for down loading, equipment and storage medium |
| WO2020134821A1 (en) * | 2018-12-25 | 2020-07-02 | 华为技术有限公司 | Data transmission method and communication device |
| WO2022007345A1 (en) * | 2020-07-09 | 2022-01-13 | 江苏复杂美科技有限公司 | Parallel processing method for blocks, device, and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2401759A (en) * | 2003-05-13 | 2004-11-17 | Nokia Corp | Method of signalling in a mobile communications network |
| CN101938322B (en) * | 2009-07-03 | 2012-11-28 | 中兴通讯股份有限公司 | Bandwidth adaptive data grading protection method and device |
| CN109165945B (en) * | 2018-09-07 | 2021-04-16 | 腾讯科技（深圳）有限公司 | Representative node device election method and device, computer device and storage medium |
| US10949312B2 (en) * | 2018-09-21 | 2021-03-16 | Netapp, Inc. | Logging and update of metadata in a log-structured file system for storage node recovery and restart |
-
2022
- 2022-05-07 CN CN202210494694.3A patent/CN114884617B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101917334A (en) * | 2010-08-03 | 2010-12-15 | 浙江大学 | Transmission network generation method by network coding of part of nodes |
| WO2020134821A1 (en) * | 2018-12-25 | 2020-07-02 | 华为技术有限公司 | Data transmission method and communication device |
| CN110300170A (en) * | 2019-06-28 | 2019-10-01 | 杭州复杂美科技有限公司 | Block chain distributed storage method for down loading, equipment and storage medium |
| WO2022007345A1 (en) * | 2020-07-09 | 2022-01-13 | 江苏复杂美科技有限公司 | Parallel processing method for blocks, device, and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 一种高效安全的去中心化数据共享模型;董祥千;郭兵;沈艳;段旭良;申云成;张洪;;计算机学报(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114884617A (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210065002A1 (en) | Concepts for distributed learning of neural networks and/or transmission of parameterization updates therefor | |
| CN110175212B (en) | Block chain distributed storage method, data reading method, device and storage medium | |
| Lee et al. | Coded computation for multicore setups | |
| CN112839382B (en) | Video semantic driven communication and computing resource joint allocation method in Internet of vehicles | |
| EP4350572A1 (en) | Method, apparatus and system for generating neural network model, devices, medium and program product | |
| CN113139663A (en) | Federal edge learning configuration information acquisition method, device, equipment and medium | |
| CN111898424B (en) | Character recognition model training method and device, electronic equipment and storage medium | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| CN114861790B (en) | Method, system and device for optimizing federal learning compression communication | |
| CN114884617B (en) | Block transmission method, computer device and storage medium | |
| CN113094180B (en) | Wireless federal learning scheduling optimization method and device | |
| CN116470920A (en) | Bidirectional self-adaptive gradient compression method and system for federal learning | |
| CN114465900B (en) | Data sharing delay optimization method and device based on federal edge learning | |
| CN114944887B (en) | Block transmission method, computer device and storage medium | |
| CN116384513A (en) | Yun Bianduan collaborative learning system and method | |
| US10250515B2 (en) | Method and device for forwarding data messages | |
| WO2022251885A1 (en) | Bi-directional compression and privacy for efficient communication in federated learning | |
| CN116452404A (en) | Memory optimization method and system for distributed training of deep learning model | |
| US20220292342A1 (en) | Communication Efficient Federated/Distributed Learning of Neural Networks | |
| US20230246887A1 (en) | Training in Communication Systems | |
| CN111432027B (en) | Parallel chain block synchronization method, device and storage medium | |
| US20230177381A1 (en) | Accelerating the Training of Machine Learning (ML) Models via Data Instance Compression | |
| CN108347451B (en) | Picture processing system, method and device | |
| Zheng et al. | Mobility-Aware Split-Federated With Transfer Learning for Vehicular Semantic Communication Networks | |
| CN111404781B (en) | Speed limiting method, apparatus and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20231120 Address after: 24B8 Guangcai Xintiandi, No. 2002, Nanshan Avenue, Xuefu Community, Nanshan Street, Nanshan District, Shenzhen, Guangdong 518000 Applicant after: Shenzhen Beichen Boyu Technology Co.,Ltd. Address before: 310000 Room 702, 7th Floor, Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province Applicant before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |