ASYNCHRONOUS MESSAGE PASSING FOR LARGE GRAPH CLUSTERING
    1.
    发明申请
    ASYNCHRONOUS MESSAGE PASSING FOR LARGE GRAPH CLUSTERING 有权
    用于大量图形聚类的异步消息传递

    公开(公告)号:US20150006606A1

    公开(公告)日:2015-01-01

    申请号:US14145127

    申请日:2013-12-31

    Applicant: GOOGLE INC.

    CPC classification number: G06F17/30958 G06F9/546 G06F2209/548 G06Q10/06

    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.

    Abstract translation: 用于发送异步消息的系统和方法包括:使用至少一个处理器在分布式图中的节点处接收具有第一值的消息,并在该节点处确定第一值替换该节点的当前值。 响应于确定第一值替换当前值,该方法还包括将节点的状态设置为活动,并将包括第一值的消息发送到相邻节点。 该方法还可以包括在优先级队列处接收消息到相邻节点。 优先级队列以智能异步方式传播消息,优先级队列将消息传播到相邻节点,节点的状态设置为非活动状态。 第一个值可以是集群标识符或最短路径标识符。

    Asynchronous message passing for large graph clustering

    公开(公告)号:US09852230B2

    公开(公告)日:2017-12-26

    申请号:US14145127

    申请日:2013-12-31

    Applicant: GOOGLE INC.

    CPC classification number: G06F17/30958 G06F9/546 G06F2209/548 G06Q10/06

    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.

Patent Agency Ranking