CN116132378A - Message scheduling method and system based on snowflake algorithm and weighting algorithm - Google Patents
Message scheduling method and system based on snowflake algorithm and weighting algorithm Download PDFInfo
- Publication number
- CN116132378A CN116132378A CN202211669561.1A CN202211669561A CN116132378A CN 116132378 A CN116132378 A CN 116132378A CN 202211669561 A CN202211669561 A CN 202211669561A CN 116132378 A CN116132378 A CN 116132378A
- Authority
- CN
- China
- Prior art keywords
- scheduled
- scheduling
- message
- appointed
- factors
- 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.)
- Pending
Links
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims abstract description 34
- 241000533950 Leucojum Species 0.000 title claims abstract description 25
- 239000011159 matrix material Substances 0.000 claims abstract description 24
- 238000012163 sequencing technique Methods 0.000 claims abstract description 12
- 238000003860 storage Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 12
- 230000007246 mechanism Effects 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000009826 distribution Methods 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 238000012550 audit Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a message scheduling method and system based on a snowflake algorithm and a weighting algorithm, and belongs to the technical field of message scheduling. The method of the invention comprises the following steps: acquiring a message to be scheduled, auditing the message to be scheduled, determining appointed factors of the message to be scheduled, which are audited to pass, determining weights of the appointed factors of the message to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weights of the appointed factors; setting a scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and sequencing the message to be scheduled before scheduling according to the scheduling priority to generate a scheduling sequencing table of the message to be scheduled; and carrying out priority scheduling on the information to be scheduled for the maximum unique automatic self-increment ID. The weight factor matrix table designed by the invention is suitable for various industries, has simple design and convenient application, and has wide application range.
Description
Technical Field
The invention relates to the technical field of message scheduling, in particular to a message scheduling method and a message scheduling system based on a snowflake algorithm and a weighting algorithm.
Background
In a large and medium-sized enterprise management system, a long waiting time is always required for processing some business data, the longer the waiting time is when the business data volume is larger, and the larger the enterprise scale is, the larger the business traffic volume is. The processing is often made asynchronous due to the response time of the network itself and the design taking into account user experience constraints. When asynchronous processing of data is performed using message queues, the first-in first-out queue characteristics are often unavoidable. However, due to the large data volume and limited server resources, the waiting service is needed, and some services cannot wait for a long time because of their own properties, and at this time, an intermediate link of priority ordering needs to be added before sending the message, that is, the current message is prioritized.
Disclosure of Invention
Aiming at the problems, the invention provides a message scheduling method based on a snowflake algorithm and a weighting algorithm, which comprises the following steps:
acquiring a message to be scheduled, auditing the message to be scheduled, determining appointed factors of the message to be scheduled, which are audited to pass, determining weights of the appointed factors of the message to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weights of the appointed factors;
setting a scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and sequencing the message to be scheduled before scheduling according to the scheduling priority to generate a scheduling sequencing table of the message to be scheduled;
and aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled for which the maximum unique automatic self-increment ID is used.
Optionally, the specifying factor is determined according to actual scheduling data of the message to be scheduled, where the actual scheduling data includes: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
Alternatively, the unique auto-increment ID is counted to a number of milliseconds.
Optionally, the weighted calculation formula is as follows:
wherein ,
for the priority of the appointed factors, w is the weight of the appointed factors, y is the appointed factors, t is 1-n, and n is the number of the appointed factors.
In still another aspect, the present invention further provides a message scheduling system based on a snowflake algorithm and a weighting algorithm, including:
the weighting unit is used for acquiring the information to be scheduled, auditing the information to be scheduled, determining the appointed factors of the audited information to be scheduled, determining the weight of the appointed factors of the information to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weight of the appointed factors;
the ordering unit is used for setting scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and ordering the message to be scheduled before scheduling according to the scheduling priority so as to generate a scheduling ordering table of the message to be scheduled;
the scheduling unit is used for aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled used by the maximum unique automatic self-increment ID.
Optionally, the specifying factor is determined according to actual scheduling data of the message to be scheduled, where the actual scheduling data includes: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
Alternatively, the unique auto-increment ID is counted to a number of milliseconds.
Optionally, the weighted calculation formula is as follows:
wherein ,
for the priority of the appointed factors, w is the weight of the appointed factors, y is the appointed factors, t is 1-n, and n is the number of the appointed factors.
In yet another aspect, the present invention also provides a computing device comprising: one or more processors;
a processor for executing one or more programs;
the method as described above is implemented when the one or more programs are executed by the one or more processors.
In yet another aspect, the present invention also provides a computer readable storage medium having stored thereon a computer program which, when executed, implements a method as described above.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a message scheduling method based on a snowflake algorithm and a weighting algorithm, which comprises the following steps: acquiring a message to be scheduled, auditing the message to be scheduled, determining appointed factors of the message to be scheduled, which are audited to pass, determining weights of the appointed factors of the message to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weights of the appointed factors; setting a scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and sequencing the message to be scheduled before scheduling according to the scheduling priority to generate a scheduling sequencing table of the message to be scheduled; and aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled for which the maximum unique automatic self-increment ID is used. The invention calculates the priority of the message to be sent by comprehensively considering various influencing factors by using a weighted average algorithm, then generates a unique self-increasing identification ID by using an optimized snowflake algorithm, stores the unique self-increasing identification ID in a cache, and obtains the largest ID in the cache for sending when a server is idle; on the other hand, the data processing efficiency is improved, so that the business processing efficiency is improved for enterprises. The weight factor matrix table designed by the invention is suitable for various industries, has simple design and convenient application, and has wide application range.
Drawings
FIG. 1 is a flow chart of a message scheduling method based on snowflake algorithm and weighting algorithm of the present invention;
fig. 2 is a block diagram of a message scheduling system based on a snowflake algorithm and a weighting algorithm according to the present invention.
Detailed Description
The exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, however, the present invention may be embodied in many different forms and is not limited to the examples described herein, which are provided to fully and completely disclose the present invention and fully convey the scope of the invention to those skilled in the art. The terminology used in the exemplary embodiments illustrated in the accompanying drawings is not intended to be limiting of the invention. In the drawings, like elements/components are referred to by like reference numerals.
Unless otherwise indicated, terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. In addition, it will be understood that terms defined in commonly used dictionaries should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense.
The invention aims to solve the problems of low message processing speed caused by the characteristic of first-in first-out of a message queue due to large business volume and multiple comprehensive influence factors of large and medium-sized group enterprises. Aiming at the data processing process using the message queue, a method for providing an overall scheduling message before the message is sent by a producer is provided, a factor weight matrix table is listed on the message to be sent according to factors such as different service types, system server performances and the like, then the proper priority is selected according to the data in the table, and the message is ordered before being sent, so that some urgent services are prioritized for priority treatment, and the effect of last-first-second is achieved. And the method optimizes a short-time and large-batch message distribution mechanism and improves the service data processing efficiency, thereby improving the partial service processing efficiency.
Example 1:
the invention provides a message scheduling method based on a snowflake algorithm and a weighting algorithm, which is shown in figure 1 and comprises the following steps:
step 1, obtaining a message to be scheduled, auditing the message to be scheduled, determining appointed factors of the message to be scheduled passing the auditing, determining weights of the appointed factors of the message to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weights of the appointed factors;
step 2, setting scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and sequencing the message to be scheduled before scheduling according to the scheduling priority to generate a scheduling sequencing table of the message to be scheduled;
and 3, aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled for which the maximum unique automatic self-increment ID is used.
The method comprises the steps of determining a specified factor according to actual scheduling data of a message to be scheduled, wherein the actual scheduling data comprises the following steps: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
Wherein the unique auto-increment ID counts to a number of milliseconds.
Wherein, the weight calculation formula is as follows:
wherein ,
for the priority of the appointed factors, w is the weight of the appointed factors, y is the appointed factors, t is 1-n, and n is the number of the appointed factors.
The invention is further illustrated by the following examples:
the invention provides a method for calculating message priority according to specified factors, wherein an enterprise can list a factor weight matrix table according to different specified factors, then select proper priority according to data in the table and order before sending the message. The sequenced data uses snowflake algorithm (snowflag) to generate global unique automatic self-increment ID to be put into buffer, the serial number counts to millisecond number, and the preemption algorithm (PSA) can be used to further sequence all the current messages before the ID is generated and put into buffer, always keeping the highest priority message ID maximum, and when the consumer is idle, the highest priority message is obtained to be sent.
The appointed factors in the invention can be appointed according to specific situations, for example, in the aspect of enterprise business, factors such as organization, business type and the like are considered, and if the enterprise is involved in sales, the types of materials, customer groups, supplier types and the like can be added; at the server level, considering the pressure of the server system, the processing speed of the consumer queue and the like, for convenience of viewing, all factors can be comprehensively made into a factor weight matrix table as shown in table 1:
TABLE 1
In table 1, y is a factor, w is a weight, Q is a priority, and a client can select an appropriate priority according to the matrix table.
PSA is a preemptive scheduling algorithm for threads in a processor, and in the present invention, is used for scheduling messages, where a high priority back-to message may preempt the sending of the pre-to message in a manner similar to thread scheduling.
The invention solves the problems that enterprises use message queues to process system data and the subsequent emergency service needs to wait for a long time to a certain extent, and the invention can track the message sending track and record the message log, thereby solving the problems of error reporting and log checking difficulty in the cluster environment processing process. The invention optimizes the mechanism of short-time batch message distribution and improves the efficiency of data processing.
The weight calculation formula:
wherein: in the formula (1), y is a factor, w is a weight, and the weight is required to be determined by enterprises according to own needs, for example, in group enterprises, if the payment service is urgent in a checkout time period, the weight can be set to be more than 0.5, but the weight cannot be 1, and the weight average value is higher in priority.
The invention provides a method for calculating the priority of various influencing service processing factors according to the characteristics of enterprises, and sequencing the messages to be sent;
the invention provides an optimized swflag, which generates a unique self-increment ID for the message to be sent after 1 sequencing, and the ID is calculated to a millisecond level;
the invention has unique ID for all messages to be sent, provides a preemptive priority scheduling method before putting into a cache, can reorder all messages to be sent (including the messages stored in the cache) according to priority, make the ID number of the message with high priority maximum, and then put the ordered message into the cache again;
the system is distributed, so that the same cache is needed to be used globally, and the problem of non-unique ID generated by a distributed environment snowflake algorithm is avoided;
the system is a cluster environment, can track the track of the sent message, and solves the problem of difficult log checking in the cluster environment;
the invention optimizes the distribution mechanism of short-time mass messages and improves the business processing efficiency of enterprises.
The invention calculates the priority of the message to be sent by comprehensively considering various influencing factors by using a weighted average algorithm, then generates a unique self-increasing identification ID by using an optimized snowflake algorithm, stores the unique self-increasing identification ID in a cache, and obtains the largest ID in the cache for sending when a server is idle; on the other hand, the data processing efficiency is improved, so that the business processing efficiency is improved for enterprises.
The weight factor matrix table designed by the invention is suitable for various industries, has simple design and convenient application, and has wide application range.
Example 2:
the invention also provides a message scheduling system 200 based on a snowflake algorithm and a weighting algorithm, as shown in fig. 2, comprising:
the weighting unit 201 is configured to obtain a message to be scheduled, audit the message to be scheduled, determine a specified factor of the message to be scheduled that the audit passes, determine a weight of the specified factor of the message to be scheduled based on a weighting algorithm, and construct a weight matrix of the specified factor based on the weight of the specified factor;
a sorting unit 202, configured to set a scheduling priority for the message to be scheduled according to the specified factor weight matrix, and sort the message to be scheduled before scheduling according to the scheduling priority, so as to generate a scheduling sorting table of the message to be scheduled;
the scheduling unit 203 is configured to, for the messages to be scheduled in the scheduling list, perform scheduling again for the messages to be scheduled in the scheduling list based on a preemption algorithm, update the scheduling list, generate a unique auto-increment ID for the messages to be scheduled based on a snowflake algorithm, put the unique auto-increment ID into a cache, always keep the unique auto-increment ID of the message to be scheduled with the highest priority in the cache to be the largest, and perform priority scheduling for the message to be scheduled for which the largest unique auto-increment ID is used.
The method comprises the steps of determining a specified factor according to actual scheduling data of a message to be scheduled, wherein the actual scheduling data comprises the following steps: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
Wherein the unique auto-increment ID counts to a number of milliseconds.
Wherein, the weight calculation formula is as follows:
wherein ,
for the priority of the appointed factors, w is the weight of the appointed factors, y is the appointed factors, t is 1-n, and n is the number of the appointed factors.
The invention calculates the priority of the message to be sent by comprehensively considering various influencing factors by using a weighted average algorithm, then generates a unique self-increasing identification ID by using an optimized snowflake algorithm, stores the unique self-increasing identification ID in a cache, and obtains the largest ID in the cache for sending when a server is idle; on the other hand, the data processing efficiency is improved, so that the business processing efficiency is improved for enterprises.
The weight factor matrix table designed by the invention is suitable for various industries, has simple design and convenient application, and has wide application range.
Example 3:
based on the same inventive concept, the invention also provides a computer device comprising a processor and a memory for storing a computer program comprising program instructions, the processor for executing the program instructions stored by the computer storage medium. The processor may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application SpecificIntegrated Circuit, ASIC), off-the-shelf Programmable gate arrays (FPGAs) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., which are the computational core and control core of the terminal adapted to implement one or more instructions, in particular adapted to load and execute one or more instructions within a computer storage medium to implement the corresponding method flow or corresponding functions to implement the steps of the method in the embodiments described above.
Example 4:
based on the same inventive concept, the present invention also provides a storage medium, in particular, a computer readable storage medium (Memory), which is a Memory device in a computer device, for storing programs and data. It is understood that the computer readable storage medium herein may include both built-in storage media in a computer device and extended storage media supported by the computer device. The computer-readable storage medium provides a storage space storing an operating system of the terminal. Also stored in the memory space are one or more instructions, which may be one or more computer programs (including program code), adapted to be loaded and executed by the processor. The computer readable storage medium herein may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one magnetic disk memory. One or more instructions stored in a computer-readable storage medium may be loaded and executed by a processor to implement the steps of the methods in the above-described embodiments.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The scheme in the embodiment of the invention can be realized by adopting various computer languages, such as object-oriented programming language Java, an transliteration script language JavaScript and the like.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
Claims (10)
1. A message scheduling method based on a snowflake algorithm and a weighting algorithm, the method comprising:
acquiring a message to be scheduled, auditing the message to be scheduled, determining appointed factors of the message to be scheduled, which are audited to pass, determining weights of the appointed factors of the message to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weights of the appointed factors;
setting a scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and sequencing the message to be scheduled before scheduling according to the scheduling priority to generate a scheduling sequencing table of the message to be scheduled;
and aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled for which the maximum unique automatic self-increment ID is used.
2. The method of claim 1, wherein the specified factors are determined from actual scheduling data of the message to be scheduled, the actual scheduling data comprising: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
3. The method of claim 1, wherein the unique auto-increment ID is counted in milliseconds.
4. The method of claim 1, wherein the weight calculation formula is as follows:
wherein ,
for the priority of the appointed factors, w is the weight of the appointed factors, y is the appointed factors, t is 1-n, and n is the number of the appointed factors.
5. A message scheduling system based on a snowflake algorithm and a weighting algorithm, the system comprising:
the weighting unit is used for acquiring the information to be scheduled, auditing the information to be scheduled, determining the appointed factors of the audited information to be scheduled, determining the weight of the appointed factors of the information to be scheduled based on a weighting algorithm, and constructing an appointed factor weight matrix based on the weight of the appointed factors;
the ordering unit is used for setting scheduling priority for the message to be scheduled according to the appointed factor weight matrix, and ordering the message to be scheduled before scheduling according to the scheduling priority so as to generate a scheduling ordering table of the message to be scheduled;
the scheduling unit is used for aiming at the information to be scheduled in the scheduling ordering table, ordering the information to be scheduled in the scheduling ordering table again based on a preemption algorithm to update the scheduling ordering table, generating a unique automatic self-increment ID for the information to be scheduled based on a snowflake algorithm, putting the unique automatic self-increment ID into a cache, always keeping the maximum unique automatic self-increment ID of the information to be scheduled with the highest priority in the cache, and carrying out priority scheduling on the information to be scheduled used by the maximum unique automatic self-increment ID.
6. The system of claim 5, wherein the specified factors are determined based on actual scheduling data of the message to be scheduled, the actual scheduling data comprising: the scheduling mechanism of the message to be scheduled, the service type and the scheduling processing speed.
7. The system of claim 5, wherein the unique auto-increment ID counts to a number of milliseconds.
8. The system of claim 5, wherein the weight calculation formula is as follows:
wherein ,
in order to specify the priority of the factors,w is the weight of the appointed factor, y is the appointed factor, t is 1-n, and n is the number of the appointed factors.
9. A computer device, comprising:
one or more processors;
a processor for executing one or more programs;
the method of any of claims 1-4 is implemented when the one or more programs are executed by the one or more processors.
10. A computer readable storage medium, characterized in that a computer program is stored thereon, which computer program, when executed, implements the method according to any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211669561.1A CN116132378A (en) | 2022-12-24 | 2022-12-24 | Message scheduling method and system based on snowflake algorithm and weighting algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211669561.1A CN116132378A (en) | 2022-12-24 | 2022-12-24 | Message scheduling method and system based on snowflake algorithm and weighting algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116132378A true CN116132378A (en) | 2023-05-16 |
Family
ID=86294829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211669561.1A Pending CN116132378A (en) | 2022-12-24 | 2022-12-24 | Message scheduling method and system based on snowflake algorithm and weighting algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116132378A (en) |
-
2022
- 2022-12-24 CN CN202211669561.1A patent/CN116132378A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107291545B (en) | Task scheduling method and device for multiple users in computing cluster | |
| CN107944000B (en) | Flight freight rate updating method and device, electronic equipment and storage medium | |
| US20150067028A1 (en) | Message driven method and system for optimal management of dynamic production workflows in a distributed environment | |
| JP2011192281A (en) | Virtual machine monitor and scheduling method for the same | |
| US8606905B1 (en) | Automated determination of system scalability and scalability constraint factors | |
| US20040202165A1 (en) | Message processing apparatus, method and program | |
| GB2510655A (en) | Prioritising instructions in queues according to category of instruction | |
| US9038093B1 (en) | Retrieving service request messages from a message queue maintained by a messaging middleware tool based on the origination time of the service request message | |
| CN110100235B (en) | Heterogeneous event queue | |
| CN113495779A (en) | Task scheduling method and device and task execution system | |
| CN106202092A (en) | The method and system that data process | |
| Kerkhove et al. | Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics | |
| CN108509280A (en) | A kind of Distributed Calculation cluster locality dispatching method based on push model | |
| CN111090532B (en) | Application service calling method, device, electronic equipment and computer storage medium | |
| CN109597680B (en) | Task queuing response parameter estimation method and device | |
| Jeong et al. | Algorithms for a two‐machine flowshop problem with jobs of two classes | |
| CN116132378A (en) | Message scheduling method and system based on snowflake algorithm and weighting algorithm | |
| CN106874079A (en) | A kind of method and device of tasks carrying | |
| CN115525400A (en) | Method, apparatus and program product for managing multiple computing tasks on a batch basis | |
| US20200301732A1 (en) | Information processing system and non-transitory computer readable medium storing program | |
| JPWO2004114132A1 (en) | Interrupt control method, interrupt control device, and interrupt control program | |
| Hirth et al. | Task scheduling on crowdsourcing platforms for enabling completion time slas | |
| US11474868B1 (en) | Sharded polling system | |
| Abur et al. | A critical simulation of cpu scheduling algorithm using exponential distribution | |
| CN113703945A (en) | Scheduling method, device, equipment and storage medium of micro-service cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |