Code distributed calculation method based on Partition structure
A distributed computing and coding technology, applied in the field of network communication, which can solve the problems of inability to carry out practical applications, large number of input files and output functions, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0045] For the number s of calculations of each output function, most of the literature is researched on the case of s=1, and only a few articles mention the case of s>1, and in this case, the focus is on Solve the problem of how to reduce the number N of input files and the number Q of output functions when s>1.
[0046] An encoding distributed computing method based on the Partition structure. In encoding distributed computing, for N input files, K distributed computing nodes are used to calculate the values of Q output functions. The entire calculation process is carried out in three stages: In Map stage, Shuffle stage and Reduce stage, K nodes jointly calculate Q functions s times distributed computing method, including the following steps:
[0047] A.Map stage:
[0048] Each node passes the Map function n∈{1,...,N}, T∈N calculates the local stored files to generate intermediate values v corresponding to all Q functions q,n :
[0049]
[0050] in n∈{1,...,N} ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


