CN115550453A - Queuing method and queuing system for target operations - Google Patents

Abstract

A queuing method and system for target operations are disclosed. The queuing method comprises the following steps: generating an initial queuing identifier by each client based on the predetermined priority of the client, and changing the queuing identifier based on the predetermined priority of the target operation and the time of detecting the request under the condition that the target operation request is detected; the server executes the following steps at preset time intervals: acquiring a queuing mark from each client, sequencing the queuing marks to generate a queuing response indicating the queuing mark which is arranged to the head, and broadcasting the queuing response to each client; and identifying, by each client, whether the client is a client corresponding to the queuing identifier sorted to the top in the case where the queuing identifier thereof is not the initial queuing identifier, and controlling execution of a target operation thereof in the case where the client is the client corresponding to the queuing identifier sorted to the top.

Description

Queuing method and queuing system for target operations

technical field

The present disclosure designs a queuing method and queuing system for target operations.

Background technique

With the advancement of enterprise informatization, intelligent applications based on big data, machine learning, and artificial intelligence are increasingly being used in the industrial field. Process units in industrial systems are also increasingly controlled by computing devices such as programmable logic controllers (PLCs), computers, smart devices, etc., to automatically and flexibly perform a large number of different target operations.

However, it is common that a master process unit is designed to serve two or more slave process units, but is limited by its service capability and can only serve one slave process unit at a time. When the two or more target operations requested from the process units are conflicting to implement, it is necessary to queue these target operations.

Contents of the invention

An aspect of the present disclosure provides a queuing method for target operations. The method includes: generating, by each of a plurality of clients, an initial queuing identifier based on a predetermined priority of the client, and in the case of detecting a request to perform a target operation, based on the Change the queuing identifier by predetermined priority and the time when the request is detected; by the server associated with each client in the plurality of clients, every predetermined time interval: from each client The terminal acquires the queuing IDs of the clients, sorts the acquired queuing IDs to generate a queuing response, the queuing response indicates the queuing ID sorted to the first place, and broadcasts the queuing response to each client; And by each client in a plurality of clients, in the case that its queuing identifier is not the initial queuing identifier, identify whether the client is corresponding to the queue identifier sorted to the first place indicated by the queuing response , and in the case of identifying that the client is the client corresponding to the first-ranked queuing identifier indicated by the queuing response, controlling the execution of its target operation.

According to another aspect of the present disclosure, a queuing system for object operations is provided. The queuing system includes: a plurality of clients, each of which is configured to generate an initial queuing identifier based on a predetermined priority of the client, and if a request to perform a target operation is detected, based on the The predetermined priority of the target operation and the time when the request is detected to change the queuing identifier; and the server is configured to perform every predetermined time interval: obtain the queuing IDs of each client, sorting the acquired queuing IDs to generate a queuing response, the queuing response indicating the queuing ID sorted to the first place, and broadcasting the queuing response to each client, wherein, Each client further executes after changing the queuing identifier: identifying whether the client is the client corresponding to the queuing identifier that is sorted to the first place indicated by the queuing response, and identifying the client In the case that the client is the client corresponding to the queuing ID indicated by the queuing response and is sorted first, control the execution of its target operation.

The queuing method and queuing system of the present disclosure adopt a combination of client-side coding and server-side sorting. The client encodes the request for the target operation to generate a queuing ID, and the server sorts the queuing IDs. In this way, the queuing factors can be easily reflected in the queuing identifiers through the encoding rules of the client, and the server only uses simple sorting logic to sort the queuing identifiers without considering these queuing influencing factors. When the queuing factors change, it is only necessary to adjust the encoding of the client without making any changes on the server.

Description of drawings

Various aspects, features and advantages of the present disclosure will become clearer and easier to understand through the following description of the embodiments in conjunction with the accompanying drawings, wherein:

FIG. 1 shows a queuing system and a schematic application scenario thereof according to an embodiment of the present disclosure;

FIG. 2 shows a schematic flow chart of a queuing method according to an embodiment of the present disclosure; and

FIG. 3 shows an example in which a queuing method according to an embodiment of the present disclosure is implemented.

Specific embodiments

Hereinafter, the present disclosure will be described in detail with reference to exemplary embodiments of the present disclosure. However, the present disclosure is not limited to the embodiments described herein, and it may be embodied in many different forms. The described embodiments are only intended to make the present disclosure thorough and complete, and fully convey the concept of the present disclosure to those skilled in the art. Features of the various described embodiments can be combined or substituted for each other, unless explicitly excluded or should be excluded according to the context.

Fig. 1 shows a queuing system and a schematic application scenario thereof according to an embodiment of the present disclosure.

As mentioned above, it is common that a master process unit is designed to serve two or more slave process units, but is limited by its service capability and can only serve one slave process unit at a time.

Referring to FIG. 1, the master process unit T is designed to serve 6 slave process units A1, A2, A3 and B1, B2, B3. For example, the slave process units A1, A2, A3 are biofilters for nitrogen removal, the slave process units B1, B2, B3 are biofilters for carbon removal, and the main process unit T is equipped with Flush water system for flushing.

Clients C1 , C2 , C3 , C4 , C5 , C6 are computing devices such as PLCs, computers, smart devices hosting slave process units A1 , A2 , A3 and B1 , B2 , B3 respectively. For example, the administrator can perform operations such as start, pause, stop, work parameter setting, and target operation request of the biofilter A1 on the client C1. Working parameter settings include but are not limited to settings such as the particle size and thickness of the filler in the working layer, the particle size and thickness of the filler in the supporting layer, and the like. Target operation requests include, but are not limited to, material feed requests, material discharge requests, rinse water requests, oxygen supply requests, drying requests, and the like. The flushing water system is used as an example to illustrate the present disclosure below, and the mentioned target operations should be understood as target operations related to flushing water.

The server S is a computing device such as a PLC, a computer, an intelligent device hosting the main process unit T. The server S can communicate with each of the clients C1-C6 through wired, wireless or any other known communication methods, so as to receive data from the clients C1-C6 and send data to the clients C1-C6. For example, the server S receives the queuing identifiers from the clients C1-C6 and sorts the queuing identifiers (as described below). For another example, the server S cooperates with the clients C1-C6 to complete the target operation related to flushing water.

The queuing method according to the prior art is mainly performed by the server S. The clients C1-C6 communicate to the server S their respective information about the requested target operation and about themselves. The server S considers various queuing factors and uses complex sorting logic to sort the target queues. This queuing method has a high error rate and is not easy to expand, and when factors affecting queuing change, the server needs to make major changes.

The queuing system according to the embodiment of the present disclosure includes a server S and multiple clients C1-C6. The queuing method according to the embodiment of the present disclosure is implemented by the combination of the server S and the clients C1-C6. Each client C1-C6 generates a queuing identifier based on the encoding of the queuing influencing factor, and the queuing identifier reflects the priority of each queuing influencing factor. The server S acquires the queuing identifiers of the clients C1-C6 every predetermined time interval, and sorts the queuing identifiers to determine which client is its turn to perform its target operation. The queuing method is simple and has a low error rate. When factors affecting queuing change, it is only necessary to adjust the encoding of the client without making any changes on the server. The client's coding rules can also be designed to be transparent, easy to read, easy to modify and expand.

Although the queuing system according to the present disclosure is introduced by taking the flushing water system as an example in conjunction with FIG. 1 , the present disclosure is not limited thereto. The queuing system is also applicable to other industrial scenarios.

Fig. 2 shows a schematic flowchart of a queuing method according to an embodiment of the present disclosure.

For ease of understanding, before explaining the queuing method, first introduce the queuing rules in the flushing water system.

According to the technological requirements of the flushing water system, each of the nitrogen removal biofilters A1, A2, and A3 may have no request, or may request one of the following target operations: nitrogen removal forced flushing, nitrogen removal blocking value flushing, and nitrogen removal timing rinse. Each of the carbon removal biological filters B1, B2, and B3 may have no request, or may request one of the following target operations: carbon removal forced flushing, carbon removal blocking value flushing, and carbon removal timing flushing. Among them, the nitrogen removal target operation has priority over the nitrogen removal target operation, the forced flushing target operation has priority over the blocking value flushing target operation, and the blocking value flushing target operation has priority over the timing flushing target operation. Mandatory flushing refers to flushing operations that may have serious negative consequences if not performed in a timely manner. Blocking value flushing refers to the flushing operation that needs to be performed when the blocking value reaches a certain level. Timed flushing refers to routine, periodic (eg, flushing every few hours or days, etc.) or less urgent flushing operations. Therefore, the order of predetermined priority for the type of target operation from high to low is: nitrogen removal forced flushing, carbon removal forced flushing, nitrogen removal blocking value flushing, carbon removal blocking value flushing, nitrogen removal timing flushing, carbon removal timing Flush, no request.

In practice it may happen that several biofilters request the same target operation, in which case it is desirable to perform the target operation on the respective biofilters in the chronological order of the requests. For example, in one instance, both biofilters A1 and A2 request to perform nitrogen removal forced flushing, but biofilter A1 generates the request earlier in time, and it is expected that biofilter A1 performs nitrogen removal forced flushing first.

In practice, it may also happen that several biofilters request the same target operation at the same time, in this case, it is desired to perform the target operation on the corresponding biofilter according to the predetermined priority of the biofilter established in advance. For example, the predetermined priorities for nitrogen removal biological filters A1, A2 and A3 are A1, A2 and A3 in descending order, and the predetermined priorities for carbon removal biological filters B1, B2 and B3 are in order The order from high to low is B1, B2, B3. For example, in one instance, the biofilters A1, A2 and A3 all request nitrogen removal timing flushing at the same time, then the nitrogen removal timing flushing is performed on the biofilters A1, A2 and A3 in sequence. Moreover, nitrogen removal is prior to carbon removal, and A1, A2, and A3 are generally prior to B1, B2, and B3. Since there is a one-to-one correspondence between the clients and the biofilters, the predetermined priorities of the clients are C1, C2, C3, C4, C5, and C6 from high to low.

All in all, the queuing rules introduced above perform queuing by sequentially considering the type of the target operation, the time when the target operation is requested, and the priority of the filter itself as queuing influencing factors.

Referring to FIG. 2 , a queuing method 200 according to an embodiment of the present disclosure includes steps S201 to S204. Wherein, steps S201, S202 and S204 are performed by one or more of the clients C1-C6, and step S203 is performed by the server. The reference number S203 here does not mean that step S203 is performed after steps S201 and S202. In the present disclosure, step S203 is cyclically executed at predetermined time intervals ΔT throughout the entire queuing method.

In step S201, each of the multiple clients C1-C6 generates an initial queuing identifier based on the predetermined priority of the client. For example, each client C1-C6 can generate an initial queuing identifier when the corresponding biological filter A1, A2, A3, B1, B2, B3 is initialized (for example, when powered on). Since the biofilters A1-A3 and B1-B3 have not generated any request for target operation at this time, the initial queuing identifier only reflects the information of the client itself and does not reflect any target operation information. That is, the initial queuing identifier indicates no request.

In step S202, each of the plurality of clients C1-C6 changes the queuing identifier based on the predetermined priority of the target operation and the time when the request is detected when a request for executing the target operation is detected. For example, client C1 detects a request for forced flushing of nitrogen removal for biofilter A1, and generates a new queuing identifier to replace the initial queuing identifier based on the predetermined priority of forced flushing of nitrogen removal and the time when the request is detected . The request for the target operation may be generated, for example, by an administrator entering a corresponding command on the client, in response to a value of a corresponding sensor (eg, a blockage value sensor) of the biofilter, and so on. In addition to information about the client itself, the new queue ID also contains information about the type of operation targeted and when the request was detected. That is, the changed queuing identifier indicates that a specific client requests to perform a specific target operation at a specific time.

In step S203, executed by the server S every predetermined time interval ΔT: obtain the queuing ID of the client from each of the clients C1-C6, sort the acquired queuing IDs to generate a queuing response, the queuing response Indicates the queuing ID that is sorted to the first place, and the server S broadcasts the queuing response to each client.

As mentioned above, step S203 is cyclically executed at predetermined time intervals ΔT throughout the entire queuing method. The server S may start to execute step S203 when it is initialized (for example, when powered on). Since the queuing ID of each client C1~C6 changes due to the generation of the target operation request and the generation of the request is irregular, the server S obtains the queuing IDs of all clients C1~C6 once every time interval ΔT, which is convenient It can know the generation of each client's request in time and make queuing and processing in time. The predetermined time interval ΔT may be, for example, 0.5 second, 1 second or the like. In addition, in order to save computing power, the sorting logic of the server S can be designed to only sort out the first queue identifier without generating a complete sorting queue.

In addition, in step S203, the server S sorting the acquired queuing IDs to generate a queuing response may further include: comparing whether the acquired queuing IDs of each client are the same as the corresponding client's queuing IDs acquired in the previous predetermined time interval , and if the queuing ID of at least one client is different from its queuing ID in the previous predetermined time interval, the obtained queuing IDs are reordered. In other words, the reordering is performed only when the queuing identifier of at least one client has changed. In this way, the computing power of the server S can be further saved, thereby avoiding repeated unnecessary sorting when the queuing identifiers of all clients C1-C6 remain unchanged for a long time.

In step S204, each client in the plurality of clients C1-C6, in the case that its queuing identifier is not the initial queuing identifier, identifies whether the client is the queue that is sorted to the first place indicated by the queuing response. The corresponding client is identified, and in the case of identifying that the client is the client corresponding to the first-ordered queuing identification indicated by the queuing response, the execution of its target operation is controlled.

In this step, only the client whose queuing ID is not the initial queuing ID will identify whether the client is the client corresponding to the queued ID indicated by the queuing response. In other words, only the client that has generated a request for the target operation performs the identification operation. This is beneficial to save the computing power of clients C1~C6, because for clients without requests, it is not necessary to carry out this identification operation. When all clients C1~C6 have no requests, the queuing response generated by server S significance.

In this step, the client controlling the target operation includes the cooperation between the client and the server to execute the target operation. For example, after the client recognizes that it is the client corresponding to the queuing ID indicated by the queuing response and is sorted first, it sends a token for performing the target operation to the server, and the token is included in the queuing response and It is designed so that it can only be decrypted by the client corresponding to the first queue ID indicated by the queue response, and the server verifies the token and executes the flushing operation on the corresponding filter. During the flushing process, the client monitors and feeds back the status of the filter to the server, and the server adjusts flushing parameters such as flushing intensity and flushing time according to the feedback status.

An example is used to further illustrate the queuing method 200 below in conjunction with FIG. 3 .

FIG. 3 shows an example in which a queuing method according to an embodiment of the present disclosure is implemented.

Referring to FIG. 3 , the queuing method 200 is executed from a predetermined time interval ΔT1. During the period ΔT1, the clients C1-C6 initialize and execute step S201, that is, generate initial queuing identifiers NR1-NR6 based on respective predetermined priorities. At this time, each client has not detected the request for the target operation, and NR1-NR6 all represent no request.

The server S initializes, and executes step S203, that is, acquires the queuing identifiers NR1-NR6 of each client C1-C6, and sorts them. Since the initial queuing identifiers NR1-NR6 are coded and generated considering only the queuing factor of the predetermined priority of each client, the ordering of NR1-NR6 is consistent with the ordering of the predetermined priority of each client. According to the aforementioned queuing rules, the predetermined priorities of each client are C1, C2, C3, C4, C5, and C6 from high to low, so the server S will determine that NR1 is ranked first through its sorting logic (as shown in the circle in Figure 3 shown). If the ordering logic were designed to form a complete queue, the queue would be NR1, NR2, NR3, NR4, NR5, NR6. The server S generates a queuing response indicating NR1, and broadcasts the queuing response to each of the clients C1-C6.

Since the queuing identifiers of the clients C1~C6 are still the initial queuing identifiers, that is, the clients C1~C6 have not yet detected the request for the target operation, and the clients C1~C6 do not identify whether they are the ones indicated by the queuing response. The operation of the client corresponding to the first queued ID.

