CN102281202A - Dispatching method, server and system - Google Patents

Abstract

The present invention provides a scheduling method, server and system, and the above method includes the following steps. The server establishes queues for requesting ends of different levels, and after receiving the access requests of the requesting ends, the server puts the requesting ends into corresponding queues respectively. After receiving the response that the processing end agrees to process, the server pushes the request to be processed to the processing end for processing. If a certain grade or multiple requests of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters according to the preset control strategy for processing. Among them, the lower the level, the higher the priority.

Description

A scheduling method, server and system

technical field

The invention belongs to the field of network communication, and in particular relates to a scheduling method, server and system.

Background technique

With the wide application of Internet communication technology in society, the ways of multi-user network services are becoming more and more diversified. In the prior art, the invention "Priority Scheduling and Admission Control in Communication Network" with application number 200880107492.7 describes a technology of priority scheduling and admission control in communication network. The above invention includes the following: In one aspect, data streams can be prioritized, and packets of data streams with progressively higher priorities can be placed at points progressively closer to the head of the queue, and then progressively higher priority can be experienced Shorter queuing delays. In another aspect, a terminal's packet may be transferred from the source cell to the target cell as a result of a handover, and it may be credited with the amount of time the packet has been waiting in the source cell's queue. In yet another aspect, all priority and non-priority traffic may be admitted if the cell load is light, only priority traffic may be permitted if the cell load is heavy, and may be permitted if the cell load is moderate All prioritized traffic and some non-preferred traffic.

The above invention assigns specific priorities to users, and places higher priority data flow packets at the head of the queue, so that you can experience gradually shorter queuing delays; data flow. However, in the above invention patent application, when a large amount of data with different priorities floods in, lower priority data cannot be processed in time, and user experience is greatly reduced.

Contents of the invention

The present invention provides a scheduling method, server and system to solve the above problems.

The present invention provides a scheduling method, including the following steps. The server establishes queues for requesting ends of different levels, and after receiving the access requests of the requesting ends, the server puts the requesting ends into corresponding queues respectively. After receiving the response that the processing end agrees to process, the server pushes the request end to be processed to the processing end for processing. If a certain grade or multiple requesters of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters for processing according to the preset control strategy. Among them, the lower the level, the higher the priority.

The present invention also provides a scheduling method, including the following steps. The server establishes queues for requesters of different levels. After receiving the access requests of the requesters, the server puts the requesters into the corresponding queues respectively. Among them, the requesters of lower levels are queued in the queues of requesters of one level higher than them at the same time. . After receiving the response that the processing end agrees to process, the server pushes the request end to be processed to the processing end for processing. If a certain grade or multiple requesters of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters for processing according to the preset control strategy. Among them, the lower the level, the higher the priority.

The present invention also provides a server, including an establishment module, a request processing module and a control module. The establishment module is connected to the request processing module, and the request processing module is connected to the control module. Wherein, the establishment module is used to respectively establish queues for request ends of different levels. The request processing module is configured to, after receiving the access request of the requesting end, put the requesting end into the corresponding queue respectively, and push the requesting end to be processed to the processing end after receiving the response that the processing end agrees to process. The control module is used to put the requesters whose grades in the queue are lower than the processed ones into the queue corresponding to the processed requesters according to the preset control strategy after the requesters of a certain level or multiple different levels in the queue are processed, Processing is performed, wherein the lower the rank, the higher the priority.

The present invention also provides a scheduling system, including a requesting end, a server and a processing end. The requesting end connects to the server, and the server connects to the processing end. Wherein, the server establishes queues for different levels of requesting ends, and after receiving the access requests of the requesting ends, the server puts the requesting ends into the corresponding queues respectively, and after receiving the response that the processing end agrees to process, the server pushes the pending requests. Processing from the requesting end to the processing end, if a certain level or multiple different levels of requesting ends in the server queue are processed, the server will put the requesting end in the queue whose level is lower than the completed requesting end into the completed requesting end according to the preset control strategy In the corresponding queue, processing is performed, wherein the lower the level, the higher the priority.

Compared with the prior art, according to the scheduling method, server and system provided by the present invention, data with different priority levels can be queued according to different levels when the data initiates a request, and massive data can be channeled to better provide hierarchical services . At the same time, according to the idle situation of the data processing end, the server flexibly adjusts the data processing sequence according to a specific strategy, which reduces the waiting time in queuing and improves the data processing efficiency.

Description of drawings

The accompanying drawings described here are used to provide a further understanding of the present invention and constitute a part of the application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations to the present invention. In the attached picture:

Fig. 1 shows the flowchart of the scheduling method provided according to the first preferred embodiment of the present invention;

Fig. 2 is a schematic diagram of a queue provided according to a first preferred embodiment of the present invention;

FIG. 3 is a flowchart of a scheduling method provided according to a second preferred embodiment of the present invention;

FIG. 4 is a schematic diagram of a server provided according to a preferred embodiment of the present invention;

Fig. 5 is a schematic diagram of a scheduling system provided according to a preferred embodiment of the present invention.

Detailed ways

Hereinafter, the present invention will be described in detail with reference to the drawings and examples. It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other.

Fig. 1 is a flowchart of a scheduling method provided according to a first preferred embodiment of the present invention. As shown in FIG. 1 , the scheduling method provided by the preferred embodiment of the present invention includes steps 101-104.

Step 101: The server establishes queues for requesters of different levels. Among them, the requesting end is divided into different levels according to the data processing priority, and the server establishes queues according to different levels of the requesting end.

Step 102: After receiving the access request from the requesting end, the server puts the requesting end into corresponding queues. First, the requester connects to the server and sends an access request to the server. After receiving the access request from the requesting end, the server puts the requesting end into the corresponding level queue and starts queuing.

Step 103: After receiving the response that the processing end agrees to process, the server pushes the pending request end to the processing end for processing. Wherein, the requesting end is connected to the server, and the server is connected to the processing end. Specifically, after the processing end sends a message agreeing to processing to the server, the server sends a command to notify the first requesting end in the queue to enter processing, the requesting end agrees to enter, the server pushes the pending request end to the processing end for processing, and the data processing ends. The processing end actively sends a message to the server, and the server removes the request end from the queue according to the message, and pushes the next pending request end to the processing end for processing.

Step 104: After a certain grade or multiple requests of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters according to the preset control strategy, and performs processing, wherein the lower the rank, the higher the priority.

For example, if the requester level is three, the queue corresponding to the first level requester is the first queue, the queue corresponding to the second level requester is the second queue, and the queue corresponding to the third level requester is the third queue .

If the third-level request end is processed first, the server puts the first-level request end in the first queue and the second-level request end in the second queue into the third queue according to the preset scheduling policy, and puts the first-level request end in the second queue into the third queue. The last 5 first-level requesters in the second queue and the last 3 second-level requesters in the second queue are put into the third queue according to priority.

Fig. 2 is a schematic diagram of the queue provided according to the first preferred embodiment of the present invention. As shown in Figure 2, if the second and third-level request ends are processed first, the server will put the first-level request in the first queue into the second and third queues according to the preset scheduling strategy, and put the first-level request Among the last 5 first-level requesters a, b, c, d, e, a, b, and c are put into the second queue, which are located in front of the second-level requesters received later, and d, e are put into the third queue , located in front of third-level requesters received later.

Fig. 3 is a flowchart of a scheduling method provided according to a second preferred embodiment of the present invention. As shown in FIG. 3 , the scheduling method provided by the preferred embodiment of the present invention includes steps 301-304.

Step 301: The server establishes queues for requesters of different levels. Among them, the requesting end is divided into different levels according to the data processing priority, and the server establishes queues according to different levels of the requesting end.

Step 302: After receiving the access request from the requesting end, the server puts the requesting ends into corresponding queues respectively, wherein the requesting end of a lower level queues in the queue of the requesting end of a higher level at the same time. First, the requester connects to the server and sends an access request to the server. After receiving the access request from the requesting end, the server puts the requesting end into the corresponding level queue and starts queuing.

