A loop detection method, device, electronic equipment and storage medium

Abstract

The present application provides a loop detection method, device, electronic equipment and storage medium. The method is applied to any node in the distributed system. The method includes updating its own candidate states according to the candidate states of adjacent downstream nodes, so that the candidate states of the end points of each dependent path are forwarded. Wherein, if there is a downstream node at the end point, the candidate state of the end point is the first candidate state. In response to the candidate state of the adjacent downstream node being the first candidate state, and the public identifier of the target node being smaller than the public identifier of the adjacent downstream node, updating the public identifier of the target node to the The public identifier of the adjacent downstream node. In response to the fact that the candidate state of the adjacent downstream node is the first candidate state, and the private identifier of the target node is equal to the public identifier of the adjacent downstream node, it is determined that there is a loop in the dependency path corresponding to the target node road.

Description

Technical field [0001] In particular, one or more embodiments of the present application relate to network service risk identification, and more particularly to a loop detecting method, apparatus, electronic device, and storage medium. Background technique [0002] Data dependencies may occur between nodes that perform computing transactions in a distributed system. If a loop occurs if a loop occurs in a number of data dependencies, it may affect distributed system performance. [0003] For example, when a distributed system is a distributed database system, if there is a loop between node A and Node B, the node A needs to rely on the result of the criterion B executable, and Node B also needs to rely on nodes. A results after performing the transaction, which may cause a deadlock between node A and Node B, which is difficult to perform a transaction normally. Therefore, loop detection is required. [0004] Currently, in some related technologies, the global dependency path needs...

AI Technical Summary

Problems solved by technology

On the one hand, this kind of operation relies too much on a single node. If the node is killed, the loop detection cannot be performed normally; on the other hand, it needs to transmit the global dependency path between nodes, resulting in a relatively large amount of information maintained and transmitted by the node. , which may reduce the performance of nodes performing distributed transactions

Other loop detection methods can only detect loops for single out-degree scenarios, and cannot be applied to multi-out-degree scenarios.

Images