During the predetermined time interval ΔT2, none of the biofilters has generated a target operation request, and the queuing identifiers of the clients C1-C6 remain unchanged NR1-NR6. NR1 is still ranked first (as circled in Figure 3). The queued response generated by server S still indicates NR1. The clients C1-C6 still do not perform the identification operation.

Alternatively, the server S may also correspondingly compare the acquired queuing identifiers NR1 - NR6 with the queuing identifiers NR1 - NR6 acquired in the last predetermined time interval ΔT1 . According to the comparison, it is found that the queuing identifiers of each client have not changed, so the sorting logic is not used to reorder to save computing power.

During the predetermined time interval ΔT3, a request for a target operation is generated for the biofilters A2, A3 and B1. For example, biofilter A2 requests to perform nitrogen removal timing flushing, biofilter A3 requests to perform nitrogen removal blocking value flushing, and biofilter B1 requests to perform carbon removal blocking value flushing.

Clients C2, C3, and C4 perform step S202, change the queuing ID based on the predetermined priority of the corresponding target operation and the time when the request is detected, and generate new queuing IDs R2, R3, and R4 to replace the initial queuing IDs NR2, NR2, and R4 respectively. NR3 and NR4.

The server S executes step S203, and obtains that the queuing identifiers of the clients C1-C6 are NR1, R2, R3, R4, NR5, and NR6 in sequence. According to the aforementioned queuing rules, the nitrogen removal blocking value flushing represented by R3 is prior to the carbon removal blocking value flushing represented by R4, and the carbon removal blocking value flushing represented by R4 is prior to the nitrogen removal timing flushing represented by R2. Nitrogen removal timing flushing is prior to no request, therefore, the server S will determine that the queue identifier R3 is sorted to the first place through the sorting logic (as shown by the circle in FIG. 3 ). If the ordering logic of server S is designed to generate a complete queue, the queue will be R3, R4, R2, NR1, NR5, NR6. The server S generates a queuing response indicating the queuing identifier R3, and broadcasts the queuing response to each of the clients C1-C6.

The queuing identifiers of the clients C2-C4 are no longer the initial queuing identifiers, and they will perform step S204 to identify whether they are clients corresponding to the queuing identifier R3 indicated by the queuing response. For example, the clients C2-C4 may perform the identification by comparing whether the queuing identifier R3 indicated by the received queuing response is the same as its own current queuing identifier. Therefore, the client C3 will recognize itself as the client corresponding to the queuing identifier R3 indicated by the queuing response, so as to control its target operation (ie, nitrogen removal blocking value flushing) to start executing. The execution of the target operation may be completed by the cooperation of the client C3 and the server S, which will not be described in detail in order to avoid obscuring the present disclosure. The clients C2 and C4 will recognize that they are not clients corresponding to the queuing identifier R3 indicated by the queuing response, and continue to wait without taking any action.

In this way, according to the queuing method of the embodiment of the present disclosure, the client generates the queuing identifier according to the type of the target operation, the time when the request for the target operation is detected, the predetermined priority of the client, and other queuing influencing factors. The server only obtains the queuing identifiers of the client every predetermined time interval, and then uses simple sorting logic to sort the queuing identifiers. Compared with the prior art, the operation of the server is simplified. When a client changes, it only needs to make corresponding adjustments on the changed client without making any changes on the server.

Referring back to FIG. 2, the queuing method 200 may further include steps S205 and S206.

In step S205, each of the multiple clients changes the queuing identifier again once its target operation starts to be executed, so that the re-changed queuing identifier will be sorted to the first place by the server.

Continue to use the example in FIG. 3 to illustrate this step.

During the predetermined time interval ΔT3, once the client C3 starts to flush the blocking value for nitrogen removal, step S205 is executed, that is, a new queue identifier OR3 is generated to replace the queue identifier R3. The queuing identifier OR3 is coded such that it is sorted to the first place after being acquired by the server S (as shown by the circle in FIG. 3 ). In this regard, the specific implementation method depends on the encoding rules of the clients C1-C6 and the queuing logic of the server S, which will be described with examples later.

During the predetermined time interval ΔT4, the biofilter A1 requests to perform a nitrogen removal forced flushing. The client C1 detects the request and executes step S202, generating a new queuing identifier R1 to replace its initial queuing identifier NR1.

The server S executes step S203 to acquire the queuing identifiers of each client C1-C6: R1, R2, OR3, R4, NR5, NR6. Since the queuing identifier OR3 is encoded to be sorted to the first place by the server S (as shown by the circle in FIG. 3 ), the queuing response generated by the server S still indicates the queuing identifier OR3. Thus, the flushing of the blocking value of nitrogen removal being performed by the client C3 will not be interrupted. Since the predetermined priority of the forced flushing of nitrogen removal represented by R1 is higher than the predetermined priority of the flushing of the blocking value of carbon removal represented by R4, if the sorting logic of the server S is designed to generate a complete queue, the queue will be: OR3, R1, R4, R2, NR5, NR6.

In this way, during the predetermined time interval ΔT5 to ΔTn-1, as long as the queuing identifier of the client C3 remains OR3, no matter how the queuing identifiers of other clients C1, C2, C4, and C5 change, the server S will always The queuing identifier OR3 of the client C3 is determined to be the first in the queue (shown as a circle in FIG. 3 ). In this way, the flushing of the nitrogen removal blocking value of the biofilter A3 will not be interrupted.

In step S206, each of the plurality of clients changes its queuing identifier back to the initial queuing identifier once its target operation is executed.

Continue to use the example in FIG. 3 to illustrate this step.

In the predetermined time interval ΔTn, the flushing of the nitrogen removal blocking value of the biofilter A3 is completed, and the client C3 changes its queuing identifier OR3 back to the initial queuing identifier NR3.

The server S obtains the queuing identifiers of each client C1-C6: R1, R2, NR3, R4, R5, R6. The target operation types embodied by R5 and R6 are both nitrogen removal and regular flushing, and the request time is both at 12:00 on September 20, 2022. According to the aforementioned queuing rules, the forced flushing of nitrogen removal embodied by R1 has priority over the flushing of carbon removal blockage value represented by R4, the flushing of carbon removal blockage value represented by R4 has priority over the timing flushing of nitrogen removal represented by R2, and the flushing of nitrogen removal represented by R2 Nitrogen timing flushing has priority over nitrogen removal timing flushing embodied by R5 and R6. The request time of R5 and R6 is the same, but the priority of client C5 is higher than that of client C6. Therefore, the server S ranks R1 first (as indicated by the circle in Figure 3), and if the sorting logic of the server S is designed to generate a complete queue, the queue will be: R1, R4, R4, R5, R6 , NR3. Client C1 then performs its target operation to remove nitrogen and force flushing.

The process of the queuing method 200 has been described in detail above with reference to the example in FIG. 3 , and an example encoding rule used by the client to generate the queuing identifier is described below.

As an example, the clients C1-C6 may use binary encoding to generate binary numbers as queuing identifiers. The bits of the binary number, from high to low, include the first set of bits indicating whether the request is being executed, the second set of bits indicating the predetermined priority of the target operation, and the third set of bits indicating when the request was detected , and a fourth set of binary bits representing the predetermined priority of the client.

Table 1 below shows an example 64-bit binary encoding rule, where bit 62 is used as the first group of binary bits indicating whether the request is being executed, bit42-bit39 is used as the second group of binary bits indicating the predetermined priority of the target operation, and bit38- bit32 and bit27-bit8 are used as the third group of binary bits indicating the time when the request is detected, bit7-bit0 is used as the fourth group of binary bits indicating the predetermined priority of the client, and the remaining bits63, bit61-bit43, and bit31-bit28 are used Reserved for future expansion.

Table 1

Clients C1~C6 use this encoding rule to encode requests with higher priority into smaller binary numbers, and server S uses sorting logic (for example, bubble algorithm) to sort these binary numbers from small to large. put in order. But the present disclosure is not limited thereto. For example, requests with higher priority may be encoded into larger binary numbers, and the server S correspondingly adopts a sorting logic of sorting binary numbers from large to small. Thus, the queuing identifier generated by the client with the highest priority request will be ranked first by the server S.