For example, if the requester level is three, the queue corresponding to the first level requester is the first queue, the queue corresponding to the second level requester is the second queue, and the queue corresponding to the third level requester is the third queue , where the lower the level, the higher the priority. The first-level requester queues in the second queue at the same time, located behind the second-level requester in the second queue; the second-level requester queues in the third queue at the same time, located behind the third-level requester in the third queue later.

Step 303: After receiving the response that the processing end agrees to process, the server pushes the pending request end to the processing end for processing. Wherein, the requesting end is connected to the server, and the server is connected to the processing end.

Specifically, after the processing end sends a response to the server agreeing to process, the server sends a command to notify the first requester in the queue to enter processing. If the requester does not agree to enter, the server removes the requester from the current queue, but the requester Do not leave another enqueuing queue.

After the processing end sends a response to the server agreeing to process, the server sends a command to notify the first requester in the queue to enter processing, the requester agrees to enter, the server pushes the request to be processed to the processing end for processing, the data processing is completed, and the processing end actively sends The message is sent to the server, and the server removes the request end from the queue according to the message, and pushes the next pending request end to the processing end for processing.

Step 304: After a certain grade or multiple requesters of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters according to the preset control strategy, and performs processing, wherein the lower the rank, the higher the priority.

For example, if the level of the requester is level 3, the queue corresponding to the first level requester is the first queue, the queue corresponding to the second level requester is the second queue, and the queue corresponding to the third level requester is the third queue .

If the third-level request end is processed first, the server puts the first-level request end in the first queue and the second-level request end in the second queue into the third queue according to the preset scheduling policy, and puts the first-level request end in the second queue into the third queue. The last 5 first-level requesters and the last 3 second-level requesters in the second queue are put into the third queue.

Fig. 4 is a schematic diagram of a server provided according to a preferred embodiment of the present invention. As shown in FIG. 4 , the server 20 includes an establishment module 201 , a request processing module 202 and a control module 203 . The establishment module 201 is connected to the request processing module 202 , and the request processing module 202 is connected to the control module 203 . Among them, the establishment module 201 is used to set up queues for requesters of different levels, and the request processing module 202 is used to receive the access request of the requester, put the requester into the corresponding queue respectively, and receive the message that the processing terminal agrees to process, Push the pending request end to the processing end for processing. The control module 203 is used to put the requester whose grade in the queue is lower than the processed requester into the queue corresponding to the processed requester according to the preset control strategy if a certain level or multiple requesters of different levels in the queue are processed, pending processing. The specific operation process of the server is the same as that of the aforementioned method, so it will not be repeated here.

Fig. 5 is a schematic diagram of a scheduling system provided according to a preferred embodiment of the present invention. As shown in FIG. 5 , the scheduling system 1 includes multiple request ends, a server 20 and multiple processing ends. Taking three requesting ends and three processing ends as an example, the requesting end 11 , the requesting end 12 , the requesting end 13 , the server 20 and the processing end 31 , the processing end 32 , and the processing end 33 . The requesting end 11 , the requesting end 12 , and the requesting end 13 are connected to the server 20 , and the server 20 is connected to the processing end 31 , the processing end 32 , and the processing end 33 . Wherein, the server 20 establishes queues respectively for requesters 11, 12 and 13 of different levels. After receiving the access requests of the requester 11, 12 and 13, the server 20 sends the , and the requesting end 13 are put into corresponding queues respectively. After receiving the response that the processing end 31 agrees to process, the server 20 pushes the request end 11 to be processed to the processing end 31 for processing. If a certain level of requester 12 in the queue of the server 20 or a plurality of requesters 12 and 13 of different levels are processed, the server 20 puts the requester 11 whose grade in the queue is smaller than the completed requester 11 into the completed requester according to the preset control strategy. The requester 12 or the queues corresponding to multiple requesters 12 and 13 of different levels are processed. The specific operation process of the dispatching system is the same as that of the aforementioned method, so it will not be repeated here.

