CN103793273A - Distributed type queue scheduling method and device based on Redis - Google Patents
Distributed type queue scheduling method and device based on Redis Download PDFInfo
- Publication number
- CN103793273A CN103793273A CN201410034919.2A CN201410034919A CN103793273A CN 103793273 A CN103793273 A CN 103793273A CN 201410034919 A CN201410034919 A CN 201410034919A CN 103793273 A CN103793273 A CN 103793273A
- Authority
- CN
- China
- Prior art keywords
- task
- handling procedure
- redis
- task data
- data queue
- 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
Images
Abstract
The invention relates to the technical field of computers, in particular to a distributed type queue scheduling method and device based on a Redis. The method comprises the steps that the names of task data queues, to be processed, in the Redis at the current moment are acquired; the information of asynchronous task processing programs connected with the Redis is acquired; according to the names of the task data queues and the information of the asynchronous task processing programs, the asynchronous task processing programs are distributed for the task data queues. According to the method, the situation that asynchronous task processing programs fight for data, and deadlock is caused is avoided.
Description
Technical field
The present invention relates to field of computer technology, relate in particular to a kind of distributed queue's dispatching method and device based on Redis.
Background technology
When having multiple pending distributed task schedulings, and when having multiple asynchronous task handling procedures (worker) and can responding described distributed task scheduling, the scheduling that how to realize distributed task scheduling is the key factor that affects distributed task scheduling execution efficiency.
In existing distributed queue dispatching method, controlling equipment adopts Redis store tasks queuing data, utilize Redis to support the feature of chained list (list) data type, deposit task queue data in Redis queue and transfer to asynchronous task handling procedure (worker) to process.Asynchronous task handling procedure (worker) obtains task data as required from described task data queue, then executes the task according to the task data of obtaining.
But, when each asynchronous task handling procedure (worker) reads task queue data from Redis, because contention data between worker may cause deadlock.
Summary of the invention
The invention provides a kind of distributed queue's dispatching method and device based on Redis, avoided contention data between asynchronous task handling procedure to cause deadlock.
On the one hand, the present invention proposes the method for a kind of distributed queue based on Redis scheduling, comprising:
The title of all pending task data queues in Redis described in acquisition current time;
Obtain the information of the asynchronous task handling procedure being connected with described Redis;
According to the information of the title of described task data queue and described asynchronous task handling procedure, it is described task data queue assignment asynchronous task handling procedure.
On the other hand, the present invention also proposes the device of a kind of distributed queue based on Redis scheduling, comprising:
Name acquiring unit, for obtaining the title of all pending task data queues of Redis described in current time;
Program acquiring unit, for obtaining the information of the asynchronous task handling procedure being connected with described Redis;
Programme distribution unit, for according to the information of the title of described task data queue and described asynchronous task handling procedure, is described task data queue assignment asynchronous task handling procedure.
Method and the device of the scheduling of the distributed queue based on Redis that the present invention proposes, realize the distributed scheduling to task data queue in Redis, reduce the dependence to relevant database in distributed queue's scheduling, avoided contention data between asynchronous task handling procedure to cause deadlock.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms a part of the present invention, does not form limitation of the invention.In the accompanying drawings:
Fig. 1 is the realization flow figure of the method for a kind of distributed queue based on the Redis scheduling that provides in the embodiment of the present invention;
Fig. 2 is the schematic diagram of the scheduling result of the task data queue that provides in the embodiment of the present invention;
Fig. 3 is the realization flow figure that the method for a kind of distributed queue based on Redis scheduling is provided in the embodiment of the present invention;
Fig. 4 is the structural representation of the device of a kind of distributed queue based on the Redis scheduling that provides in the embodiment of the present invention.
Embodiment
Below in conjunction with drawings and the specific embodiments, the present invention is carried out more in detail and complete explanation.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, in accompanying drawing, only show part related to the present invention but not full content.
Fig. 1 is the realization flow figure of the method for a kind of distributed queue based on the Redis scheduling that provides in the embodiment of the present invention.The device of the scheduling of the distributed queue based on Redis that the method that the embodiment of the present invention provides can be provided by the embodiment of the present invention is carried out, and this device can be realized by software and/or hardware.As shown in Figure 1, the method that the embodiment of the present invention provides comprises:
The title of all pending task data queues in Redis described in step 101, acquisition current time.
Redis is a stored data base based on internal memory and key-value pair (key – value).Owing to having lightweight characteristic, Redis is the key-value pair stored data base receiving much concern.Redis intermediate value (Value) is supported storage numerous types of data, for example character string (String), Hash (Map), chained list (list), the types such as set (sets) and ordered set (sorted sets).The chained list providing in Redis can be used as the task data queue of lightweight.In Redis, the title of task data queue is made up of task names and queue numbering, makes can obtain all pending task data queues by the order of key word fuzzy query in Redis.Preferably, task names has unified prefix, and for example, task names all has prefix " Queue-" can pass through " keysQueue-* " order fuzzy matching, dynamically obtains the title of all pending task data queues of current time in Redis.
The information of the asynchronous task handling procedure that step 102, acquisition are connected with described Redis.
Before carrying out the scheduling of distributed queue, the preset passage (channel) that passes through is set up the worker of each pending distributed task scheduling data queue and being connected of Redis.Because each worker is all corresponding with passage, the information that obtains each passage being connected with Redis can obtain the information of each worker being connected with described Redis, wherein, the information of passage comprises the number of passage and the title of passage, and the information of worker comprises the number of worker and the title of worker.If can directly obtain by pub/sub order the information of all passages that are connected with Redis in Redis, can directly obtain the title of all passages by the order of key word fuzzy query.Preferably, task names has unified prefix, and for example prefix is that " channel-" can pass through " keys channel-* " order fuzzy matching, dynamically obtains the title of each passage being connected with Redis.If can not directly obtain by pub/sub order the number of connected all passages in Redis, obtain the tunnel name of preserving in all heartbeat packet.Preferably, the tunnel name of preserving in each heartbeat packet has unified prefix, and for example their prefix is " channel-".
It should be noted that, preset while setting up being connected of Redis and each asynchronous task handling procedure, the worker of each pending distributed queue is connected with Redis by passage, concrete, when Redis is that lowest version is while not having the order of the title that obtains all passages that are connected with Redis in Redis, each worker periodically sends heartbeat packet to Redis, and wherein heartbeat packet comprises the title of worker respective channel.In the time thering is the order that obtains all tunnel names in Redis, directly obtain the title of each passage by order.Preferably, each worker is connected with Redis by a unique passage, and each worker is corresponding with unique passage, while making as certain worker allocating task data queue, only task data queue assignment need be given and its unique corresponding passage.
Step 103, according to the information of the title of described task data queue and described asynchronous task handling procedure, be described task data queue assignment asynchronous task handling procedure.
Adopt dispatching algorithm by each task data queue assignment in Redis to each worker of being connected with Redis, by each task data queue assignment in Reids in each passage.Concrete, according to the information of the title of described task data queue and described asynchronous task handling procedure, be described task data queue assignment asynchronous task handling procedure, comprising:
Calculate asynchronous task handling procedure corresponding to described task data queue by following formula:
i?mod?j=k
Wherein, i is the queue numbering of described task data queue, j is the number of the asynchronous task handling procedure that is connected with described Redis, k be in the asynchronous task handling procedure connecting with described Redis with the task data queue that is numbered i the numbering of corresponding asynchronous task handling procedure;
The executive routine of asynchronous task handling procedure all data in the task data queue of the described i of being numbered of k will be numbered.
As shown in Figure 2, in Reids, there are 5 pending task data queues and 2 passages that are connected with Redis, and the title of each task data queue is followed successively by Queue-0, Queue-1, Queue-2, Queue-3 and Queue-4, the title of two passages is followed successively by passage-0 and passage-1, be task data queue assignment worker described in each, be described in each computation process of task data queue assignment passage as follows:
Queue-0%2=0；
Queue-1%2=1；
Queue-2%2=0；
Queue-3%2=1；
Queue-4%2=0
The above results be 0 task data queue assignment to the worker-0 being connected with passage " passage-0 ", the task data queue assignment that result is 1 arrives the worker-1 being connected with passage " passage-1 ".Therefore, the task data queue that worker-0 will receive has Queue-0, Queue-2 and Queue-4, and the task data queue that worker-1 will receive has Queue-1 and Queue-3.
It should be noted that, because the task queue data in Redis are with the form storage of chained list, and chained list is not supported random access, the executive routine of asynchronous task handling procedure all data in the task data queue of the described i of being numbered of k will be numbered, while being in Redis described in each task data queue assignment worker, each task data queue all need to be done to as a whole scheduling.
The asynchronous task handling procedure that is numbered k, after the executive routine of the task data queue of the described i of being numbered, is also comprised: described in sending to the asynchronous task handling procedure of the described k of being numbered, be numbered the task data queue of i.
For example, publish order by Lua script is sent to the task data in the task data queue of each i of being numbered in the worker that is numbered k, concrete, the task data being numbered in Redis in the task data queue of i is sent in the passage being connected with the worker that is numbered k, and the worker that notice is numbered k goes to process corresponding data.Server is carried out Lua script by Crontab order timing, and uses EvalSHA buffer memory content for script.Unless Redis place server is cut off, otherwise dispatching process can be carried out always.
According to the information of the title of described task data queue and described asynchronous task handling procedure, after described task data queue assignment asynchronous task handling procedure, also comprise:
Receive the delete instruction of the asynchronous task handling procedure transmission distributing;
Delete the data in corresponding task data queue in described Redis according to described delete instruction.
Exemplary, the worker that is numbered k obtains after the title of the task data queue that is numbered i, first by LRange order from be numbered i task data queue head (for example, the right side of the task data queue shown in Fig. 2) take out a part of data and carry out batch processing, after task data queue processing completes, use Trim order to delete the data of handling, avoid directly taking out data from being numbered the task data queue of i with Lpop order, when tasks carrying failure, caused data to be lost from task data queue.
After described task data queue assignment asynchronous task handling procedure, also comprise: receive task data; The described task data receiving is inserted in the task data queue of Redis, triggered operation dispatching.Preferably, the reception task data of timing, and by Lush order, task data is saved in task data queue.And then after having added new task data in task data queue in Redis, re-execute the scheduling of each task data queue in Redis.
The dispatching method of the distributed queue based on Redis that the embodiment of the present invention provides, by being each task data queue assignment passage in Redis, thereby each task data queue assignment is arrived in each asynchronous task handling procedure (worker), to realize the scheduling of each task data queue.Further, because data in Reids are to store this characteristic with chain sheet form, in dispatching method, each task data queue is all done as a whole.The embodiment of the present invention makes full use of the high-performance of Redis service, has reduced the dependence to traditional database.The embodiment of the present invention is each task data queue United Dispatching in to Redis, reduces the complicacy of logic in Worker, avoids contention data between Worker to cause deadlock.
Fig. 3 is the realization flow figure that the method for a kind of distributed queue based on Redis scheduling is provided in the embodiment of the present invention.As described in Figure 3, the process that a certain moment Redis carries out task data queue scheduling is as follows:
All pending task data queues in step 302, Dynamic Acquisition current time Reids;
Step 304, calculate the title of the pending task data queue of each worker;
The embodiment of the present invention is utilized light weight and the high-performance of Redis, avoids the queue service of operating weight level.And carry out United Dispatching at Redis server end with Lua script and Pub/Sub notice subscribing mechanism, avoid the competition between asynchronous task handling procedure to cause deadlock, and avoid the dependence of dispatching method to traditional database.
Fig. 4 is the structural representation of the device of a kind of distributed queue based on the Redis scheduling that provides in the embodiment of the present invention.
In the embodiment of the present invention and the present invention, embodiment of the method belongs to unified design, for realizing method embodiment illustrated in fig. 1.As shown in Figure 4, the device that the embodiment of the present invention provides, comprising:
Name acquiring unit 401, for obtaining the title of all pending task data queues of Redis described in current time;
Described programme distribution unit 403 comprises:
Program computing unit, for calculate asynchronous task handling procedure corresponding to described task data queue by following formula:
i?mod?j=k
Wherein, i is the queue numbering of described task data queue, j is the number of the asynchronous task handling procedure that is connected with described Redis, k be in the asynchronous task handling procedure connecting with described Redis with the task data queue that is numbered i the numbering of corresponding asynchronous task handling procedure;
Programming unit, for being numbered the asynchronous task handling procedure of k as the executive routine of all data of task data queue of the described i of being numbered.
Described device also comprises: task data queue transmitting element, is numbered the task data queue of i for the asynchronous task handling procedure to the described k of being numbered described in sending; Delete instruction receiving element, the delete instruction sending for receiving the asynchronous task handling procedure of distribution; Data delete unit, for deleting the data in the corresponding task data queue of described Redis according to described delete instruction.
Described device also comprises: task data receiving element, for receiving task data; Scheduling trigger element, for the described task data receiving being inserted to the task data queue of Redis, triggers operation dispatching.
The distributed queue's dispatching method based on Redis that the distributed queue's dispatching device based on Redis that the present embodiment provides provides for carrying out any embodiment of the present invention, possesses corresponding functional module, reaches identical technique effect.
The above is only the preferred embodiments of the present invention, is not limited to the present invention, and to those skilled in the art, the present invention can have various changes and variation.All any modifications of doing, be equal to replacement, improvement etc., within protection scope of the present invention all should be included within spirit of the present invention and principle.
Claims (10)
1. the distributed queue's dispatching method based on Redis, is characterized in that, comprising:
The title of all pending task data queues in Redis described in acquisition current time;
Obtain the information of the asynchronous task handling procedure being connected with described Redis;
According to the information of the title of described task data queue and described asynchronous task handling procedure, it is described task data queue assignment asynchronous task handling procedure.
2. method according to claim 1, is characterized in that, according to the information of the title of described task data queue and described asynchronous task handling procedure, is described task data queue assignment asynchronous task handling procedure, comprising:
Calculate asynchronous task handling procedure corresponding to described task data queue by following formula:
i?mod?j=k
Wherein, i is the queue numbering of described task data queue, j is the number of the asynchronous task handling procedure that is connected with described Redis, k be in the asynchronous task handling procedure connecting with described Redis with the task data queue that is numbered i the numbering of corresponding asynchronous task handling procedure;
The executive routine of asynchronous task handling procedure all data in the task data queue of the described i of being numbered of k will be numbered.
3. method according to claim 2, is characterized in that, the asynchronous task handling procedure that is numbered k, after the executive routine of the task data queue of the described i of being numbered, is also comprised:
Described in sending to the asynchronous task handling procedure of the described k of being numbered, be numbered the task data queue of i.
4. according to the method described in claim 1-3 any one, it is characterized in that, according to the information of the title of described task data queue and described asynchronous task handling procedure, after described task data queue assignment asynchronous task handling procedure, also comprise:
Receive the delete instruction of the asynchronous task handling procedure transmission distributing;
Delete the data in corresponding task data queue in described Redis according to described delete instruction.
5. method according to claim 4, is characterized in that, after described task data queue assignment asynchronous task handling procedure, also comprises:
Receive task data;
The described task data receiving is inserted in the task data queue of Redis, triggered operation dispatching.
6. the distributed queue's dispatching device based on Redis, is characterized in that, comprising:
Name acquiring unit, for obtaining the title of all pending task data queues of Redis described in current time;
Program acquiring unit, for obtaining the information of the asynchronous task handling procedure being connected with described Redis;
Programme distribution unit, for according to the information of the title of described task data queue and described asynchronous task handling procedure, is described task data queue assignment asynchronous task handling procedure.
7. device according to claim 6, is characterized in that, described programme distribution unit comprises:
Program computing unit, for calculate asynchronous task handling procedure corresponding to described task data queue by following formula:
i?mod?j=k
Wherein, i is the queue numbering of described task data queue, j is the number of the asynchronous task handling procedure that is connected with described Redis, k be in the asynchronous task handling procedure connecting with described Redis with the task data queue that is numbered i the numbering of corresponding asynchronous task handling procedure;
Programming unit, for being numbered the asynchronous task handling procedure of k as the executive routine of all data of task data queue of the described i of being numbered.
8. device according to claim 7, is characterized in that, described device also comprises:
Task data queue transmitting element, is numbered the task data queue of i for the asynchronous task handling procedure to the described k of being numbered described in sending.
9. according to the device described in claim 6-8 any one, it is characterized in that, described device also comprises:
Delete instruction receiving element, the delete instruction sending for receiving the asynchronous task handling procedure of distribution;
Data delete unit, for deleting the data in the corresponding task data queue of described Redis according to described delete instruction.
10. device according to claim 9, is characterized in that, described device also comprises:
Task data receiving element, for receiving task data;
Scheduling trigger element, for the described task data receiving being inserted to the task data queue of Redis, triggers operation dispatching.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410034919.2A CN103793273A (en) | 2014-01-24 | 2014-01-24 | Distributed type queue scheduling method and device based on Redis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410034919.2A CN103793273A (en) | 2014-01-24 | 2014-01-24 | Distributed type queue scheduling method and device based on Redis |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103793273A true CN103793273A (en) | 2014-05-14 |
Family
ID=50668984
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410034919.2A Pending CN103793273A (en) | 2014-01-24 | 2014-01-24 | Distributed type queue scheduling method and device based on Redis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103793273A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105760221A (en) * | 2016-02-02 | 2016-07-13 | 中博信息技术研究院有限公司 | Task dispatching system with distributed calculating frame |
| CN105843813A (en) * | 2015-01-14 | 2016-08-10 | ***通信集团重庆有限公司 | Method and device for processing big data |
| CN106445648A (en) * | 2016-10-21 | 2017-02-22 | 天津海量信息技术股份有限公司 | System for achieving multi-worker coordination based on redis |
| CN106656863A (en) * | 2016-12-31 | 2017-05-10 | 广东欧珀移动通信有限公司 | Business monitoring method and apparatus, and computer device |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107798108A (en) * | 2017-10-30 | 2018-03-13 | 中国联合网络通信集团有限公司 | A kind of asynchronous task querying method and equipment |
| CN108874513A (en) * | 2017-05-11 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Handle method, system, electronic equipment and the computer-readable medium of timed task |
| CN108958948A (en) * | 2018-06-19 | 2018-12-07 | 北京云枢网络科技有限公司 | A kind of timer event processing method, database and timer |
| CN109408212A (en) * | 2018-09-28 | 2019-03-01 | 平安科技（深圳）有限公司 | Task schedule component building method, device and storage medium, server |
| CN109410040A (en) * | 2018-11-07 | 2019-03-01 | 杭州创金聚乾网络科技有限公司 | A kind of match method, device and the equipment of loan application and investment application |
| CN109597699A (en) * | 2018-11-28 | 2019-04-09 | 泰康保险集团股份有限公司 | Data processing method, device, electronic equipment and computer-readable medium |
| CN113384874A (en) * | 2021-05-27 | 2021-09-14 | 深圳市大头互动文化传播有限公司 | Asynchronous solution method for game |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446910A (en) * | 2008-12-08 | 2009-06-03 | 哈尔滨工程大学 | AEDF task scheduling method based on SMP |
| US8056079B1 (en) * | 2005-12-22 | 2011-11-08 | The Mathworks, Inc. | Adding tasks to queued or running dynamic jobs |
| US20120023498A1 (en) * | 2010-05-18 | 2012-01-26 | Lsi Corporation | Local messaging in a scheduling hierarchy in a traffic manager of a network processor |
| CN102521051A (en) * | 2011-12-05 | 2012-06-27 | 中国联合网络通信集团有限公司 | Task scheduling method, device and system in Map Reduce system applied to nomography |
| CN103207806A (en) * | 2012-01-12 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method and system for sending messages |
| CN103294531A (en) * | 2012-03-05 | 2013-09-11 | 阿里巴巴集团控股有限公司 | Method and system for task distribution |
| CN103345423A (en) * | 2013-07-03 | 2013-10-09 | 北京京东尚科信息技术有限公司 | Method and system for processing asynchronous task |
-
2014
- 2014-01-24 CN CN201410034919.2A patent/CN103793273A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8056079B1 (en) * | 2005-12-22 | 2011-11-08 | The Mathworks, Inc. | Adding tasks to queued or running dynamic jobs |
| CN101446910A (en) * | 2008-12-08 | 2009-06-03 | 哈尔滨工程大学 | AEDF task scheduling method based on SMP |
| US20120023498A1 (en) * | 2010-05-18 | 2012-01-26 | Lsi Corporation | Local messaging in a scheduling hierarchy in a traffic manager of a network processor |
| CN102521051A (en) * | 2011-12-05 | 2012-06-27 | 中国联合网络通信集团有限公司 | Task scheduling method, device and system in Map Reduce system applied to nomography |
| CN103207806A (en) * | 2012-01-12 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method and system for sending messages |
| CN103294531A (en) * | 2012-03-05 | 2013-09-11 | 阿里巴巴集团控股有限公司 | Method and system for task distribution |
| CN103345423A (en) * | 2013-07-03 | 2013-10-09 | 北京京东尚科信息技术有限公司 | Method and system for processing asynchronous task |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105843813A (en) * | 2015-01-14 | 2016-08-10 | ***通信集团重庆有限公司 | Method and device for processing big data |
| CN105760221A (en) * | 2016-02-02 | 2016-07-13 | 中博信息技术研究院有限公司 | Task dispatching system with distributed calculating frame |
| CN106445648A (en) * | 2016-10-21 | 2017-02-22 | 天津海量信息技术股份有限公司 | System for achieving multi-worker coordination based on redis |
| CN106656863A (en) * | 2016-12-31 | 2017-05-10 | 广东欧珀移动通信有限公司 | Business monitoring method and apparatus, and computer device |
| CN108874513A (en) * | 2017-05-11 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Handle method, system, electronic equipment and the computer-readable medium of timed task |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107479829B (en) * | 2017-08-03 | 2020-04-17 | 杭州铭师堂教育科技发展有限公司 | Redis cluster mass data rapid cleaning system and method based on message queue |
| CN107798108A (en) * | 2017-10-30 | 2018-03-13 | 中国联合网络通信集团有限公司 | A kind of asynchronous task querying method and equipment |
| CN108958948A (en) * | 2018-06-19 | 2018-12-07 | 北京云枢网络科技有限公司 | A kind of timer event processing method, database and timer |
| CN109408212A (en) * | 2018-09-28 | 2019-03-01 | 平安科技（深圳）有限公司 | Task schedule component building method, device and storage medium, server |
| CN109408212B (en) * | 2018-09-28 | 2023-09-19 | 平安科技（深圳）有限公司 | Task scheduling component construction method and device, storage medium and server |
| CN109410040A (en) * | 2018-11-07 | 2019-03-01 | 杭州创金聚乾网络科技有限公司 | A kind of match method, device and the equipment of loan application and investment application |
| CN109597699A (en) * | 2018-11-28 | 2019-04-09 | 泰康保险集团股份有限公司 | Data processing method, device, electronic equipment and computer-readable medium |
| CN113384874A (en) * | 2021-05-27 | 2021-09-14 | 深圳市大头互动文化传播有限公司 | Asynchronous solution method for game |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103793273A (en) | Distributed type queue scheduling method and device based on Redis | |
| US9888048B1 (en) | Supporting millions of parallel light weight data streams in a distributed system | |
| US20200241915A1 (en) | Work conserving, load balancing, and scheduling | |
| Tan et al. | Coupling task progress for mapreduce resource-aware scheduling | |
| CN104834558B (en) | A kind of method and system of data processing | |
| US8898172B2 (en) | Parallel generation of topics from documents | |
| CN106250226B (en) | Method for scheduling task and system based on consistency hash algorithm | |
| US8806498B2 (en) | Method and system for resolving dependency among the enqueued works and/or finished works and scheduling the dependency-resolved works | |
| CN103309738B (en) | User job dispatching method and device | |
| CN102170396B (en) | QoS control method of cloud storage system based on differentiated service | |
| US8214356B1 (en) | Apparatus for elastic database processing with heterogeneous data | |
| CN104601696B (en) | Service processing method, service calling system, device and system | |
| US20130339636A1 (en) | Storage-side storage request management | |
| JP5480395B2 (en) | Stream data processing method and apparatus | |
| US20140095748A1 (en) | Reconfigurable hardware structures for functional pipelining of on-chip special purpose functions | |
| CN104598563A (en) | High concurrency data storage method and device | |
| US20130097608A1 (en) | Processor With Efficient Work Queuing | |
| US8868855B2 (en) | Request management system and method for dynamically managing prioritized requests | |
| CN104735077B (en) | It is a kind of to realize the efficiently concurrent methods of UDP using Circular buffer and circle queue | |
| US9256506B1 (en) | System and method for performing operations on target servers | |
| KR101612682B1 (en) | Method, system and computer program product for sequencing asynchronous messages in a distributed and parallel environment | |
| CN107239342A (en) | A kind of storage cluster task management method and device | |
| CN104683472A (en) | Data transmission method capable of supporting large data volume | |
| CN104346401A (en) | Method and device for message forwarding between components in cloud management platform | |
| US8156289B2 (en) | Hardware support for work queue management |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140514 |
|
| RJ01 | Rejection of invention patent application after publication |