Table 2 below is the corresponding encoding of the second group of binary bits bit42-bit39 representing the predetermined priority of the target operation.

Table 2

Table 3 below is the corresponding encoding of the fourth group of binary bits representing the predetermined priority of the client.

table 3

client Corresponding filter Booking priority Bit7-bit0 C1 A1 0 00000000 C2 A2 1 00000001 C3 A3 2 00000010 C4 B1 3 00000011 C5 B2 4 00000100 C6 B3 5 00000101

Referring back to FIG. 3 , applying the above coding rules to the example in FIG. 3 , during the predetermined time interval ΔT1 , the clients C1 - C6 are initialized to generate initial queuing identifiers. Specifically, the first group of binary bits and the second group of binary bits are respectively encoded as corresponding maximum values, and the fourth group of binary bits is encoded as a value representing a predetermined priority of the client. The initialization time is encoded at 00:00 on September 20, 2022, and the third group of binary bits bit38-bit32 and bit27-bit8 representing the time when the request is detected are encoded as 10110 and 1001-10100-00000-000000 respectively. For the sake of brevity, the encoding result of the third group of binary digits representing time is omitted in Table 4.

Table 4

The server S sorts the queuing IDs in ascending order: NR1, NR2, NR3, NR4, NR5, NR6. The queuing response broadcast by the server S to the client indicates NR1.

During the predetermined time interval ΔT2, the respective queuing identifiers remain unchanged.

During the predetermined time interval ΔT3, the clients C2, C3 and C4 respectively generate new queuing identifiers R2, R3 and R4 to replace NR2, NR3, NR4. The codes of the queuing identifiers of the clients C1-C6 are shown in Table 5. Compared with Table 4, each second group of bits is changed to a value representing the predetermined priority of the corresponding target operation, and each third group of bits is changed to a value representing the time at which the corresponding request was detected. For the sake of brevity, the encoding result of the third group of binary digits representing time is omitted in Table 5.

table 5

The result of the server S sorting the queuing IDs from small to large is: R3, R4, R2, NR1, NR5, NR6. The queuing response indication R3 broadcast by the server S to the client.

During the predetermined time interval ΔT4, the client C3 encodes the first group of binary bits bit 62 in its queuing identifier to the minimum value 0 based on the target operation requested by it, so as to generate a new queuing identifier OR3 to replace the queuing identifier R3 . The client C1 generates a new queuing identifier R1 to replace the queuing identifier NR1 based on the nitrogen removal forced flushing code. The codes of the queuing identifiers of the clients C1-C6 are shown in Table 6. For the sake of brevity, the encoding result of the third group of binary digits representing time is omitted in Table 6.

Table 6

The server S sorts the six queuing IDs from small to large: OR3, R1, R4, R2, NR5, NR6. The queuing response indication OR3 broadcast by the server S to the client.

During the predetermined time interval ΔT4 to ΔTn-1, the client C5 encodes and generates the queuing identifier R5 to replace the queuing identifier NR5 based on the target operation decarbonization timing flushing and request occurrence time, for example, at 12:00 on September 20, 2022. Client C6 coded and generated queue identifier R6 to replace queue identifier NR6 based on the same target operation as C4, carbon removal timing flushing and the same request occurrence time at 12:00 on September 20, 2022. But no matter how the queuing identifiers of these clients change, only the bit 62 of the queuing identifier OR3 of the client C3 is 0, so OR3 is always the smallest binary number among all queuing identifiers, and OR3 is always ranked first (as indicated by the circle in Figure 3 Show). The queued response broadcast by the server S to the client always indicates OR3.

Until the predetermined time interval ΔTn, the client C3 changes its queuing identifier from OR3 back to NR3 based on the execution of the target operation requested by it. The encodings of the queuing identifiers of the clients C1-C6 are shown in Table 7. For simplicity, the encoding results of the third group of binary bits are omitted in Table 7.

Table 7

