《一个多到一归约操作算法框架（an algorithm framework for multiple to one reduction operations）》由会员分享，可在线阅读，更多相关《一个多到一归约操作算法框架（an algorithm framework for multiple to one reduction operations）（25页珍藏版）》请在金锄头文库上搜索。
1、一个多到一归约操作算法框架（An algorithm framework for multiple to one reduction operations）Worth having dataIs from the usual accumulation of learning summaryThere are certainly some local problemsAlso please criticism!Based on a multi allreduce operation algorithm to a general mode of communicationXiongyuqingIn
2、stitute of computing technology, China Academy of Sciences100080 BeijingThe general definition of logical topologyPresents a multi to allreduce operation algorithm for general communication modeThe algorithm is based on general logic topologyThe logical topology is determined in parallel and distrib
3、uted computing mechanism of message transmissionBecause of abstract general logic topologyThe algorithm actually provides a more than a allreduce operation algorithm frameworkWhen given a specific logical topologyThe framework can be given to a global reduction algorithm based on special communicati
4、on modeThis provides a new method for the design of a multi allreduce operation algorithmKeywords parallel computing to a allreduce operation logic topologyHow to allreduce operation is multiple processes will participate in parallel computing in the data or the maximumMinimum operationAnd the data
5、after the operation in one processIt is widely used in parallel computing in 1Many of their algorithms are proposedMost of these algorithms are based on the special communication modeThis paper first gives the definition of the general form of communication modeA? - logical topology definitionThe lo
6、gical topology is determined in distributed parallel mechanism 2 how to calculate in message passingOn the basis of a many to one based on allreduce operation algorithm for general communication modeThe algorithm is based on general logic topologyBecause of abstract general logic topologyThe algorit
7、hm actually provides a more than a allreduce operation algorithm frameworkWhen given a specific logical topologyAccording to the framework available to a reduction algorithm based on the mode of operation of special communicationThis provides a new method for the design of a multi allreduce operatio
8、n algorithm1 general logical topology definition and its basic propertiesDefinition 1As a set of processesSet time stepamongA partition is theamongIs called the root processIs a directed weighted treeIt is a set of nodesThe root node isAs a set of weightsThe direction is from the leaf node to the ro
9、otFor any non leaf nodeThe degree ofThere is an article from entering the node mapping to the edge toAssociation mapping is called theHave the following properties:The minimum weight;In each leaf node from the root node to the path.The edge weights strictly increasing;We enter any non leaf node to e
10、dgeThe number of edges is not greater than equal rights;As for any non leaf nodeIf there is a side to make the arbitrary boundaryYesThe edge weight is continuousThat is their weights can be expressed as,amongThe maximum weight (i.e.) directed edges calledThe termination of the process side;The right
11、 to equal the termination of each non leaf node in the process of all sides;The maximum weight. Each non root non leaf node into the edge (i.e. the termination of the right side) and from the node from the edge weightsIs continuousThat isIf the maximum weight into the side of theThen the edge weight
12、s for injection,The successor function is defined as: if and only ifThis is the directed edge.AndThe right tootherwiseDefinition 2 let a set of processes forThe time step is setFor the following functionThe general logical topology is defined as:for exampleA process for collectionThe time step is se
13、tDivided intoProcess for the root processThe tree is shown in Figure 1Each node for association mapping:,By definition 1The successor function,In other casesThe value ofBy definition 2Have the following logical topology:This is a 2- tree topologyAs shown in Figure 2ZeroZeroZeroOneTFigure 1 treeFigur
14、e 2 2- tree topologyTheorem 1 in the general logical topologyFor any non root processThere is only one process at a certain time step is madeAs the precursorCalled the successorCard setBecause it is a non root processIs not the root of the treesuchIn the tree there is a unique node made from directed edge.By definition 1The existence and uniqueness of theBy definition 1YesThe tree is in the right sidethusFrom the aboveGet the following corollaryCorollary 1 no subsequent root processNon root process of theorem 2 for anyIn betweenOnly to have the processThe time step.
