[go: up one dir, main page]

CN102710481B - Token turnover control method, device and system - Google Patents

Token turnover control method, device and system Download PDF

Info

Publication number
CN102710481B
CN102710481B CN201210156854.XA CN201210156854A CN102710481B CN 102710481 B CN102710481 B CN 102710481B CN 201210156854 A CN201210156854 A CN 201210156854A CN 102710481 B CN102710481 B CN 102710481B
Authority
CN
China
Prior art keywords
node
token
turnover
message
recorded information
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.)
Expired - Fee Related
Application number
CN201210156854.XA
Other languages
Chinese (zh)
Other versions
CN102710481A (en
Inventor
张明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201210156854.XA priority Critical patent/CN102710481B/en
Publication of CN102710481A publication Critical patent/CN102710481A/en
Priority to PCT/CN2012/084234 priority patent/WO2013170592A1/en
Application granted granted Critical
Publication of CN102710481B publication Critical patent/CN102710481B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42Loop networks
    • H04L12/427Loop networks with decentralised control
    • H04L12/433Loop networks with decentralised control with asynchronous transmission, e.g. token ring, register insertion

Landscapes

  • Small-Scale Networks (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)

Abstract

本发明实施例公开了一种令牌周转控制方法、装置及系统,其中,所述方法包括:获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序;按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点。可以让有消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了消息吞吐量。

The embodiment of the present invention discloses a token turnover control method, device, and system, wherein the method includes: obtaining information about the message sending status of each node in the current logical token transfer ring during the past M rounds of token turnover Historical record information: update the node turnover sequence indicated in the node turnover record information contained in the token according to the historical record information, and the node turnover record information is used to indicate that the token is in the logical token transfer ring The node turnover sequence; according to the node turnover sequence indicated by the updated node turnover record information, the updated token is passed to the corresponding next node. It can allow nodes with message sending needs to send messages faster, reduce the backlog of messages on these nodes, reduce message delay, improve node performance and availability, and increase message throughput.

Description

一种令牌周转控制方法、装置及系统A token turnover control method, device and system

技术领域 technical field

本发明涉及令牌周转控制领域,尤其涉及一种令牌周转控制方法、装置及系统。The invention relates to the field of token turnover control, in particular to a token turnover control method, device and system.

背景技术 Background technique

totem单环有序协议提供一个发送域内全局有序向上层服务递交消息的机制。这意味着消息需要可靠性和有序性保证,施加于发送域之上的是一个逻辑令牌传递环,在该逻辑令牌传递环内传递的令牌用于控制对环的访问,并且只有持有令牌的节点能够发送消息。逻辑令牌传递环内的每个节点每次得到令牌后能够发送多个消息。当所有节点都没有消息发送,令牌还是持续在环内循环。The totem single-ring ordered protocol provides a mechanism for sending globally orderly delivery messages in the domain to upper-layer services. This means that messages require reliability and ordering guarantees. Imposed on the sending domain is a logical token-passing ring within which tokens are passed to control access to the ring, and only Nodes holding tokens are able to send messages. Each node in a logical token-passing ring can send multiple messages each time it gets a token. When all nodes have no messages to send, tokens continue to circulate in the ring.

在totem系统中,节点每次需要等待拿到令牌之后才能发送消息,这样造成了节点发送消息有一定的延时,节点规模越大,延时越高;假如某个节点突然有大量的消息需要发送,节点需要经过多次令牌周转才能将消息全部发送完,则节点中越靠后的消息,其发送延时越高。In the totem system, each node needs to wait for the token before sending a message, which causes a certain delay in sending a message. The larger the node size, the higher the delay; if a node suddenly has a large number of messages It needs to be sent, and the node needs to go through multiple token turnovers to send all the messages. The later the message in the node, the higher the sending delay.

发明内容 Contents of the invention

本发明实施例提供一种令牌周转控制方法、装置及系统,可根据逻辑令牌传递环内每一个节点的历史发送情况更新令牌周转顺序,降低消息延时,提高消息吞吐量。Embodiments of the present invention provide a token turnover control method, device and system, which can update the token turnover sequence according to the historical transmission status of each node in the logical token transfer ring, reduce message delay, and improve message throughput.

一方面,本发明实施例提供了一种令牌周转控制方法,包括:On the one hand, an embodiment of the present invention provides a token turnover control method, including:

获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;Obtain the historical record information of the message sending situation of each node in the current logical token passing ring during the past M rounds of token turnover;

根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序;Update the node turnover sequence indicated in the node turnover record information contained in the token according to the historical record information, and the node turnover record information is used to indicate the node turnover sequence of the token in the logical token transfer ring ;

按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点。The updated token is passed to the corresponding next node according to the node turnover sequence indicated by the updated node turnover record information.

另一方面,本发明实施例还提供了一种令牌周转方法,包括:On the other hand, the embodiment of the present invention also provides a token turnover method, including:

当前节点接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息;After the current node receives the token passed in the logical token passing ring, it sends the message to be sent;

基于所述节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中;Based on the number of messages sent by the node during the token turnover process of the current round, record the number of messages sent in the current round into the node turnover record information corresponding to the node identifier in the token;

根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。The updated token is passed to the corresponding next node according to the node turnover sequence indicated by the node turnover record information in the token.

再一方面,本发明实施例还提供了一种令牌周转控制装置,包括:In another aspect, the embodiment of the present invention also provides a token turnover control device, including:

获取模块,用于获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;The obtaining module is used to obtain the historical record information of the message sending situation of each node in the current logical token passing ring during the past M rounds of token turnover;

更新模块,用于根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序;An update module, configured to update the node turnover sequence indicated in the node turnover record information contained in the token according to the historical record information, the node turnover record information is used to indicate that the token is in the logical token passing ring The node turnover sequence in ;

发送模块,用于按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点。A sending module, configured to deliver the updated token to the corresponding next node according to the node turnover sequence indicated by the updated node turnover record information.

再一方面,本发明实施例还公开了一种基于令牌周转发送消息的节点,包括:In another aspect, the embodiment of the present invention also discloses a node for sending messages based on token turnover, including:

通信模块,用于接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息;The communication module is used to send the message to be sent after receiving the token passed in the logical token passing ring;

记录模块,用于基于所述节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中;A recording module, configured to record the number of messages sent in this round into the node turnover record information corresponding to the node identifier in the token based on the number of messages sent by the node during the token turnover process of the current round ;

所述通信模块还用于根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。The communication module is further configured to transfer the updated token to the corresponding next node according to the node turnover sequence indicated by the node turnover record information in the token.

最后,本发明实施例还提供了一种使用令牌环机制的集群系统,包括多个节点,所述多个节点包括:主节点和从节点,其中,Finally, the embodiment of the present invention also provides a cluster system using a token ring mechanism, including multiple nodes, and the multiple nodes include: a master node and a slave node, wherein,

所述主节点,用于获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序;按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点;The master node is used to obtain the historical record information of each node in the current logic token passing ring in the past M rounds of token turnover process; according to the historical record information, the node contained in the token The node turnover sequence indicated in the turnover record information is updated, and the node turnover record information is used to indicate the node turnover sequence of the token in the logical token transfer ring; according to the node turnover sequence indicated by the updated node turnover record information The turnover sequence passes the updated token to the corresponding next node;

所述从节点,用于接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息,基于本节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中,根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。The slave node is used to send the message to be sent after receiving the token passed in the logical token transfer ring, based on the number of messages sent by the node in the token turnover process of the current round, the message sent in the current round The quantity of the token is recorded in the node turnover record information corresponding to the node identification in the token, and the updated token is passed to the corresponding next node according to the node turnover sequence indicated by the node turnover record information in the token. a node.

实施本发明实施例,具有如下有益效果:Implementing the embodiment of the present invention has the following beneficial effects:

能够根据每一个节点的历史发送情况来更新令牌在节点中的周转顺序,可以让有消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了消息吞吐量。It is possible to update the turnover sequence of tokens in nodes according to the historical sending status of each node, which can allow nodes with message sending needs to send messages faster, reduce the backlog of messages on these nodes, reduce message delay, and improve node performance and availability, improving message throughput.

附图说明 Description of drawings

为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

图1是本发明的令牌周转控制方法的第一实施例流程示意图;Fig. 1 is a schematic flow chart of the first embodiment of the token turnover control method of the present invention;

图2是本发明实施例的令牌周转方法的实施例流程示意图;Fig. 2 is a schematic flow chart of an embodiment of a token turnover method according to an embodiment of the present invention;

图3是本发明的令牌周转控制方法的第二实施例流程示意图;Fig. 3 is a schematic flow chart of the second embodiment of the token turnover control method of the present invention;

图4是本发明实施例的其中一种逻辑令牌传递环内令牌在节点中的传递顺序示意图;Fig. 4 is a schematic diagram of the transfer sequence of tokens in nodes in one of the logical token transfer rings according to an embodiment of the present invention;

图5是本发明的令牌周转控制装置的第一实施例结构组成示意图;Fig. 5 is a schematic structural composition diagram of the first embodiment of the token turnover control device of the present invention;

图6是本发明的令牌周转控制装置的第二实施例结构组成示意图;Fig. 6 is a schematic structural composition diagram of the second embodiment of the token turnover control device of the present invention;

图7是本发明的基于令牌周转发送消息的节点的结构组成示意图;Fig. 7 is a schematic diagram of the structural composition of a node sending messages based on token turnover in the present invention;

图8是本发明的使用令牌环机制的集群系统的结构组成示意图。FIG. 8 is a schematic diagram of the structural composition of the cluster system using the token ring mechanism of the present invention.

具体实施方式 Detailed ways

下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

请参见图1,是本发明的令牌周转控制方法的第一实施例流程示意图,在本实施例中,逻辑令牌传递环内包括多个节点,其中包括一个负责令牌创建令牌发起节点,该令牌发起节点还在令牌中保存一用于指示令牌在令牌传递环内的节点周转顺序的节点周转记录信息。令牌发起节点发出令牌后,按照所述节点周转记录信息,令牌在所述逻辑令牌传递环内各个节点之间传递,环上的每个节点在接收到令牌时发送消息。本实施例的所述方法具体包括:Please refer to FIG. 1 , which is a schematic flow chart of the first embodiment of the token turnover control method of the present invention. In this embodiment, the logical token transfer ring includes multiple nodes, including a token initiation node responsible for token creation , the token initiating node also stores in the token a node turnover record information for indicating the node turnover order of the token in the token transfer ring. After the token initiating node issues the token, according to the node turnover record information, the token is transferred between nodes in the logical token transfer ring, and each node on the ring sends a message when receiving the token. The method in this embodiment specifically includes:

S101:获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息。S101: Obtain historical record information of message sending situations of each node in the current logical token passing ring during past M rounds of token turnover.

所述S101获取逻辑令牌传递环内每一个节点的历史发送情况的记录信息的方式可以为:令牌发起节点可以在令牌中保存节点周转记录信息,该节点周转记录信息可以以节点周转表的形式表示,在发出令牌进行周转传递的过程中,每一个节点在获取到令牌并发送消息后,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中,所述节点标识可以是相应节点的名称,或其他能唯一表示节点的其他标识。The method of S101 to obtain the record information of the historical transmission status of each node in the logical token transfer ring may be as follows: the token originating node may save the node turnover record information in the token, and the node turnover record information may be represented by the node turnover table In the form of , in the process of issuing tokens for turnover transfer, after each node obtains the token and sends a message, it will record the number of messages sent in this round into the corresponding node ID in the token In the node turnover record information, the node identifier may be the name of the corresponding node, or other identifiers that can uniquely represent the node.

在每一轮令牌周转结束后,令牌回到令牌发起节点时,令牌发起节点根据本轮循环后得到的节点周转记录信息,对每一个节点的历史发送情况进行统计更新并记录,在M轮令牌周转结束后,对每一个节点记录的统计结果即为每一个节点的消息发送情况的历史记录信息。所述M的值可根据逻辑令牌传递环内节点的具体情况进行调整更改,以便更好地降低每一个节点的消息发送延时。After each round of token turnover, when the token returns to the token originating node, the token originating node will update and record the historical sending status of each node according to the node turnover record information obtained after the current round of circulation. After the M rounds of token turnover, the statistical results recorded for each node are the historical record information of the message sending situation of each node. The value of M can be adjusted and changed according to the specific conditions of the nodes in the logical token passing ring, so as to better reduce the message sending delay of each node.

所述S101中获取每一个节点的历史发送情况的记录信息的方式还可以为:直接在令牌中设置保存节点周转记录信息,在每一轮获取到令牌后,根据令牌中的所述节点周转记录信息中记录的每一个节点本轮的消息发送数量更新令牌发起节点本地维护的所述历史记录信息中每一个节点对应的累计消息发送数量;在M轮令牌周转结束后,将所述历史记录信息中所记录的每一个节点对应的累计消息发送数量作为逻辑令牌传递环内每一个节点的消息发送情况的历史记录信息。其中,所述历史记录信息可以以历史记录表的形式表示,当然也可以用脚本文件或者元数据等形式表示。The way to obtain the record information of each node’s historical transmission situation in S101 can also be: directly set and save the node turnover record information in the token, and after obtaining the token in each round, according to the described in the token The number of messages sent by each node in this round recorded in the node turnover record information updates the cumulative number of messages sent by each node in the historical record information locally maintained by the token originating node; after the M round of token turnover ends, the The cumulative number of messages sent corresponding to each node recorded in the history record information is used as the history record information of the message sending situation of each node in the logical token passing ring. Wherein, the history record information may be represented in the form of a history record table, and of course may also be represented in the form of a script file or metadata.

S102:根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新。如上述,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序。S102: According to the historical record information, update the node turnover sequence indicated in the node turnover record information contained in the token. As mentioned above, the node turnover record information is used to indicate the node turnover order of the token in the logical token passing ring.

在所述S102中,根据所述历史记录信息,确定逻辑令牌传递环中在历史的M轮令牌周转传递过程中很少发送消息或者不发送消息的节点,在更新后的节点周转顺序中,在后续N轮令牌周转过程中,跳过这些很少发送消息或者不发送消息的节点,即不向很少发送消息或者不发送消息的节点传递令牌,剥削这些节点发送消息的权利,方便其他常发送消息的节点发送数据,降低常发送消息的节点上的消息发送时延。In said S102, according to the historical record information, determine the nodes in the logical token passing ring that seldom send messages or do not send messages in the historical M rounds of token turnover transfer process, and in the updated node turnover order , in the subsequent N rounds of token turnover, skip these nodes that rarely send messages or do not send messages, that is, do not pass tokens to nodes that rarely send messages or do not send messages, and exploit the right of these nodes to send messages, It is convenient for other nodes that often send messages to send data, and reduces the message sending delay on nodes that often send messages.

S103:按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点。即按照新的节点周转顺序,跳过某些很少发送消息或者不发送消息的节点传递令牌。S103: Transfer the updated token to a corresponding next node according to the node turnover sequence indicated by the updated node turnover record information. That is, according to the new node turnover sequence, some nodes that rarely send messages or do not send messages are skipped to pass tokens.

通过上述实施例的描述可知,本发明具有以下优点:As can be seen from the description of the foregoing embodiments, the present invention has the following advantages:

能够根据每一个节点的历史发送情况来更新令牌在节点中的周转顺序,可以让有较大消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了消息吞吐量。It is possible to update the turnover order of tokens in nodes according to the historical sending status of each node, which can allow nodes with large message sending needs to send messages faster, reduce the backlog of messages on these nodes, reduce message delays, and improve Node performance and availability, improving message throughput.

请参见图2,是本发明实施例的令牌周转方法的实施例流程示意图,本实施例中是在逻辑令牌传递环内,每一个节点执行的令牌周转方法,所述方法包括:Please refer to FIG. 2 , which is a schematic flow chart of an embodiment of a token turnover method according to an embodiment of the present invention. In this embodiment, a token turnover method executed by each node within a logical token transfer ring, the method includes:

S201:当前节点接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息。该节点可以发送一条或者多条消息。S201: After the current node receives the token passed in the logical token passing ring, it sends a message to be sent. The node can send one or more messages.

S202:基于所述节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中。所述节点周转记录信息保存在所述令牌中,该节点周转记录信息可以以节点周转表的形式表示。S202: Based on the number of messages sent by the node in the token turnover process of the current round, record the number of messages sent in the current round in the node turnover record information corresponding to the node identifier in the token. The node turnover record information is stored in the token, and the node turnover record information may be expressed in the form of a node turnover table.

S203:根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。S203: Pass the updated token to the corresponding next node according to the node turnover sequence indicated by the node turnover record information in the token.

本发明实施例中的令牌保存有节点周转记录信息,每一个令牌在每一轮获取到令牌发送消息后,会将本轮发送的消息的数量记录在所述节点周转顺序中,以便逻辑令牌传递环内的令牌发起节点能够根据该节点周转顺序中记录的数量信息安排节点周转顺序。The tokens in the embodiments of the present invention store node turnover record information, and each token will record the number of messages sent in the current round in the node turnover order after each token obtains the token sending message in each round, so that The token initiating nodes in the logical token transfer ring can arrange the node turnover sequence according to the quantity information recorded in the node turnover sequence.

下面结合图3和图4对本发明的令牌周转控制方法进行详细描述,图3是本发明的令牌周转控制方法的第二实施例流程示意图,本实施例中,所述方法具体包括:The token turnover control method of the present invention will be described in detail below in conjunction with FIG. 3 and FIG. 4. FIG. 3 is a schematic flow chart of the second embodiment of the token turnover control method of the present invention. In this embodiment, the method specifically includes:

S301:令牌发起节点在每一轮获取到令牌后,根据令牌中的所述节点周转记录信息中记录的每一个节点本轮的消息发送数量更新令牌发起节点本地维护的历史记录信息中每一个节点对应的累计消息发送数量。S301: After the token initiating node obtains the token in each round, update the historical record information locally maintained by the token initiating node according to the number of messages sent by each node in the current round recorded in the node turnover record information in the token The cumulative number of messages sent corresponding to each node in .

S302:令牌发起节点在M轮令牌周转结束后,将所述历史记录信息所记录的每一个节点对应的累计消息发送数量作为逻辑令牌传递环内每一个节点的消息发送情况的历史记录信息。S302: After the M rounds of token turnover, the token originating node takes the cumulative message sending quantity corresponding to each node recorded in the historical record information as the historical record of the message sending situation of each node in the logical token transfer ring information.

所述M的值为预设值,其可根据用户需求进行修改调整。The value of M is a preset value, which can be modified and adjusted according to user requirements.

令牌发起节点在创建令牌的同时,在令牌中保存并维护节点周转记录信息,该节点周转距离信息可以以节点周转表的形式表示,具体的,该节点周转表中可以包括节点标识以及该节点标识对应的节点的本轮消息发送数量的表项,并且在本实施例中,该节点周转表还包括周转标志,该周转标志用来表示相应节点为很少发送消息或者不发送消息的冷节点,或者为常发送消息的正常节点,当周转标志设置为1时则相应的节点为正常节点,令牌循环时经过该节点,当周转标志位为0时则相应的节点为冷节点,令牌循环时跳过该节点。The token originating node saves and maintains the node turnover record information in the token while creating the token. The node turnover distance information can be expressed in the form of a node turnover table. Specifically, the node turnover table can include node identification and The node identifies the entry of the number of messages sent by the corresponding node in this round, and in this embodiment, the node turnover table further includes a turnover flag, which is used to indicate that the corresponding node rarely sends messages or does not send messages Cold nodes, or normal nodes that often send messages, when the turnover flag is set to 1, the corresponding node is a normal node, and the token passes through this node when the token is cycled, and when the turnover flag is 0, the corresponding node is a cold node. This node is skipped when the token is cycled.

当所述节点周转记录信息以节点周转表的形式表示时,该节点周转表指示节点周转顺序的方式为:按照表项中记录的节点标识的顺序及其周转标志,确定节点周转顺序。When the node turnover record information is expressed in the form of a node turnover table, the node turnover table indicates the node turnover sequence by: determining the node turnover sequence according to the sequence of node identifiers and their turnover flags recorded in the entry.

令牌发起节点在令牌中维护节点周转记录信息的同时,在本地还设置维护有历史记录信息,该历史记录信息包括节点标识、累计消息发送数量以及周转标识位,令牌发起节点在所述历史记录信息中记录每一个节点发送消息的累计数量。其中,在本实施例中,所述历史记录信息以历史记录表的形式表示。While the token originating node maintains the node turnover record information in the token, it also maintains historical record information locally. The historical record information includes node identification, the cumulative number of messages sent and the turnover identification bit. The cumulative number of messages sent by each node is recorded in the historical record information. Wherein, in this embodiment, the historical record information is represented in the form of a historical record table.

其中,记录每一个节点每一轮消息发送数量是通过:每一个节点在获取到令牌并发送消息后,将本次发送消息的数量记录到所述节点周转记录信息上本节点对应的表项中。Among them, recording the number of messages sent by each node in each round is through: after each node obtains the token and sends the message, it records the number of messages sent this time in the entry corresponding to the node on the node turnover record information middle.

具体的,下述的表1为节点周转记录信息的其中一种表现形式,图4为其中一种逻辑令牌传递环内令牌在节点中的传递顺序示意图,节点A为逻辑令牌传递环上的令牌发起者,所述S301和所述S302具体可包括以下步骤:Specifically, the following Table 1 is one of the manifestations of node turnover record information, and Figure 4 is a schematic diagram of the transfer sequence of tokens in nodes in one of the logical token passing rings, and node A is a logical token passing ring The token initiator above, the S301 and the S302 may specifically include the following steps:

在第一轮的令牌周转过程中,各个节点的周转标识均为1,则节点周转记录信息指示的节点周转顺序为图4中的节点A->节点B->节点C->节点D->节点A。In the first round of token turnover process, the turnover identifier of each node is 1, and the node turnover sequence indicated by the node turnover record information is node A->node B->node C->node D- in Figure 4 > Node A.

节点A在获取到令牌后,发送了10条消息,节点A便在表1所示的节点周转表中对应的本轮消息发送数量中记录10条。节点A将令牌传递给所述节点B,所述节点B在获取到令牌后发送了20条消息,节点B将令牌传递给所述节点C,所述节点C没有发送消息,记录的数量为0,节点C将令牌传递给所述节点D,所述节点D没有发送消息,记录的数量为0。节点D最后将令牌传回给所述节点A。After node A obtains the token, it sends 10 messages, and node A records 10 messages in the corresponding number of messages sent in this round in the node turnover table shown in Table 1. Node A passed the token to the node B, and the node B sent 20 messages after obtaining the token, and the node B passed the token to the node C, and the node C did not send a message, and the recorded The number is 0, node C passes the token to the node D, the node D does not send a message, and the number of records is 0. Node D finally passes the token back to said node A.

所述节点A在第一轮令牌周转结束后获取到令牌后,令牌中的令牌周转表如表1所述。After the node A obtains the token after the first round of token turnover, the token turnover table in the token is as described in Table 1.

表1:Table 1:

  节点标识 Node ID   本轮消息发送数量 The number of messages sent in this round   周转标志位 Turnover flag   节点A Node A   10 10   1 1   节点B Node B   20 20   1 1   节点C Node C   0 0   1 1   节点D Node D   0 0   1 1

作为令牌发起节点的节点A根据该节点周转表的记录,在历史记录表中统计本轮令牌周转过程中每一个节点的历史发送情况即消息的累计发送数量,得到如表2所述的历史记录表。Node A, as the token originating node, counts the historical sending status of each node in the current round of token turnover process, that is, the cumulative number of messages sent, according to the record of the node turnover table in the history record table, and obtains as described in Table 2 history table.

表2:Table 2:

  节点标识 Node ID   累计消息发送数量 Cumulative number of messages sent   周转标志位 Turnover flag   节点A Node A   10 10   1 1   节点B Node B   20 20   1 1   节点C Node C   0 0   1 1   节点D Node D   0 0   1 1

在统计完成后,初始化所述节点周转表,然后再次根据需要发送消息并在节点周转记录信息中记录本轮消息发送数量,进入下一轮令牌周转,并在周转结束获取到令牌后,再次根据节点周转记录信息更新历史记录信息中每个节点对应的累计消息发送数量。After the statistics are completed, initialize the node turnover table, then send messages again as needed and record the number of messages sent in this round in the node turnover record information, enter the next round of token turnover, and obtain tokens at the end of the turnover, The accumulated message sending quantity corresponding to each node in the historical record information is updated again according to the node turnover record information.

再执行下一轮令牌循环以记录累计消息发送数量,在预设的M轮令牌周转结束后,令牌发起节点更新得到最终的历史记录表,以表3为例。Then execute the next round of token circulation to record the cumulative number of messages sent. After the preset M rounds of token turnover are completed, the token originating node is updated to obtain the final history record table. Take Table 3 as an example.

表3:table 3:

  节点标识 Node ID   累计消息发送数量 Cumulative number of messages sent   周转标志位 Turnover flag   节点A Node A   30 30   1 1   节点B Node B   45 45   1 1   节点C Node C   0 0   1 1   节点D Node D   0 0   1 1

在M轮令牌周转结束后,令牌发起节点根据如上述的表3所示的历史记录信息即可确定每一个节点对应的累计消息发送数量,如表3所述:在过去的M轮令牌循环中,令牌经过了每一个节点,并且相应节点的消息发送数量为:节点A为30条,节点B为45条,节点C和节点D为0条。After the M round of token turnover is over, the token originating node can determine the cumulative number of messages sent by each node according to the historical record information shown in Table 3 above, as described in Table 3: In the past M rounds In the card cycle, the token passes through each node, and the number of messages sent by the corresponding node is: 30 for node A, 45 for node B, and 0 for node C and node D.

S303:将M轮令牌周转结束后的所述历史记录信息中记录的累计消息发送数量低于或等于预设的数量阈值的节点记录为冷节点。S303: Record the nodes whose cumulative number of message sending recorded in the historical record information after M rounds of token turnover is lower than or equal to a preset number threshold as cold nodes.

所述预设的数量阈值由用户根据实际情况设置,本实施例中设置为0,即仅对没有发送消息的节点进行控制。The preset quantity threshold is set by the user according to the actual situation. In this embodiment, it is set to 0, that is, only nodes that do not send messages are controlled.

所述令牌发起节点A更新本地存储的节点历史记录信息,得到如表4所述的节点历史记录信息。The token initiating node A updates the locally stored node history record information to obtain the node history record information as described in Table 4.

表4:Table 4:

S304:在所述节点周转记录信息中标记出所述冷节点,并根据标记出的冷节点对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,在更新后的节点周转顺序中不包括所述被标记出的冷节点。S304: Mark the cold node in the node turnover record information, and update the node turnover sequence indicated in the node turnover record information contained in the token according to the marked cold node, and update the node turnover sequence does not include the marked cold nodes.

具体的,所述S304具体可以包括:Specifically, the S304 may specifically include:

在所述节点周转记录信息中标记出所述冷节点;标记冷节点的方式是通过将表项中相应节点标识对应的周转标识置为跳过标识0。The cold node is marked in the node turnover record information; the way of marking the cold node is by setting the turnover identifier corresponding to the corresponding node identifier in the entry as a skip identifier 0.

将所述节点周转记录信息中冷节点对应的周转标志置为跳过标志,完成对令牌中包含的节点周转记录信息中指示的节点周转顺序的更新,以便于在接下来的N轮令牌周转过程中按照所述节点周转记录信息上的节点周转顺序传递令牌时,将跳过周转标志为跳过标志的冷节点传递令牌。Set the turnover flag corresponding to the cold node in the node turnover record information as a skip flag, and complete the update of the node turnover sequence indicated in the node turnover record information contained in the token, so that in the next N rounds of tokens During the turnover process, when the tokens are passed according to the node turnover sequence on the node turnover record information, the cold nodes with the skip turnover mark as the skip flag will be skipped and the tokens will be delivered.

所述令牌发起节点A再初始化节点周转表,并设置节点C和节点D的周转标志位,在节点周转表中标记出冷节点的节点C和节点D,完成令牌中包含的节点周转记录信息中指示的节点周转顺序的更新,得到如表5所示的节点周转表,更新后的节点周转顺序为节点A->节点B->节点A。The token initiating node A re-initializes the node turnover table, and sets the turnover flags of node C and node D, marks the node C and node D of the cold node in the node turnover table, and completes the node turnover record contained in the token The node turnover order indicated in the information is updated to obtain the node turnover table shown in Table 5, and the updated node turnover order is node A->node B->node A.

表5:table 5:

  节点标识 Node ID   本轮消息发送数量 The number of messages sent in this round   周转标志位 Turnover flag   节点A Node A   0 0   1 1   节点B Node B   0 0   1 1   节点C Node C   0 0   0 0   节点D Node D   0 0   0 0

根据初始化的表5所示的节点周转表中根据节点标识的记录顺序及其周转表位指示的节点周转顺序是在节点A和节点B之间传递包含该节点周转表的令牌。即节点A根据令牌发送消息,然后根据周转标志位,将令牌传递给表中下一项记录的节点标识且周转标志位为1的所述节点B,节点B发送了消息后,根据周转标志位,跳过被标记为冷节点的节点C和节点D,直接传递给节点A。According to the record order of the node identification and the node turnover order indicated by the node turnover table bit in the node turnover table shown in the initialized table 5, the token containing the node turnover table is passed between node A and node B. That is, node A sends a message according to the token, and then passes the token to the node B whose node ID is recorded in the next item in the table and whose turnover flag is 1 according to the turnaround flag. After sending the message, node B sends the message according to the turnaround Flag bit, skip node C and node D marked as cold nodes, and pass it directly to node A.

S305:在接下来的N轮令牌周转结束后,将所述节点周转记录信息中置为跳过标志的冷节点的周转标志设置为正常标识,以便于在接下来的令牌周转过程中按照所述节点周转记录信息上的节点周转顺序传递令牌时,令牌经过该节点。所述N值也可根据具体情况进行设置。S305: After the end of the next N rounds of token turnover, set the turnover flag of the cold node set as a skip flag in the node turnover record information to a normal flag, so that in the next token turnover process according to When the node turnover sequence on the node turnover record information passes the token, the token passes through the node. The N value can also be set according to specific conditions.

在接下来的N轮令牌周转过程中,节点A和节点D可不用记录其自身的本轮消息发送数量,直至N轮周转结束。During the next N rounds of token turnover, node A and node D do not need to record the number of their own messages sent in this round until the end of N rounds of turnover.

S306:初始化所述节点周转记录信息以及所述历史记录信息,以再次执行上述的S301至S305。S306: Initialize the node turnover record information and the historical record information, so as to execute the above S301 to S305 again.

重复所述S301-S306直至逻辑令牌传递环中的各个节点停止使用。Repeat S301-S306 until each node in the logic token passing ring stops using.

节点A在检测到令牌在节点A和节点B之间循环N轮后,初始化所述节点周转记录信息以及所述历史记录信息,并将所述节点周转记录信息中置为跳过标志的冷节点的周转标志设置为正常标识。重新执行所述S301至S305。After node A detects that the token circulates between node A and node B for N rounds, it initializes the node turnover record information and the history record information, and sets the node turnover record information as the cold key of the skip flag. The node's turnaround flag is set to the normal flag. Re-execute said S301 to S305.

需要说明的是,节点A作为令牌发起节点,周转标志位保持为正常标识1。It should be noted that node A acts as a token originating node, and the turnover flag remains as a normal flag of 1.

通过上述实施例的描述可知,本发明具有以下优点:As can be seen from the description of the foregoing embodiments, the present invention has the following advantages:

一方面,相对于现有技术中,节点每次需要等待拿到令牌之后才能发送消息,这样造成了节点发送消息有一定的延时,节点规模越大,延时越高;假如某个节点突然有大量的消息需要发送,节点需要经过多次令牌周转才能将消息全部发送完,则越位于后面的消息的发送延时越高。在某些对等型架构中,会存在一个主控节点master(例如citrix XenServer中的master、pacemaker中的DC等)。作为主控节点,通常需要处理更多的业务(比如数据同步等),相比于非主控节点,主控节点有更多消息需要发送,非主控节点需要发送的消息则比较少。如果在对等型架构中采用单环有序协议(totem),基于上述场景,在大多数时间里,非主控节点拿到令牌没有动作,而主控节点上的大量消息则会积压,有消息延迟的情况,本发明实施例中,提出一种能够提升主控节点性能、提高集群系统的消息吞吐量的方法,具体的,能够根据每一个节点的历史发送情况,选择性地跳过一些消息发送量较少的节点,使令牌在在消息发送需求的节点之间快速传递,从而实现了让有消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了集群系统的消息吞吐量。On the one hand, compared with the existing technology, the node needs to wait for the token to send a message each time, which causes a certain delay for the node to send a message. The larger the node size, the higher the delay; if a node Suddenly there are a large number of messages to be sent, and the node needs to go through multiple token turnovers to send all the messages, and the later the message, the higher the sending delay. In some peer-to-peer architectures, there will be a master control node master (such as the master in citrix XenServer, the DC in pacemaker, etc.). As a master node, it usually needs to process more services (such as data synchronization, etc.). Compared with the non-master node, the master node has more messages to send, and the non-master node needs to send fewer messages. If a single-ring order protocol (totem) is adopted in the peer-to-peer architecture, based on the above scenario, in most of the time, the non-master node does not take any action after getting the token, while a large number of messages on the master node will be backlogged, In the case of message delay, in the embodiment of the present invention, a method that can improve the performance of the master control node and the message throughput of the cluster system is proposed. Specifically, it can selectively skip the message according to the historical sending situation of each node. Some nodes with a small amount of message sending enable tokens to be quickly passed between nodes that need to send messages, thereby enabling nodes that need to send messages to send messages faster, reducing the backlog of messages on these nodes, and reducing the number of messages Delay, improve node performance and availability, and improve the message throughput of the cluster system.

另一方面,本发明实施例中,在使用令牌环机制的集群系统中,通过本发明可以让有消息发送需求的节点(本实施例中以主控节点示意)更快地发送消息,减少瞬间大量消息在节点上的积压,降低消息延时,提高节点性能和可用性,一定程度上提高了集群系统的消息吞吐量。On the other hand, in the embodiment of the present invention, in the cluster system using the Token Ring mechanism, the present invention can allow the node that needs to send the message (indicated by the master control node in this embodiment) to send the message faster, reducing The backlog of a large number of messages on the node in an instant reduces message delay, improves node performance and availability, and improves the message throughput of the cluster system to a certain extent.

下面对本发明的令牌控制装置进行详细描述。The token control device of the present invention will be described in detail below.

请参见图5,是本发明的令牌周转控制装置的第一实施例结构组成示意图,本实施例中,逻辑令牌传递环内包括多个节点,所述令牌周转控制装置用于负责令牌的创建和对令牌周转机制进行维护,其设置在令牌发起节点中,令牌发起节点发出令牌后,令牌在环内循环,环上的每个节点在接收到令牌时发送消息。Please refer to FIG. 5 , which is a schematic structural diagram of the first embodiment of the token turnover control device of the present invention. In this embodiment, the logical token transfer ring includes a plurality of nodes, and the token turnover control device is used to The creation of tokens and the maintenance of the token turnover mechanism are set in the token originating node. After the token originating node issues the token, the token circulates in the ring, and each node on the ring sends a token when it receives the token. information.

如图5所示,所述令牌周转控制装置包括:As shown in Figure 5, the token turnover control device includes:

获取模块11,用于获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;The obtaining module 11 is used to obtain the historical record information of the message sending situation of each node in the current logical token passing ring during the past M rounds of token turnover;

具体的,所述获取模块11获取每一个节点的历史发送情况的记录信息的方式可以为:在令牌中保存节点周转记录信息,在发出令牌进行循环的过程中,每一个节点在获取到令牌并发送消息后,将将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中。在本轮循环结束后,令牌回到设置有所述令牌周转控制装置的令牌发起节点时,所述获取模块11根据本轮循环后得到的节点周转记录信息,对每一个节点的历史消息发送情况进行统计更新并记录,在达到预设的循环次数阈值时,对每一个节点记录的统计结果即为每一个节点的历史发送情况记录信息。Specifically, the acquisition module 11 can acquire the record information of the historical transmission situation of each node by: saving the node turnover record information in the token, and during the process of issuing the token for circulation, each node obtains After the token is sent and the message is sent, the number of messages sent in this round will be recorded in the node turnover record information corresponding to the node ID in the token. After the current cycle ends, when the token returns to the token initiating node provided with the token turnover control device, the acquisition module 11 checks the history of each node according to the node turnover record information obtained after the current cycle The message sending status is statistically updated and recorded. When the preset cycle number threshold is reached, the statistical result recorded for each node is the historical sending status record information of each node.

例如在本轮令牌循环中,每一个节点在获取到令牌并发送消息后,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中,在本轮循环结束,所述获取模块11将本轮循环中节点周转记录信息上记录的每一个节点所对应的已发送消息的数量与本地已记录的对应节点的已发送消息的数量进行累加统计,得到本轮循环结束后的每一个节点已发送消息的总数并记录,在经过预设的M轮令牌循环后,所述获取模块11记录的每一个节点已发送消息的总数即为每一个节点的消息发送情况历史记录信息。For example, in this round of token circulation, after each node obtains a token and sends a message, it records the number of messages sent in this round into the node turnover record information corresponding to the node ID in the token, At the end of the current cycle, the acquisition module 11 accumulates and counts the number of sent messages corresponding to each node recorded on the node turnover record information in the current cycle and the number of sent messages of the corresponding node recorded locally , obtain and record the total number of messages sent by each node after the end of the current cycle, after the preset M rounds of token cycles, the total number of messages sent by each node recorded by the acquisition module 11 is each The node's message sending history information.

上述的节点周转记录信息可以以节点周转表的形式表示,当然也可以是其他的例如脚本文件、元数据等形式表示。The above-mentioned node turnover record information can be expressed in the form of a node turnover table, and of course it can also be expressed in other forms such as script files and metadata.

更新模块12,用于根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序。The update module 12 is configured to update the node turnover sequence indicated in the node turnover record information contained in the token according to the historical record information, and the node turnover record information is used to indicate that the token is in the logical token transfer The order of node turnover within the ring.

所述更新模块12可以根据所述获取模块11获取的历史记录信息,确定逻辑令牌传递环中在历史的M轮令牌周转传递过程中很少发送消息或者不发送消息的节点,在更新后的节点周转顺序中,在后续N轮令牌周转过程中,跳过这些很少发送消息或者不发送消息的节点,即不向很少发送消息或者不发送消息的节点传递令牌,剥削这些节点发送消息的权利,方便其他常发送消息的节点发送数据,降低常发送消息的节点上的消息发送时延。The update module 12 can determine the nodes in the logical token passing ring that rarely send messages or do not send messages during the historical M rounds of token turnover transfer according to the historical record information obtained by the obtaining module 11. After the update In the node turnover order of , in the subsequent N rounds of token turnover, skip these nodes that rarely send messages or do not send messages, that is, do not pass tokens to nodes that rarely send messages or do not send messages, and exploit these nodes The right to send messages is convenient for other nodes that often send messages to send data, and reduces the message sending delay on nodes that often send messages.

发送模块13,用于按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点。The sending module 13 is configured to deliver the updated token to the corresponding next node according to the node turnover sequence indicated by the updated node turnover record information.

实施本发明实施例,具有如下有益效果:Implementing the embodiment of the present invention has the following beneficial effects:

能够根据每一个节点的历史发送情况来更新令牌在节点中的周转顺序,可以让有消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了消息吞吐量。It is possible to update the turnover sequence of tokens in nodes according to the historical sending status of each node, which can allow nodes with message sending needs to send messages faster, reduce the backlog of messages on these nodes, reduce message delay, and improve node performance and availability, improving message throughput.

再请参见图6,是本发明的令牌周转控制装置的第二实施例结构组成示意图,在本实施例中,所述令牌周转控制装置包括上述装置第一实施例中的获取模块11,更新模块12以及发送模块13,进一步的,在本实施例中所述令牌周转控制装置中的获取模块11具体可以包括:Please refer to FIG. 6 again, which is a schematic structural diagram of the second embodiment of the token turnover control device of the present invention. In this embodiment, the token turnover control device includes the acquisition module 11 in the first embodiment of the above-mentioned device, The update module 12 and the sending module 13, further, the acquisition module 11 in the token turnover control device described in this embodiment may specifically include:

统计单元111,用于在每一轮获取到令牌后,根据令牌中的所述节点周转记录信息中记录的每一个节点本轮的消息发送数量更新令牌发起节点本地维护的历史记录信息中每一个节点对应的累计消息发送数量;The statistical unit 111 is used to update the historical record information locally maintained by the token originating node according to the number of messages sent by each node in the current round recorded in the node turnover record information in the token after obtaining the token in each round The cumulative number of messages sent corresponding to each node in ;

获取单元112,用于在M轮令牌周转结束后,将所述历史记录信息所记录的每一个节点对应的累计消息发送数量作为逻辑令牌传递环内每一个节点的消息发送情况的历史记录信息;The acquisition unit 112 is configured to use the cumulative number of message transmissions corresponding to each node recorded in the historical record information as the historical record of the message transmission status of each node in the logical token passing ring after the M rounds of token turnover are completed information;

其中,逻辑令牌传递环内每一个节点在本轮的令牌周转过程中的消息发送数量是通过如下方法记录的:每一个节点在获取到令牌并发送消息后,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中Among them, the number of messages sent by each node in the logical token passing ring during the token turnover process of the current round is recorded by the following method: after each node obtains the token and sends the message, it will send the message sent in the current round The number of is recorded in the node turnover record information corresponding to the node ID in the token

进一步具体的,所述更新模块12包括:Further specifically, the updating module 12 includes:

确定单元121,用于将M轮令牌周转结束后的所述历史记录信息中记录的累计消息发送数量低于或等于预设的数量阈值的节点记录为冷节点;The determining unit 121 is configured to record the nodes whose cumulative number of message sending recorded in the historical record information after M rounds of token turnover is lower than or equal to a preset number threshold as cold nodes;

更新单元122,用于在所述节点周转记录信息中标记出所述冷节点,并根据标记出的冷节点对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,在更新后的节点周转顺序中不包括所述被标记出的冷节点;其中,所述N值为预设值。The update unit 122 is configured to mark the cold node in the node turnover record information, and update the node turnover order indicated in the node turnover record information contained in the token according to the marked cold node, after updating The marked cold node is not included in the node turnover order of ; wherein, the N value is a preset value.

其中,所述更新单元122具体是用于将所述确定单元确定的冷节点在令牌中的所述节点周转记录信息中对应的周转标志置为跳过标志,以完成对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新。Wherein, the updating unit 122 is specifically used to set the turnover flag corresponding to the cold node determined by the determining unit in the node turnover record information in the token as a skip flag, so as to complete the verification of the The node turnover sequence indicated in the node turnover record information is updated.

节点周转记录信息中的周转标志用于记录正常节点和冷节点,在各节点传递令牌时,节点是根据周转表上所列的节点标识的顺序,以及根据所述周转标志的值,来确定将令牌传递给哪一个节点。The turnover flag in the node turnover record information is used to record normal nodes and cold nodes. When each node passes the token, the node is determined according to the order of the node identification listed on the turnover table and the value of the turnover flag Which node to pass the token to.

具体以上述的表5为例,作为令牌发起节点的节点A设置有本实施例中的所述令牌周转控制装置,表5指示了令牌传递顺序为节点A到节点B到节点C到节点D,节点A在对应表项中记录了本轮消息发送数量后,确定节点B的周转标志为正常标志1,则将令牌传递给所述节点B。而当节点B记录完本轮消息发送数量后,确定节点C以及节点D的周转标志均为跳过标志0,因此,节点B会跳过节点C和节点D,将令牌直接传递给A。Specifically taking the above-mentioned Table 5 as an example, node A as a token originating node is provided with the token turnover control device in this embodiment, and Table 5 indicates that the order of token transfer is from node A to node B to node C to After node D and node A record the number of messages sent in this round in the corresponding entries, it is determined that the turnaround flag of node B is normal flag 1, and then pass the token to the node B. After node B has recorded the number of messages sent in this round, it is determined that the turnover flags of node C and node D are all skip flags 0, so node B will skip node C and node D, and pass the token directly to A.

最后在令牌周转N轮结束后,所述令牌周转控制装置的所述更新单元122还用于将所述节点周转记录信息中置为跳过标志的冷节点的周转标志设置为正常标识,以便于在接下来的令牌周转过程中按照所述节点周转记录信息上的节点周转顺序传递令牌时,令牌经过该节点。Finally, after N rounds of token turnover are completed, the updating unit 122 of the token turnover control device is further configured to set the turnover flag of the cold node set as a skip flag in the node turnover record information as a normal flag, In order to pass the token through the node when passing the token according to the node turnover sequence on the node turnover record information in the next token turnover process.

同时,所述令牌周转控制装置还可包括初始化模块14用于对节点周转信息和历史记录信息进行初始化更新,具体的,At the same time, the token turnover control device may also include an initialization module 14 for initializing and updating node turnover information and historical record information, specifically,

所述初始化模块14,用于初始化所述节点周转记录信息以及所述历史记录信息,并在初始化完成后通知所述获取模块继续执行获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息。The initialization module 14 is configured to initialize the node turnover record information and the history record information, and notify the acquisition module to continue to perform the acquisition of the past M rounds of each node in the current logical token passing ring after the initialization is completed. Historical information about message sending during the token rollover process.

在通过所述初始化模块14初始化所述节点周转记录信息以及所述历史记录信息后,再进入下一轮的令牌周转控制。After the node turnover record information and the history record information are initialized by the initialization module 14, the next round of token turnover control is entered.

具体的,上述的历史记录信息和节点周转记录信息均可以以记录表的形式表示,当然也可以以脚本文件或者元数据等形式标识。Specifically, the above-mentioned historical record information and node turnover record information can be expressed in the form of a record table, and of course can also be identified in the form of a script file or metadata.

再请参见图7,是本发明的基于令牌周转发送消息的节点的结构组成示意图,本实施例中,所述基于令牌周转发送消息的节点是作为逻辑令牌传递环内,除令牌发起节点以外的其他节点,所述节点包括:Please refer to FIG. 7 again, which is a schematic diagram of the structure of a node that sends messages based on token turnover in the present invention. In this embodiment, the node that sends messages based on token turnover is used as a logical token transfer ring, except Nodes other than the initiating node, including:

通信模块21,用于接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息。该基于令牌周转发送消息的节点可以发送一条或者多条消息。The communication module 21 is configured to send a message to be sent after receiving the token passed in the logical token passing ring. The node that sends messages based on token turnover may send one or more messages.

记录模块22,用于基于所述节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中。所述节点周转记录信息保存在所述令牌中,该节点周转记录信息可以以节点周转表的形式表示。Recording module 22, configured to record the number of messages sent in this round into the node turnover record information corresponding to the node identifier in the token based on the number of messages sent by the node in the token turnover process of the current round middle. The node turnover record information is stored in the token, and the node turnover record information may be expressed in the form of a node turnover table.

所述通信模块21还用于根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。The communication module 21 is further configured to transfer the updated token to the corresponding next node according to the node turnover sequence indicated by the node turnover record information in the token.

本发明实施例中的令牌保存有节点周转记录信息,每一个令牌在每一轮获取到令牌发送消息后,会将本轮发送的消息的数量记录在所述节点周转顺序中,以便逻辑令牌传递环内的令牌发起节点能够根据该节点周转顺序中记录的数量信息安排节点周转顺序。The tokens in the embodiments of the present invention store node turnover record information, and each token will record the number of messages sent in the current round in the node turnover order after each token obtains the token sending message in each round, so that The token initiating nodes in the logical token transfer ring can arrange the node turnover sequence according to the quantity information recorded in the node turnover sequence.

在请参见图8,是本发明的使用令牌环机制的集群系统的结构组成示意图,所述系统具体包括:包括多个节点,所述多个节点包括:主节点(即图8中的master node)和从节点(即图8中的slave node),在本实施例中,所述主节点作为令牌发起节点,用于创建和维护令牌,各个从节点在接收到所述作为令牌发起节点的主节点发出的令牌后,发送待发送的消息,并传递所述令牌,其中具体的,Please refer to FIG. 8 , which is a schematic diagram of the structural composition of the cluster system using the token ring mechanism of the present invention. node) and slave nodes (i.e. slave node in Figure 8), in this embodiment, the master node is used as a token originating node for creating and maintaining tokens, and each slave node receives the token as token After the token issued by the master node of the initiating node, send the message to be sent and pass the token, specifically,

所述主节点,用于获取当前逻辑令牌传递环内每一个节点在过去的M轮令牌周转过程中消息发送情况的历史记录信息;根据所述历史记录信息,对令牌中包含的节点周转记录信息中指示的节点周转顺序进行更新,所述节点周转记录信息用于指示所述令牌在逻辑令牌传递环内的节点周转顺序;按照所述更新后的节点周转记录信息指示的节点周转顺序将所述更新后的令牌传递到对应的下一个节点;The master node is used to obtain the historical record information of each node in the current logic token passing ring in the past M rounds of token turnover process; according to the historical record information, the node contained in the token The node turnover sequence indicated in the turnover record information is updated, and the node turnover record information is used to indicate the node turnover sequence of the token in the logical token transfer ring; according to the node turnover sequence indicated by the updated node turnover record information The turnover sequence passes the updated token to the corresponding next node;

所述从节点,用于接收逻辑令牌传递环内传递过来的令牌后,发送待发送的消息(图8中以MSG1,MSG2,MSG3...示意),基于本节点在本轮的令牌周转过程中发送消息的数量,将本轮发送的消息的数量记录到所述令牌中的与本节点标识对应的节点周转记录信息中,根据所述令牌中的节点周转记录信息所指示的节点周转顺序将更新后的令牌传递到对应的下一个节点。The slave node is used to send the message to be sent after receiving the token passed in the logical token transfer ring (indicated by MSG1, MSG2, MSG3... in FIG. The number of messages sent during the card turnover process, the number of messages sent in this round is recorded in the node turnover record information corresponding to the node identification in the token, according to the node turnover record information in the token The node turnover order of will pass the updated token to the corresponding next node.

具体的,所述的主节点具体可以为上述的令牌周转控制装置的第一实施例中的令牌周转控制装置,或者为上述的令牌周转控制装置的第二实施例中的令牌周转控制装置,所述从节点可以为上述的实施例中的基于令牌周转发送消息的节点。Specifically, the master node may specifically be the token turnover control device in the first embodiment of the above-mentioned token turnover control device, or the token turnover control device in the second embodiment of the above-mentioned token turnover control device In the control device, the slave node may be the node that sends messages based on token turnover in the above embodiment.

对于本发明的所述使用令牌环机制的集群系统,一方面,相对于现有技术中,节点每次需要等待拿到令牌之后才能发送消息,这样造成了节点发送消息有一定的延时,节点规模越大,延时越高;假如某个节点突然有大量的消息需要发送,节点需要经过多次令牌周转才能将消息全部发送完,则越位于后面的消息的发送延时越高。在某些对等型架构中,会存在一个主控节点master(例如citrix XenServer中的master、pacemaker中的DC等)。作为主控节点,通常需要处理更多的业务(比如数据同步等),相比于非主控节点,主控节点有更多消息需要发送,非主控节点需要发送的消息则比较少。For the cluster system using the token ring mechanism of the present invention, on the one hand, compared with the prior art, the node needs to wait to get the token before sending a message, which causes a certain delay for the node to send the message , the larger the node size, the higher the delay; if a node suddenly has a large number of messages to send, and the node needs to go through multiple token turnovers to send all the messages, the further behind the message, the higher the delay . In some peer-to-peer architectures, there will be a master control node master (such as the master in citrix XenServer, the DC in pacemaker, etc.). As a master node, it usually needs to process more services (such as data synchronization, etc.). Compared with the non-master node, the master node has more messages to send, and the non-master node needs to send fewer messages.

如果在对等型架构中采用单环有序协议(totem),基于上述场景,在大多数时间里,非主控节点拿到令牌没有动作,而主控节点上的大量消息则会积压,有消息延迟的情况,本发明实施例中,提出一种能够提升主控节点性能、提高集群系统的消息吞吐量的方法,具体的,能够根据每一个节点的历史发送情况,选择性地跳过一些消息发送量较少的节点,使令牌在在消息发送需求的节点之间快速传递,从而实现了让有消息发送需求的节点更快地发送消息,减少这些节点上消息的积压,降低消息延时,提高节点性能和可用性,提高了集群系统的消息吞吐量。If a single-ring order protocol (totem) is adopted in the peer-to-peer architecture, based on the above scenario, in most of the time, the non-master node does not take any action after getting the token, while a large number of messages on the master node will be backlogged, In the case of message delay, in the embodiment of the present invention, a method that can improve the performance of the master control node and the message throughput of the cluster system is proposed. Specifically, it can selectively skip the message according to the historical sending situation of each node. Some nodes with a small amount of message sending enable tokens to be quickly passed between nodes that need to send messages, thereby enabling nodes that need to send messages to send messages faster, reducing the backlog of messages on these nodes, and reducing the number of messages Delay, improve node performance and availability, and improve the message throughput of the cluster system.

另一方面,本发明实施例中,在使用令牌环机制的集群系统中,通过本发明可以让有消息发送需求的节点(本实施例中以主控节点示意)更快地发送消息,减少瞬间大量消息在节点上的积压,降低消息延时,提高节点性能和可用性,一定程度上提高了集群系统的消息吞吐量。On the other hand, in the embodiment of the present invention, in the cluster system using the Token Ring mechanism, the present invention can allow the node that needs to send the message (indicated by the master control node in this embodiment) to send the message faster, reducing The backlog of a large number of messages on the node in an instant reduces message delay, improves node performance and availability, and improves the message throughput of the cluster system to a certain extent.

本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程,是可以通过计算机程序来指令相关的硬件来完成,所述的程序可存储于一计算机可读取存储介质中,该程序在执行时,可包括如上述各方法的实施例的流程。其中,所述的存储介质可为磁碟、光盘、只读存储记忆体(Read-Only Memory,ROM)或随机存储记忆体(Random Access Memory,RAM)等。Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented through computer programs to instruct related hardware, and the programs can be stored in a computer-readable storage medium. During execution, it may include the processes of the embodiments of the above-mentioned methods. Wherein, the storage medium may be a magnetic disk, an optical disk, a read-only memory (Read-Only Memory, ROM) or a random access memory (Random Access Memory, RAM), etc.

以上所揭露的仅为本发明较佳实施例而已,当然不能以此来限定本发明之权利范围,因此依本发明权利要求所作的等同变化,仍属本发明所涵盖的范围。The above disclosures are only preferred embodiments of the present invention, and certainly cannot limit the scope of rights of the present invention. Therefore, equivalent changes made according to the claims of the present invention still fall within the scope of the present invention.

Claims (11)

1. a token turnover control, is characterized in that, comprising:
Obtain the history information that each node M in the past in current logic token-passing ring takes turns message transmission situation in token circular flow;
According to described history information, upgrade the node turnover order indicated in the node turnover recorded information comprised in token, described node turnover recorded information is used to indicate the node turnover order of described token in logical token passing ring;
The node turnover order indicated according to the node turnover recorded information after described renewal is by the next node of the alternative space after described renewal to correspondence.
2. the method for claim 1, is characterized in that, described node turnover recorded information is also for recording the message quantity forwarded of each node in the token circular flow of epicycle in logical token passing ring;
In described acquisition current logic token-passing ring, in each node M wheel token circular flow in the past, the history information of message transmission situation comprises:
After each is taken turns and gets token, upgrade token according to the message quantity forwarded of each the node epicycle recorded in the described node turnover recorded information in token and initiate the total message quantity forwarded that in the history information of node local maintenance, each node is corresponding;
Take turns after token turnover terminates at M, total message quantity forwarded corresponding to each node recorded by described history information sends the history information of situation as the message of each node in logical token passing ring;
Wherein, the message quantity forwarded of each node in the token circular flow of epicycle records by the following method in logical token passing ring: each node is getting token and after sending message, the quantity of message epicycle sent is recorded in the node turnover recorded information corresponding with this node identification in described token.
3. method as claimed in claim 2, is characterized in that, described according to described history information, carries out renewal comprise the node turnover order indicated in the node turnover recorded information comprised in token:
M is taken turns token turnover terminate after described history information in the total message quantity forwarded that records be cold node less than or equal to the nodes records of the amount threshold preset;
Described cold node is marked in described node turnover recorded information, and according to the cold node marked, the node turnover order indicated in the node turnover recorded information comprised in token is upgraded, the cold node be labeled out described in not comprising in node turnover order in the updated.
4. method as claimed in claim 3, is characterized in that, also comprises the turnover mark for recording each node in described node turnover recorded information;
Describedly in described node turnover recorded information, mark described cold node, and according to the cold node marked, renewal carried out to the node turnover order indicated in the node turnover recorded information comprised in token and comprise:
Described cold node is marked in described node turnover recorded information;
Turnover mark corresponding for cold node in described node turnover recorded information is set to and skips mark, complete the renewal to the node turnover order indicated in the node turnover recorded information comprised in token, so that when ensuing N takes turns in token circular flow the node turnover sequence delivery token had enough to meet the need according to described node in recorded information, turnover will be skipped and will be masked as the cold node transmission token skipping mark.
5. method as claimed in claim 4, is characterized in that, also comprise:
After the turnover of ensuing N wheel token terminates, the turnover traffic sign placement of the cold node skipping mark is set to for normal mark by described node turnover recorded information, so that when having enough to meet the need sequence delivery token according to the node in described node turnover recorded information in ensuing token circular flow, token is through this node;
Node turnover recorded information and described history information described in initialization, again to perform the history information that each node M in the past in described acquisition current logic token-passing ring takes turns message transmission situation in token circular flow.
6. all rotation control apparatus of token, is characterized in that, comprising:
Acquisition module, takes turns the history information of message transmission situation in token circular flow for obtaining each node M in the past in current logic token-passing ring;
Update module, for according to described history information, upgrade the node turnover order indicated in the node turnover recorded information comprised in token, described node turnover recorded information is used to indicate the node turnover order of described token in logical token passing ring;
Sending module, for the node turnover order according to the node turnover recorded information instruction after described renewal by the next node of the alternative space after described renewal to correspondence.
7. device as claimed in claim 6, is characterized in that, described node turnover recorded information is also for recording the message quantity forwarded of each node in the token circular flow of epicycle in logical token passing ring, and described acquisition module comprises:
Statistic unit, after taking turns at each and getting token, upgrade token according to the message quantity forwarded of each the node epicycle recorded in the described node turnover recorded information in token and initiate the total message quantity forwarded that in the history information of node local maintenance, each node is corresponding;
Acquiring unit, for taking turns after token turnover terminates at M, total message quantity forwarded corresponding to each node recorded by described history information sends the history information of situation as the message of each node in logical token passing ring;
Wherein, the message quantity forwarded of each node in the token circular flow of epicycle records by the following method in logical token passing ring: each node is getting token and after sending message, the quantity of message epicycle sent is recorded in the node turnover recorded information corresponding with this node identification in described token.
8. device as claimed in claim 7, it is characterized in that, described update module comprises:
Determining unit, for M is taken turns token turnover terminate after described history information in the total message quantity forwarded that records be cold node less than or equal to the nodes records of the amount threshold preset;
Updating block, for marking described cold node in described node turnover recorded information, and according to the cold node marked, the node turnover order indicated in the node turnover recorded information comprised in token is upgraded, the cold node be labeled out described in not comprising in node turnover order in the updated.
9. device as claimed in claim 8, is characterized in that, also comprises the turnover mark for recording each node in described node turnover recorded information;
Described updating block is specifically set to for corresponding turnover mark in described node turnover recorded information in token of the cold node described determining unit determined and skips mark, upgrades with the node turnover order completed indicating in the node turnover recorded information comprised in token.
10. device as claimed in claim 9, is characterized in that,
Described updating block is also for after the turnover of ensuing N wheel token terminates, the turnover traffic sign placement of the cold node skipping mark is set to for normal mark by described node turnover recorded information, so that when having enough to meet the need sequence delivery token according to the node in described node turnover recorded information in ensuing token circular flow, token is through this node;
Described device also comprises:
Initialization module, for node turnover recorded information and described history information described in initialization, and after initialization completes, notify that in described acquisition module continuation execution acquisition current logic token-passing ring, in each node M wheel token circular flow in the past, message sends the history information of situation.
11. 1 kinds of group systems using token ring mechanism, it is characterized in that, comprise multiple node, described multiple node comprises: host node and from node, wherein,
Described host node, takes turns the history information of message transmission situation in token circular flow for obtaining each node M in the past in current logic token-passing ring; According to described history information, upgrade the node turnover order indicated in the node turnover recorded information comprised in token, described node turnover recorded information is used to indicate the node turnover order of described token in logical token passing ring; The node turnover order indicated according to the node turnover recorded information after described renewal is by the next node of the alternative space after described renewal to correspondence;
Described from node, for after the token that passes in receive logic token-passing ring, send message to be sent, in the token circular flow of epicycle, the quantity of message is sent based on this node, the quantity of the message of epicycle transmission be recorded in the node turnover recorded information corresponding with this node identification in described token, the node turnover order indicated by the node turnover recorded information in described token is by the next node of the alternative space after renewal to correspondence.
CN201210156854.XA 2012-05-18 2012-05-18 Token turnover control method, device and system Expired - Fee Related CN102710481B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201210156854.XA CN102710481B (en) 2012-05-18 2012-05-18 Token turnover control method, device and system
PCT/CN2012/084234 WO2013170592A1 (en) 2012-05-18 2012-11-07 Token turnover control method, device and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210156854.XA CN102710481B (en) 2012-05-18 2012-05-18 Token turnover control method, device and system

Publications (2)

Publication Number Publication Date
CN102710481A CN102710481A (en) 2012-10-03
CN102710481B true CN102710481B (en) 2015-07-08

Family

ID=46903051

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210156854.XA Expired - Fee Related CN102710481B (en) 2012-05-18 2012-05-18 Token turnover control method, device and system

Country Status (2)

Country Link
CN (1) CN102710481B (en)
WO (1) WO2013170592A1 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102710481B (en) * 2012-05-18 2015-07-08 华为技术有限公司 Token turnover control method, device and system
CN104320427A (en) * 2014-09-22 2015-01-28 国家电网公司 Distributed group communication method for relay protection system multi-agent
US10402360B2 (en) 2016-06-10 2019-09-03 Johnson Controls Technology Company Building management system with automatic equipment discovery and equipment model distribution
CN106851543A (en) * 2017-02-23 2017-06-13 宇龙计算机通信科技(深圳)有限公司 A kind of message broadcasting method and device
CN110912794B (en) * 2019-11-15 2021-07-16 国网安徽省电力有限公司安庆供电公司 Approximate matching strategy based on token set

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1578049A2 (en) * 2004-03-19 2005-09-21 Fujitsu Limited Scheduling token-controlled data transmissions in communication networks
CN101286917A (en) * 2008-04-25 2008-10-15 南昌大学 A method of prolonging the lifetime of heterogeneous wireless sensor networks based on dormancy mechanism
CN102291309A (en) * 2011-08-26 2011-12-21 华为技术有限公司 Token ring based network flow control method and system and node
CN102387082A (en) * 2011-11-25 2012-03-21 西安电子科技大学 Flow-classification-based grouping flow control system and control method

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5365513A (en) * 1993-01-11 1994-11-15 John Fluke Mfg. Co. Token ring local area network testing apparatus for matching its speed to ring speed
CN102710481B (en) * 2012-05-18 2015-07-08 华为技术有限公司 Token turnover control method, device and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1578049A2 (en) * 2004-03-19 2005-09-21 Fujitsu Limited Scheduling token-controlled data transmissions in communication networks
CN101286917A (en) * 2008-04-25 2008-10-15 南昌大学 A method of prolonging the lifetime of heterogeneous wireless sensor networks based on dormancy mechanism
CN102291309A (en) * 2011-08-26 2011-12-21 华为技术有限公司 Token ring based network flow control method and system and node
CN102387082A (en) * 2011-11-25 2012-03-21 西安电子科技大学 Flow-classification-based grouping flow control system and control method

Also Published As

Publication number Publication date
WO2013170592A1 (en) 2013-11-21
CN102710481A (en) 2012-10-03

Similar Documents

Publication Publication Date Title
CN102710481B (en) Token turnover control method, device and system
CN104205078B (en) The Remote Direct Memory of delay with reduction accesses
US20240248759A1 (en) Scheduling of a plurality of graphic processing units
US9501512B2 (en) Optimizing storage in a publish / subscribe environment
WO2021031473A1 (en) Blockchain asset processing method based on multiple asset models and related device
CN109684099B (en) Message processing method and device
CN106204136A (en) A kind of advertisement delivery system and advertisement placement method
TW201104439A (en) Suspension of memory operations for reduced write latency in memory arrays
US9686134B2 (en) Method and configuration center server for configuring server cluster
CN108574706A (en) Method and device for pushing media files
CN108270581B (en) Shared resource charging processing method and device
CN103152390A (en) Method and device and nodes and system for node configuration of distributed storage system
CN105898442A (en) Advertisement pre-downloading method and system, terminal equipment and push server
WO2020256831A1 (en) Smart contract information redirect to updated version of smart contract
CN114565502A (en) GPU resource management method, scheduling method, device, electronic equipment and storage medium
CN103577469A (en) Database connection multiplexing method and device
CN110018792B (en) Method and device for processing data to be landed, electronic equipment and storage medium
CN112995700B (en) Method and device for processing electronic resources and electronic equipment
US20180027049A1 (en) Computing system and method of operating the computer system
CN116705101B (en) Data processing method of multi-PSRAM (particle random Access memory) particle chip, electronic equipment and storage medium
CN101196833B (en) Method and apparatus for memory utilization
CN107479900A (en) A kind of hot plug software scenario suitable for real time operating system
CN115328666B (en) Device scheduling method, system, electronic device and computer readable storage medium
CN105183666A (en) Scheduling control method, device and system
CN102708002B (en) Display management method of video card in baseboard management controller (BMC) s, and server

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150708

Termination date: 20180518

CF01 Termination of patent right due to non-payment of annual fee