The server S sorts the queuing IDs from small to large: R1, R4, R2, R5, R6, NR3. The queuing response indication R1 broadcast by the server S to the client. Client C1 then performs its target operation to remove nitrogen and force flushing.

The encoding rules described above are only examples, and any encoding rules for clients that can implement the queuing method 200 are possible. The above description of the ordering logic of the server S from small to large is also exemplary, and it is possible to implement the ordering logic of the queuing method 200 in cooperation with the encoding rules of the client.

Those skilled in the art should understand that the above-mentioned specific embodiments are only examples and not limiting, and various modifications, combinations, partial combinations and replacements can be made to the embodiments of the present disclosure according to design requirements and other factors, as long as they are described in the appended claims or its equivalent scope, that is, it belongs to the scope of rights to be protected by the present disclosure.

Claims (10)

1. A queuing method for a target operation, comprising:

generating, by each of a plurality of clients, an initial queuing id based on a predetermined priority of the client, and in the event that a request to perform a target operation is detected, changing the queuing id based on the predetermined priority of the target operation and the time at which the request is detected;

performing, by a server associated with each of the plurality of clients, per a predetermined time interval: obtaining a queuing identifier of the client from each client, sorting the obtained queuing identifiers to generate a queuing response indicating the queuing identifier sorted to the top, and broadcasting the queuing response to each client; and

identifying, by each of a plurality of clients, whether the client is a client corresponding to the first-ranked queuing id indicated by the queuing response if its queuing id is not the initial queuing id, and controlling execution of its target operation if the client is a client corresponding to the first-ranked queuing id indicated by the queuing response.

2. The method of claim 1, wherein sorting, by the server, the obtained queuing identifications to generate queuing responses comprises:

and the server compares whether the obtained queuing identification of each client is the same as the queuing identification of the corresponding client obtained in the previous preset time interval or not, and reorders the obtained queuing identifications under the condition that the queuing identification of at least one client is different from the queuing identification of the previous preset time interval.

3. The method of claim 1, further comprising:

changing the queuing identifier again once the target operation of each client starts to be executed, so that the queuing identifier after changing again is sorted to the first by the server.

4. The method of claim 3, further comprising:

changing its queuing id back to the initial queuing id once its target operation is completed by each client.

5. The method of claim 4, wherein,

the queue identification is a binary number, and the bits of the binary number include, in order from high to low, a first set of bits representing whether the request is executing, a second set of bits representing a predetermined priority of the target operation, a third set of bits representing a time at which the request is detected, and a fourth set of bits representing a predetermined priority of the client.

6. The method of claim 5, wherein,

sorting, by the server, the obtained queuing identifications to generate queuing responses includes sorting the obtained queuing identifications from small to large.

7. The method of claim 6, wherein generating, by the each client, its initial queuing identity comprises:

encoding the first and second groups of bits to respective maximum values;

encoding the fourth set of bits as a value representing a predetermined priority of the client.

8. The method of claim 7, wherein changing, by the each client, the queuing identity based on a predetermined priority of the target operation and a time at which the request is detected comprises:

changing the second set of bits to a value representing a predetermined priority of the target operation;

changing the third set of bits to a value representing a time at which the request was detected.

9. The method of claim 8, wherein changing, by the each client, the queuing identity again once the target operation begins to execute comprises:

changing, by said each client, said first set of binary bits to a corresponding minimum value once said target operation begins to execute.

10. A queuing system for a target operation, comprising:

a plurality of clients, each of which is configured to generate an initial queuing identity based on a predetermined priority of the client, and in the event of detecting a request to perform a target operation, to change the queuing identity based on the predetermined priority of the target operation and the time at which the request was detected; and

a server configured to perform, per a predetermined time interval: obtaining a queuing identifier for each of the plurality of clients associated with the server, sorting the obtained queuing identifiers to generate a queuing response indicating the first-ranked queuing identifier, and broadcasting the queuing response to said each client,

wherein each client further performs, after changing the queuing identity: identifying whether the client is the client corresponding to the first-ordered queuing identification indicated by the queuing response, and controlling the execution of the target operation of the client in the case of identifying that the client is the client corresponding to the first-ordered queuing identification indicated by the queuing response.

Images