To sum up, according to the scheduling method, server and system provided by the preferred embodiments of the present invention, data of different priority levels can be queued according to different levels when the data initiates a request, and the massive data can be channeled to better provide distribution. layer service. At the same time, according to the idle situation of the data processing end, the server flexibly adjusts the data processing sequence according to a specific strategy, which reduces the waiting time in queuing and improves the data processing efficiency.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (10)

1. A scheduling method, characterized in that: The server establishes queues for different levels of requesters; After receiving the access request from the requesting end, the server puts the requesting end into corresponding queues; After receiving the response that the processing end agrees to process, the server pushes the request end to be processed to the processing end for processing; After a certain grade or multiple requests of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters according to the preset control strategy, and processes them. , the lower the level, the higher the priority. 2. The method according to claim 1, wherein the control strategy comprises: If the level of the requester is level 3, the queue corresponding to the first level requester is the first queue, the queue corresponding to the second level requester is the second queue, and the queue corresponding to the third level requester is the third queue; if the third level The level requester is processed first, and the server puts the first level requester in the first queue and the second level requester in the second queue into the third queue according to the preset scheduling strategy. 3. The method according to claim 2, characterized in that: the scheduling policy comprises: Put the last 5 first-level requesters in the first queue and the last 3 second-level requesters in the second queue into the third queue according to priority. 4. The method according to claim 1, wherein the control strategy comprises: If the level of the requester is level 3, the queue corresponding to the first level requester is the first queue, the queue corresponding to the second level requester is the second queue, and the queue corresponding to the third level requester is the third queue; 1. The three-level request ends are processed first, and the server puts the first-level request ends in the first queue into the second and third queues according to the preset scheduling policy. 5. The method according to claim 4, characterized in that: the scheduling policy comprises: Put the last 5 first-level requesters in the first queue, among them, the first 3 are put into the second queue, and the other 2 are put into the third queue. 6. A scheduling method, characterized in that: The server establishes queues for different levels of requesters; After receiving the access request of the requesting end, the server puts the requesting end into the corresponding queue respectively, wherein, the requesting end of the lower level is queued in the queue of the higher level requesting end at the same time; After receiving the response that the processing end agrees to process, the server pushes the request end to be processed to the processing end for processing; After a certain grade or multiple requests of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the processed requesters according to the preset control strategy, and processes them. , the lower the level, the higher the priority. 7. The method according to claim 6, characterized in that: if the requester level is 3, then the first level requester queues up in the queue corresponding to the second level requester; the second level requester queues up at the third level Queue in the queue corresponding to the level request end at the same time. 8. The method of claim 7, wherein: When a lower-level requester is simultaneously queued in the queue of a higher-level requester, it is located behind the requester in the queue of a higher-level requester. 9. A kind of server, it is characterized in that, comprising: build module, request processing module and control module, build module connection request processing module, request processing module connect control module, wherein: Establishing modules for establishing queues for different levels of requesting ends; The request processing module is configured to, after receiving the access request from the requesting end, put the requesting end into the corresponding queue respectively, and after receiving the response that the processing end agrees to process, push the pending request end to the processing end for processing; The control module is used to put the requesters whose grades in the queue are lower than the processed ones into the queue corresponding to the processed requesters according to the preset control strategy after the requesters of a certain level or multiple different levels in the queue are processed, Processing is performed, wherein the lower the rank, the higher the priority. 10. A scheduling system, characterized in that it comprises: a requester, a server and a processing end, the requesting end is connected to the server, and the server is connected to the processing end, wherein: The server establishes queues for different levels of requesters; After receiving the access request from the requesting end, the server puts the requesting end into corresponding queues; After receiving the response that the processing end agrees to process, the server pushes the request end to be processed to the processing end for processing; If a certain grade or multiple requests of different grades in the server queue are processed, the server puts the requesters whose grades are lower than the processed ones in the queue into the queue corresponding to the completed requesters for processing according to the preset control strategy, among which , the lower the level, the higher the priority.

Images