CN104951373B - The message queue processing method of scheduling system - Google Patents
The message queue processing method of scheduling system Download PDFInfo
- Publication number
- CN104951373B CN104951373B CN201510289360.2A CN201510289360A CN104951373B CN 104951373 B CN104951373 B CN 104951373B CN 201510289360 A CN201510289360 A CN 201510289360A CN 104951373 B CN104951373 B CN 104951373B
- Authority
- CN
- China
- Prior art keywords
- message
- label
- priority
- scheduling system
- type
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of message queue processing methods of scheduling system.It solve existing scheduling system Message Processing it is improper the problems such as.Include the following steps：Receive the message sent by the access terminal of scheduling system, message has the first label and the second label, wherein the priority of the first tag characterization type of message and the first different labels is different, the priority of this message in second tag characterization the type message, the priority of the first label are higher than the priority of the second label；Message is arranged successively to form message queue according to priority according to the first label and the second label；Message processing module therefrom obtains message from message queue and is handled.Advantage is：The case where multiple client carries out the response speed that system has been obviously improved when automatic operation, reduces system resource, calls out improves the stability of system, realizes the summary responses of scheduling system usage scenario.
Description
Technical field
The invention belongs to communication technique fields, more particularly, to a kind of message queue processing method of scheduling system.
Background technique
In scheduling operation system, message queue is the container that message is saved in the transmission process of message, message queue
Main purpose be to provide routing and guarantee the transmitting of message, communicated between all nodes by message, the tune of message queue
Degree strategy has vital effect to the operation of entire cluster.Scheduling operation message, scheduling in traditional scheduling operation system
Message queue is added according to time order and function relationship in response message and module response message, message processing module from message queue therefrom
Message is obtained to be handled, the scheduling strategy design of this kind of mode message queue is unreasonable, for two different disposal ranks but
It is that the message being simultaneously emitted by can not accomplish quickly to respond high-priority message, and receive a low priority and disappear
Breath, receives a high-priority message, two message are operated to identical member, and existing scheduling system can first be located at once
Low priority message is managed, receives high-priority message, the operation before covering does not have wherein there is original low priority message
There is necessity of processing, and need to do the rollback operation of low priority message before handling the covering operation of high-priority message, greatly
Increase the complexity of system greatly, and message be assigned in the more message handling task of message to be processed or priority ratio compared with
In low message handling task, block then this may result in timely message in the more message handling task of message to be processed
In or the lower message handling task of priority in, and then lead to timely message time-out or processing not in time, timely message obtains not
To rapid processing, the operational efficiency for eventually leading to entire scheduling operation system is affected.
Of the existing technology in order to solve the problems, such as, people have carried out long-term exploration, propose miscellaneous solution
Scheme.For example, Chinese patent literature discloses a kind of method and device application number that timely message is handled in time：
200910087065.3], this method includes:Message to be processed is divided into timely message and non-timely message, and respectively will
Timely message and non-timely message are inserted correspondingly into the message queue of message handling task；Judge be in message handling task
It is no to contain pending timely message, when containing pending timely message, then improve the priority of the message handling task；
The message handling task is handled timely message to be processed according still further to the priority after raising.Correspondingly, the present invention mentions
For a kind of device that timely message is handled in time, including:Message queue creation module, scheduler task module and message handling task
Module.
Above scheme solves the problems, such as that message can not be handled in time in existing message queue to a certain extent, but should
Scheme still remains：Treatment process is cumbersome, and response speed is low, the high problem of system resource.
Summary of the invention
Regarding the issue above, the present invention provides it is a kind of simple and reasonable, the good scheduling system of stability
Message queue processing method.
In order to achieve the above objectives, present invention employs following technical proposals：The message queue processing method of this scheduling system,
It is characterized in that, this method includes the following steps：
A, message is received：The message sent by the access terminal of scheduling system is received, the message has the first mark
Label and the second label, wherein the priority of the first tag characterization type of message and the first different labels is different, the second label list
The priority of this message in the type message is levied, the priority of first label is higher than the priority of the second label；
B, message queue is formed：Message is arranged successively to be formed according to priority according to the first label and the second label
Message queue；
C, message call：Message processing module therefrom obtains message from message queue and is handled.
This method is able to achieve the summary responses of scheduling system usage scenario, sends out for two different disposal ranks but simultaneously
Message out, which is able to achieve, quickly responds high-priority message, improves the response speed of system, reduces system
Resource improves the stability of system.
In the message queue processing method of above-mentioned scheduling system, when receiving same type message and priority is higher than
When the priority of the first message of the type, before current message is inserted in the first message of described the type, current message is then judged
Whether it is to be operated to identical member with first message, if identical member, then abandons the first message of described the type；If
For different members, then retain the first message of described the type.When receiving a low priority message, it is preferential that a height is received at once
Grade message, and when two message are to identical member, can first handle high-priority message, after the low priority message that receives then
It directly abandons, improves system performance, reduce the complexity of system, and the sequence problem that identical message different operation is introduced
Improved well.
In the message queue processing method of above-mentioned scheduling system, first label include dispatching response label,
Module responsive tags and scheduling operation label, wherein dispatching response label is the first priority, and module responsive tags are second
Priority, scheduling operation label are third priority.
In the message queue processing method of above-mentioned scheduling system, second label is dynamic labels.
In the message queue processing method of above-mentioned scheduling system, when a new message is received, calculated using Hash lookup
Method is according to the first label pointer corresponding with the second label lookup, by the new information insertion message queue.
Compared with prior art, the advantages of message queue processing method of this scheduling system, is：Multiple client into
The case where being obviously improved the response speed of system when row automatic operation, having reduced system resource, call out improves system
Stability realizes the summary responses of scheduling system usage scenario.
Detailed description of the invention
Fig. 1 is structural block diagram when receiving message in the present invention.
Fig. 2 is structural block diagram when forming message queue in the present invention.
Structural block diagram when Fig. 3 is message call in the present invention.
In figure, message 1, message queue 2, message processing module 3, dispatching response label B, the first priority scheduling response mark
Sign B1, the second priority scheduling responsive tags B2, module responsive tags C, the first priority block responsive tags C1, second preferentially
Grade module responsive tags C2, scheduling operation label A, the first priority scheduling operation label A 1, the second priority scheduling operation mark
Sign A2, pointer P.
Specific embodiment
The present invention will be further described in detail with reference to the accompanying drawings and detailed description.
As shown in Figure 1-3, the message queue processing method of this scheduling system, includes the following steps：A, message is received：It receives
The message 1 sent by the access terminal of scheduling system, message 1 has the first label and the second label, wherein the first label list
It levies 1 type of message and the priority of the first different labels is different, this message 1 is excellent in second tag characterization the type message 1
First grade, the priority of the first label are higher than the priority of the second label；B, message queue is formed：It is marked according to the first label and second
Message 1 is arranged successively to form message queue 2 according to priority by label；C, message call：Message processing module 3 is from message team
Column 2 therefrom obtain message 1 and are handled, and this method is able to achieve the summary responses of scheduling system usage scenario, for two differences
The message 1 that processing rank is still simultaneously emitted by, which is able to achieve, quickly responds high-priority message 1, improves system
Response speed reduces system resource, improves the stability of system.
Specifically, in the present embodiment, it is higher than the first message 1 of the type when receiving same type message 1 and priority
When priority, before current message 1 is inserted in the first message 1 of described the type, then judge that current message 1 is with first message 1
No is to operate to identical member, if identical member, is then abandoned the first message 1 of described the type；If different members,
Then retain the first message 1 of described the type, i.e., ought receive a low priority message 1, receives a high-priority message at once
1, and when two message 1 are to identical member, can first handle high-priority message 1, after the low priority message 1 that receives it is then straight
Discarding is connect, system performance is improved, reduces the complexity of system, and the sequence problem that 1 different operation of identical message is introduced
Improved well.
Wherein, the first label in the present embodiment includes dispatching response label B, module responsive tags C and scheduling operation
Label A, wherein dispatching response label B is the first priority, and module responsive tags C is the second priority, scheduling operation label A
For third priority, the second label here is dynamic labels.Assuming that according to the second label, dispatching response label B, module response
Two priority are all had in label C and scheduling operation label A, then dispatching response label B here is divided into the first priority
Dispatching response label B 1 and the second priority scheduling responsive tags B2；Module responsive tags C points respond for the first priority block
Label C 1 and the second priority block responsive tags C2；Scheduling operation label A is divided into the first priority scheduling operation 1 He of label A
Second priority scheduling operates label A 2.
When receiving new information 1, it is assumed that pointer P is directed toward dispatching response label B and is directed toward the response of the second priority scheduling
Label B 2 then, according to the first label pointer P corresponding with the second label lookup, is newly disappeared using using Hash lookup algorithm by described
1 insertion message queue 2 of breath.
Specific embodiment described herein is only an example for the spirit of the invention.The neck of technology belonging to the present invention
The technical staff in domain can make various modifications or additions to the described embodiments or replace by a similar method
In generation, however, it does not deviate from the spirit of the invention or beyond the scope of the appended claims.
Although message 1, message queue 2, message processing module 3, dispatching response label B, first is used more herein
Priority scheduling responsive tags B1, the second priority scheduling responsive tags B2, module responsive tags C, the first priority block are rung
Answer label C 1, the second priority block responsive tags C2, scheduling operation label A, the first priority scheduling operation label A 1, second
Priority scheduling operates the terms such as label A 2, pointer P, but it does not exclude the possibility of using other terms.Use these terms
It is only for the convenience of describing and explaining the nature of the invention；Be construed as any additional limitation all and be with
What spirit of that invention was disagreed.
Claims (5)
1. a kind of message queue processing method of scheduling system, which is characterized in that this method includes the following steps：
A, message is received：The message (1) sent by the access terminal of scheduling system is received, the message (1) has first
Label and the second label, wherein the first tag characterization message (1) type and the priority of the first different labels difference, the second mark
The priority of the priority of this message (1) in label characterization the type message (1), first label is higher than the excellent of the second label
First grade；
B, message queue is formed：Message (1) is arranged successively to be formed according to priority according to the first label and the second label
Message queue (2)；
C, message call：Message processing module (3) therefrom obtains message (1) from message queue (2) and is handled.
2. the message queue processing method of scheduling system according to claim 1, which is characterized in that when receiving same class
When type message (1) and priority are higher than the priority of the first message of the type (1), current message (1) is inserted in into described the type
Before first message (1), then judge whether current message (1) with first message (1) is to operate to identical member, if phase
Same member then abandons the first message of described the type (1)；If different members, then retain the first message of described the type
(1)。
3. the message queue processing method of scheduling system according to claim 1 or 2, which is characterized in that described first
Label includes dispatching response label (B), module responsive tags (C) and scheduling operation label (A), wherein dispatching response label
It (B) is the first priority, module responsive tags (C) are the second priority, and scheduling operation label (A) is third priority.
4. the message queue processing method of scheduling system according to claim 3, which is characterized in that second label
For dynamic labels.
5. the message queue processing method of scheduling system according to claim 3, which is characterized in that when receiving new information
(1) when, using Hash lookup algorithm according to the first label pointer corresponding with the second label lookup, the new information (1) is inserted
Enter the message queue (2).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510289360.2A CN104951373B (en) | 2015-05-28 | 2015-05-28 | The message queue processing method of scheduling system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510289360.2A CN104951373B (en) | 2015-05-28 | 2015-05-28 | The message queue processing method of scheduling system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104951373A CN104951373A (en) | 2015-09-30 |
| CN104951373B true CN104951373B (en) | 2018-11-27 |
Family
ID=54166041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510289360.2A Active CN104951373B (en) | 2015-05-28 | 2015-05-28 | The message queue processing method of scheduling system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104951373B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111124716B (en) * | 2019-12-26 | 2022-10-28 | 中国航空工业集团公司沈阳飞机设计研究所 | Multi-priority queue message transmission method in unmanned aerial vehicle |
| CN113923169A (en) * | 2021-10-11 | 2022-01-11 | 浙江大华技术股份有限公司 | Message filtering method and device, storage medium and electronic device |
| CN113905336B (en) * | 2021-11-18 | 2023-03-31 | 中国平安财产保险股份有限公司 | Text recognition-based short message sending method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859122A (en) * | 2006-02-23 | 2006-11-08 | 华为技术有限公司 | Method and device for realizing classified service to business provider |
| CN101366010A (en) * | 2005-12-22 | 2009-02-11 | 直观外科手术公司 | Multi-priority messaging |
| CN101582786A (en) * | 2009-06-17 | 2009-11-18 | 中兴通讯股份有限公司 | Instant handling method and device of instant messages |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9465621B2 (en) * | 2012-12-17 | 2016-10-11 | Itron, Inc. | Priority activation of metrology driver in boot sequence |
-
2015
- 2015-05-28 CN CN201510289360.2A patent/CN104951373B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101366010A (en) * | 2005-12-22 | 2009-02-11 | 直观外科手术公司 | Multi-priority messaging |
| CN1859122A (en) * | 2006-02-23 | 2006-11-08 | 华为技术有限公司 | Method and device for realizing classified service to business provider |
| CN101582786A (en) * | 2009-06-17 | 2009-11-18 | 中兴通讯股份有限公司 | Instant handling method and device of instant messages |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104951373A (en) | 2015-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190163524A1 (en) | Method and apparatus for processing task in smart device | |
| CN104951373B (en) | The message queue processing method of scheduling system | |
| CN108322437B (en) | Adaptive communication method and device for multiple protocol devices | |
| CN103647870A (en) | Terminal and terminal expression display method | |
| CN104683472A (en) | Data transmission method capable of supporting large data volume | |
| CN105827499A (en) | Modification method of sent information, electronic equipment and application server | |
| CN106982128B (en) | Network-based community construction method | |
| CN113032093B (en) | Distributed computing method, device and platform | |
| CN107454456B (en) | Management control method and system for floating layer elements | |
| CN109217986A (en) | A kind of data transmission method and system based on Internet of Things | |
| CN105007181B (en) | Elevator Internet of Things client/server adaptation scheme and system | |
| CN106102027B (en) | Short message batch based on MapReduce submits method | |
| US20190129763A1 (en) | Processing system and processing method | |
| CN104994181A (en) | Method for displaying dynamic MAC address table in distributed OLT system | |
| CN107070872B (en) | A kind of data processing method and device for client | |
| CN103746943A (en) | Method for establishing VLAN subinterface and exchange chip using the same | |
| CN103618746A (en) | Pushed instruction-based communication method for client server | |
| CN113918640A (en) | ETL flow execution method based on asynchronous mode | |
| CN110909055A (en) | Data processing method, data processing device, electronic equipment and storage medium | |
| CN106844502B (en) | Data consistency processing method and equipment | |
| CN113473612A (en) | Communication transmission method and device | |
| CN105450786B (en) | A kind of message processing method and device | |
| CN105471646B (en) | A kind of implementation method of IEC101 stipulations boss station calling flow dynamic configuration | |
| CN104580456B (en) | A kind of dynamic message distribution method and system for distributed system | |
| CN105812279B (en) | A kind of network data dispatching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211130 Address after: Room 101, floor 1, building 19, yard 1, Baosheng South Road, Haidian District, Beijing 100192 Patentee after: Suirui Technology Group Co.,Ltd. Address before: 100192 Beijing suirui center, building 19, Aobei Science Park, 1 Baosheng South Road, Haidian District, Beijing Patentee before: Chang Guangyu Effective date of registration: 20211130 Address after: 100192 Beijing suirui center, building 19, Aobei Science Park, 1 Baosheng South Road, Haidian District, Beijing Patentee after: Chang Guangyu Address before: 310052 floor 22, Hengxin building, No. 588 Jiangnan Avenue, Binjiang District, Hangzhou City, Zhejiang Province Patentee before: ZHEJIANG UHOPE COMMUNICATIONS TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |