CN104461710A - Method and device for processing tasks - Google Patents
Method and device for processing tasks Download PDFInfo
- Publication number
- CN104461710A CN104461710A CN201410773854.3A CN201410773854A CN104461710A CN 104461710 A CN104461710 A CN 104461710A CN 201410773854 A CN201410773854 A CN 201410773854A CN 104461710 A CN104461710 A CN 104461710A
- Authority
- CN
- China
- Prior art keywords
- task
- time
- module
- run
- asynchronous operation
- 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
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention provides a method and a device for processing tasks. The method includes acquiring the numbers of recorded currently concurrently processed first tasks when requests for querying first tasks of network resources are received; judging whether the numbers of the first tasks are smaller than preset threshold values or not; enabling the first tasks to asynchronously run if the numbers of the first tasks are smaller than the preset threshold values; storing the first tasks in task queues if the numbers of the first tasks are not smaller than the preset threshold values. The method and the device have the advantages that the problem of low query efficiency due to constraints of search engines on query requests in the prior art can be solved to a certain extent by the aid of the method for controlling the numbers of the concurrent tasks, and accordingly effects of improving the query efficiency can be realized.
Description
Technical field
The present invention relates to internet arena, in particular to a kind of task processing method and device.
Background technology
In today of Internet technology high speed development, become the preferred manner of people by network acquisition information.In search engine optimization (Search Engine Optimization, referred to as SEO) field, wherein, a very important step obtains keyword rank on a search engine.Owing to usually needing the rank obtaining a lot of keyword, if inquired about one by one each keyword, then efficiency is too low, so need to obtain by robotization, concurrent mode.If but simultaneously send too many inquiry request to a search engine, searched engine envelope will fall IP; And, if receive and process the data that a large amount of search engine returns simultaneously, can very consumption systems performance.
For the problem that search engine in prior art causes search efficiency low to the restriction of inquiry request, at present effective solution is not yet proposed.
Summary of the invention
Fundamental purpose of the present invention is to provide a kind of task processing method and device, to solve the problem that in prior art, search engine causes search efficiency low to the restriction of inquiry request to a certain extent.
To achieve these goals, according to an aspect of the embodiment of the present invention, a kind of task processing method is provided.Task processing method according to the present invention comprises: after the first task receiving requesting query Internet resources, obtains the first task number of the current concurrent processing of record; Judge whether described first task number is less than predetermined threshold value; If described first task number is less than described predetermined threshold value, then first task described in asynchronous operation; If described first task number is not less than described predetermined threshold value, then described first task is preserved in task queue.
Further, described in asynchronous operation, first task comprises: second time of reading the current very first time and last asynchronous operation task; Judge whether the mistiming of the described very first time and described second time reaches prefixed time interval; If the mistiming of the described very first time and described second time reaches described prefixed time interval, then first task described in asynchronous operation; If the mistiming of the described very first time and described second time does not reach described prefixed time interval, then return and read the described very first time, until the mistiming of the described very first time and described second time reaches described prefixed time interval.
Further, while preserving in task queue by described first task, described task processing method also comprises: obtain the 3rd task that current asynchronous is run; Described 3rd task arranges label, and wherein, described label is used to indicate after described 3rd task run completes, and gets next task and continue to run from described task queue.
Further, described task processing method also comprises: if described 3rd task run completes, then described first task number subtracts one.
Further, described task processing method also comprises: if first task described in asynchronous operation, then described first task number adds one.
To achieve these goals, according to the another aspect of the embodiment of the present invention, provide a kind of Task Processing Unit.Task Processing Unit according to the present invention comprises: the first acquisition module, after the first task receiving requesting query Internet resources, for obtaining the first task number of the current concurrent processing of record; Judge module, for judging whether described first task number is less than predetermined threshold value; Running module, being connected to described judge module, when the judged result of described judge module is for being, for first task described in asynchronous operation; Preserving module, being connected to described judge module, when the judged result of described judge module is no, for described first task being preserved in task queue.
Further, described operation module comprises: the first reading unit, for reading the second time of the current very first time and last asynchronous operation task; Judging unit, for judging whether the mistiming of the described very first time and described second time reaches prefixed time interval; Running unit, is connected to described judging unit, when the judged result of described judging unit is for being, for first task described in asynchronous operation; Second reading unit, is connected to described judging unit, when the judged result of described judging unit is no, reads the described very first time, until the mistiming of the described very first time and described second time reaches described prefixed time interval for returning.
Further, described device also comprises: the second acquisition module, is connected to described judge module, when the judged result of described judging unit is no, for obtaining the 3rd task that current asynchronous is run; Arrange module, for arranging label in described 3rd task, wherein, described label is used to indicate after described 3rd task run completes, and gets next task and continue to run from described task queue.
Further, described device also comprises: the first counting module, and for after described 3rd task run completes, then described first task number subtracts one.
Further, described device also comprises: the second counting module, if run first task described in module asynchronous operation, for described first task number is added one.
According to inventive embodiments, by after the first task receiving requesting query Internet resources, obtain the first task number of the current concurrent processing of record; Judge whether described first task number is less than predetermined threshold value; If described first task number is less than described predetermined threshold value, then first task described in asynchronous operation; If described first task number is not less than described predetermined threshold value, then described first task is preserved the mode in task queue, to some extent solve the problem that in prior art, search engine causes search efficiency low to the restriction of inquiry request, reach the effect improving search efficiency.
Accompanying drawing explanation
The accompanying drawing forming a application's part is used to provide a further understanding of the present invention, and schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is the process flow diagram of the task processing method according to the embodiment of the present invention;
Fig. 2 is the structural drawing of the Task Processing Unit according to the embodiment of the present invention;
Fig. 3 is the process flow diagram of the task processing method according to embodiment of the present invention.
Embodiment
It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.Below with reference to the accompanying drawings and describe the present invention in detail in conjunction with the embodiments.
The present invention program is understood better in order to make those skilled in the art person, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the embodiment of a part of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, should belong to the scope of protection of the invention.
It should be noted that, term " first ", " second " etc. in instructions of the present invention and claims and above-mentioned accompanying drawing are for distinguishing similar object, and need not be used for describing specific order or precedence.Should be appreciated that the data used like this can be exchanged, in the appropriate case so that embodiments of the invention described herein.In addition, term " comprises " and " having " and their any distortion, intention is to cover not exclusive comprising, such as, contain those steps or unit that the process of series of steps or unit, method, system, product or equipment is not necessarily limited to clearly list, but can comprise clearly do not list or for intrinsic other step of these processes, method, product or equipment or unit.
Embodiments provide a kind of task processing method.
Fig. 1 is the process flow diagram of the task processing method according to the embodiment of the present invention.As shown in Figure 1, to comprise step as follows for this task processing method:
Step S102, after the first task receiving requesting query Internet resources, obtains the first task number of the current concurrent processing of record;
Step S104, judges whether first task number is less than predetermined threshold value;
Step S106, if first task number is less than predetermined threshold value, then asynchronous operation first task;
Step S108, if first task number is not less than predetermined threshold value, then preserves first task in task queue.
Each step above-mentioned, by controlling the method for concurrent tasks number, to some extent solves the problem that in prior art, search engine causes search efficiency low to the restriction of inquiry request, reaches the effect improving search efficiency.
Wherein, the predetermined threshold value in step S104 can adjust according to the difference of search engine server, thus when not searched engine server blocks IP, can improve search efficiency to a certain extent.
First task is preserved in task queue by step S108, be in order to etc. pending number of tasks be less than predetermined threshold value, and this first task in queue of executing the task.
In an optional embodiment of the present invention, in step S106, first task described in asynchronous operation, can take as under type realizes: second time of reading the current very first time and last asynchronous operation task; Judge whether the mistiming of the very first time and the second time reaches prefixed time interval; If the mistiming of the very first time and the second time reaches prefixed time interval, then asynchronous operation first task; If the mistiming of the very first time and the second time does not reach prefixed time interval, then return and read the very first time, until the mistiming of the very first time and the second time reaches prefixed time interval.
By calculating the mistiming between two operation tasks, guaranteeing that this mistiming is greater than prefixed time interval, the probability that not searched engine server blocks IP can be increased, ensure that efficient, safe the carrying out sending query task to search engine server.Wherein, this prefixed time interval is also can carry out different settings according to the difference of search engine server, flexibility and changeability.
In an optional embodiment, after step S108, in the embodiment of the present invention, task processing method can also comprise: take the 3rd task obtaining current asynchronous operation; 3rd task arranges label, and wherein, this label is used to indicate after the 3rd task run completes, and gets next task and continue to run from task queue.By taking the mode arranging label in the 3rd task of current asynchronous operation, starting the operation to next task in task queue, avoiding the artificial participation in task processing method, improve the efficiency of task process.
Further, in an optional embodiment, count the first task number in task queue, if the 3rd task run completes, then first task number subtracts one.Because the operation of the 3rd task completes, represent the execution to next task in task queue, in time one is subtracted to first task number, can the number of tasks that step S102 in the method for task process gets be upgraded timely.
Accordingly, in another optional embodiment, when counting the first task number in task list, step S106 asynchronous operation first task, then first task number adds one.The number of tasks that step S102 in the method for task process gets can be upgraded timely.
Additionally provide a kind of device in an embodiment, this device is corresponding with the method in above-described embodiment, has carried out not repeating them here of explanation.Module in this device or unit can be store in memory and the code that can be run by processor, and this storer and processor can be arranged in server, but are not limited to this, and this device also can realize by other modes, illustrates no longer one by one at this.
Fig. 2 is the structural drawing of the Task Processing Unit according to the embodiment of the present invention.As shown in Figure 2, this Task Processing Unit comprises:
First acquisition module 22, after the first task receiving requesting query Internet resources, for obtaining the first task number of the current concurrent processing of record;
Judge module 24, for judging whether first task number is less than predetermined threshold value;
Running module 26, being connected to judge module 24, when the judged result of judge module 24 is for being, for asynchronous operation first task;
Preserving module 28, being connected to judge module 24, when the judged result of judge module 24 is no, for first task being preserved in task queue.
Above-mentioned modules, controls concurrent tasks number by judge module 24, to some extent solves the problem that in prior art, search engine causes search efficiency low to the restriction of inquiry request, reaches the effect improving search efficiency.
Wherein, the predetermined threshold value in judge module 24 can adjust according to the difference of search engine server, thus when not searched engine server blocks IP, can improve search efficiency to a certain extent.
Preserving module 28 preserves in task queue by first task, be in order to get in the first acquisition module 22 etc. pending number of tasks be less than predetermined threshold value, thus run this first task that can execute the task in queue of module 26.
In an optional embodiment of the present invention, run module 26 and can take, as under type realizes, to comprise: the first reading unit, for reading the second time of the current very first time and last asynchronous operation task; Judging unit, for judging whether the mistiming of the very first time and the second time reaches prefixed time interval; Running unit, is connected to judging unit, when the judged result of judging unit is for being, for asynchronous operation first task; Second reading unit, is connected to judging unit, when the judged result of judging unit is no, reads the very first time, until the mistiming of the very first time and the second time reaches prefixed time interval for returning.
The mistiming between two operation tasks is calculated by judging unit, when can guarantee that this mistiming is greater than prefixed time interval, running unit takes asynchronous operation first task, increase the probability that not searched engine server blocks IP, ensure that efficient, safe the carrying out sending query task to search engine server.Wherein, this prefixed time interval of judging unit is also can carry out different settings according to the difference of search engine server, flexibility and changeability.
In an optional embodiment, described Task Processing Unit can also comprise: the second acquisition module, is connected to judge module, when the judged result of judging unit is no, for obtaining the 3rd task that current asynchronous is run; Arrange module, for arranging label in the 3rd task, wherein, this label is used to indicate after the 3rd task run completes, and gets next task and continue to run from task queue.By utilizing the mode arranging and the 3rd task that module runs in current asynchronous is arranged label, starting the operation to next task in task queue, avoiding the artificial participation in task processing method, improve the efficiency of task process.
Further, Task Processing Unit of the present invention can also comprise: the first counting module, and for after the 3rd task run completes, first task number subtracts one; Second counting module, if run module asynchronous operation first task, for first task number is added one.Thus the number of tasks that the first acquisition module 22 can be made to get upgrades timely.
From above description, can find out, present invention achieves following technique effect: by the control to task number of concurrent and task concurrent interval time, can under not searched engine server blocks the prerequisite of IP, raising task treatment effeciency, saves system performance as far as possible.
Below in conjunction with concrete implementation environment, task processing method of the present invention is described.
When process multitask, a conventional task dispatcher specifies how these tasks of asynchronous schedule.So we need one can control concurrent tasks number and can arrange the scheduler in the time interval of task start.
For control task number of concurrent, when adding task, can see current concurrency, if be less than limit number, then running asynchronously, if arrived limit number, task of just preserving is in queue.Meanwhile, task is done some and arranges, specify after it completes, from task queue, get next task continue to run.
For the time interval, each when preparing an asynchronous operation task, see whether the difference of the time of current time and last asynchronous operation task reaches interval time, if just do not wait for, until reach the time interval to the time interval.
So, just can obtain the controlled and task dispatcher that task start interval is controlled of concurrent tasks number, thus to some extent solve the problem that in prior art, search engine causes search efficiency low to the restriction of inquiry request.
Fig. 3 is the process flow diagram of the task processing method according to embodiment of the present invention, and as shown in Figure 3, the concrete steps of this flow process are as follows:
Step S302, arranges a task counter, task queue, time regulator, and appointed task upper limit number and task start interval.
Particularly, task counter is initially 0, and task queue is initially sky, and time regulator initial value is minimum time value.
Step S304, when adding a new task, if task counter does not reach task upper limit number, then task counter adds 1, this new task of asynchronous operation simultaneously; Otherwise, task is put into task queue.
Step S306, the concrete processing procedure before asynchronous operation task comprises task run, after task run:
1) before task run, checking the time interval of current time and time regulator, as do not arrived task start interval, then waiting for, until meet task start interval.After meeting task start interval, current time is charged to time regulator.
2) after task run, check task queue, if can next task be taken, then next task is repeated this, otherwise task counter subtracts 1.
By step S302 to step S304, a task dispatcher just can be obtained.
Above embodiment, some special duty of execution that can be concurrent, such as crawls search-engine results page.In addition, if also have other tasks in operation, concurrency can also be controlled, to reach the effect of saving performance.
Obviously, those skilled in the art should be understood that, above-mentioned of the present invention each module or each step can realize with general calculation element, they can concentrate on single calculation element, or be distributed on network that multiple calculation element forms, alternatively, they can realize with the executable program code of calculation element, thus, they can be stored and be performed by calculation element in the storage device, or they are made into each integrated circuit modules respectively, or the multiple module in them or step are made into single integrated circuit module to realize.Like this, the present invention is not restricted to any specific hardware and software combination
It should be noted that, for aforesaid each embodiment of the method, in order to simple description, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not by the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in instructions all belongs to preferred embodiment, and involved action and module might not be that the present invention is necessary.
In the above-described embodiments, the description of each embodiment is all emphasized particularly on different fields, in certain embodiment, there is no the part described in detail, can see the associated description of other embodiments.
In several embodiments that the application provides, should be understood that, disclosed device, the mode by other realizes.Such as, device embodiment described above is only schematic, the such as division of described unit, be only a kind of logic function to divide, actual can have other dividing mode when realizing, such as multiple unit or assembly can in conjunction with or another system can be integrated into, or some features can be ignored, or do not perform.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be by some interfaces, and the indirect coupling of device or unit or communication connection can be electrical or other form.
The described unit illustrated as separating component or can may not be and physically separates, and the parts as unit display can be or may not be physical location, namely can be positioned at a place, or also can be distributed in multiple network element.Some or all of unit wherein can be selected according to the actual needs to realize the object of the present embodiment scheme.
In addition, each functional module in each embodiment of the present invention can be integrated in a processing unit, also can be that the independent physics of modules exists, also can two or more module integrations in a module.Above-mentioned integrated module both can adopt the form of hardware to realize, and the form of SFU software functional unit also can be adopted to realize.
If described integrated unit using the form of SFU software functional unit realize and as independently production marketing or use time, can be stored in a computer read/write memory medium.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words or all or part of of this technical scheme can embody with the form of software product, this computer software product is stored in a storage medium, comprises all or part of step of some instructions in order to make a computer equipment (can be personal computer, mobile terminal, server or the network equipment etc.) perform method described in each embodiment of the present invention.And aforesaid storage medium comprises: USB flash disk, ROM (read-only memory) (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), portable hard drive, magnetic disc or CD etc. various can be program code stored medium.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a task processing method, is characterized in that, comprising:
After the first task receiving requesting query Internet resources, obtain the first task number of the current concurrent processing of record;
Judge whether described first task number is less than predetermined threshold value;
If described first task number is less than described predetermined threshold value, then first task described in asynchronous operation;
If described first task number is not less than described predetermined threshold value, then described first task is preserved in task queue.
2. task processing method according to claim 1, is characterized in that, described in asynchronous operation, first task comprises:
Read the second time of the current very first time and last asynchronous operation task;
Judge whether the mistiming of the described very first time and described second time reaches prefixed time interval;
If the mistiming of the described very first time and described second time reaches described prefixed time interval, then first task described in asynchronous operation;
If the mistiming of the described very first time and described second time does not reach described prefixed time interval, then return and read the described very first time, until the mistiming of the described very first time and described second time reaches described prefixed time interval.
3. task processing method according to claim 1 and 2, is characterized in that, while preserving in task queue by described first task, described task processing method also comprises:
Obtain the 3rd task that current asynchronous is run;
Described 3rd task arranges label, and wherein, described label is used to indicate after described 3rd task run completes, and gets next task and continue to run from described task queue.
4. task processing method according to claim 3, is characterized in that, described task processing method also comprises:
If described 3rd task run completes, then described first task number subtracts one.
5. task processing method according to claim 1 and 2, is characterized in that, described task processing method also comprises:
If first task described in asynchronous operation, then described first task number adds one.
6. a Task Processing Unit, is characterized in that, comprising:
First acquisition module, after the first task receiving requesting query Internet resources, for obtaining the first task number of the current concurrent processing of record;
Judge module, for judging whether described first task number is less than predetermined threshold value;
Running module, being connected to described judge module, when the judged result of described judge module is for being, for first task described in asynchronous operation;
Preserving module, being connected to described judge module, when the judged result of described judge module is no, for described first task being preserved in task queue.
7. Task Processing Unit according to claim 6, is characterized in that, described operation module comprises:
First reading unit, for reading the second time of the current very first time and last asynchronous operation task;
Judging unit, for judging whether the mistiming of the described very first time and described second time reaches prefixed time interval;
Running unit, is connected to described judging unit, when the judged result of described judging unit is for being, for first task described in asynchronous operation;
Second reading unit, is connected to described judging unit, when the judged result of described judging unit is no, reads the described very first time, until the mistiming of the described very first time and described second time reaches described prefixed time interval for returning.
8. the Task Processing Unit according to claim 6 or 7, is characterized in that, described device also comprises:
Second acquisition module, is connected to described judge module, when the judged result of described judging unit is no, for obtaining the 3rd task that current asynchronous is run;
Arrange module, for arranging label in described 3rd task, wherein, described label is used to indicate after described 3rd task run completes, and gets next task and continue to run from described task queue.
9. Task Processing Unit according to claim 8, is characterized in that, described device also comprises:
First counting module, for after described 3rd task run completes, then described first task number subtracts one.
10. the Task Processing Unit according to claim 6 or 7, is characterized in that, described device also comprises:
Second counting module, if run first task described in module asynchronous operation, for described first task number is added one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410773854.3A CN104461710A (en) | 2014-12-12 | 2014-12-12 | Method and device for processing tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410773854.3A CN104461710A (en) | 2014-12-12 | 2014-12-12 | Method and device for processing tasks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104461710A true CN104461710A (en) | 2015-03-25 |
Family
ID=52907812
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410773854.3A Pending CN104461710A (en) | 2014-12-12 | 2014-12-12 | Method and device for processing tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104461710A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104731663A (en) * | 2015-03-31 | 2015-06-24 | 北京奇艺世纪科技有限公司 | Task processing method and system |
| CN105354080A (en) * | 2015-10-29 | 2016-02-24 | 无锡天脉聚源传媒科技有限公司 | Task processing method and apparatus |
| CN107544849A (en) * | 2017-09-30 | 2018-01-05 | 北京天元创新科技有限公司 | A kind of WEB server concurrency management method and system |
| CN107832134A (en) * | 2017-11-24 | 2018-03-23 | 平安科技（深圳）有限公司 | multi-task processing method, application server and storage medium |
| CN109347930A (en) * | 2018-09-27 | 2019-02-15 | 视联动力信息技术股份有限公司 | A kind of task processing method and device |
| CN109976920A (en) * | 2019-02-20 | 2019-07-05 | 深圳点猫科技有限公司 | A kind of implementation method and device of the concurrent type frog control for educating operating system |
| CN111064746A (en) * | 2019-12-30 | 2020-04-24 | 深信服科技股份有限公司 | Resource allocation method, device, equipment and storage medium |
| CN111367645A (en) * | 2020-03-18 | 2020-07-03 | 中国建设银行股份有限公司 | Real-time task scheduling control method, system, equipment and readable storage medium |
| CN111552565A (en) * | 2020-04-26 | 2020-08-18 | 深圳市鸿合创新信息技术有限责任公司 | Multithreading screen projection method and device |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100333091A1 (en) * | 2009-06-30 | 2010-12-30 | Sun Microsystems, Inc. | High performance implementation of the openmp tasking feature |
| CN101963922A (en) * | 2010-09-29 | 2011-02-02 | 用友软件股份有限公司 | Task processing method and device |
| CN102025782A (en) * | 2010-12-08 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Point-to-point communication method, device and system |
| CN102130973A (en) * | 2011-04-28 | 2011-07-20 | 沈阳工程学院 | System and method for performing automatic batch network forensics on email |
| CN102455940A (en) * | 2010-10-29 | 2012-05-16 | 迈普通信技术股份有限公司 | Processing method and system of timers and asynchronous events |
| CN102542379A (en) * | 2010-12-20 | 2012-07-04 | 中国移动通信集团公司 | Method, system and device for processing scheduled tasks |
| CN103279331A (en) * | 2013-05-31 | 2013-09-04 | 中国电子科技集团公司第十五研究所 | Multi-task concurrent processing method and device for Android system |
-
2014
- 2014-12-12 CN CN201410773854.3A patent/CN104461710A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100333091A1 (en) * | 2009-06-30 | 2010-12-30 | Sun Microsystems, Inc. | High performance implementation of the openmp tasking feature |
| CN101963922A (en) * | 2010-09-29 | 2011-02-02 | 用友软件股份有限公司 | Task processing method and device |
| CN102455940A (en) * | 2010-10-29 | 2012-05-16 | 迈普通信技术股份有限公司 | Processing method and system of timers and asynchronous events |
| CN102025782A (en) * | 2010-12-08 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Point-to-point communication method, device and system |
| CN102542379A (en) * | 2010-12-20 | 2012-07-04 | 中国移动通信集团公司 | Method, system and device for processing scheduled tasks |
| CN102130973A (en) * | 2011-04-28 | 2011-07-20 | 沈阳工程学院 | System and method for performing automatic batch network forensics on email |
| CN103279331A (en) * | 2013-05-31 | 2013-09-04 | 中国电子科技集团公司第十五研究所 | Multi-task concurrent processing method and device for Android system |
Non-Patent Citations (1)
| Title |
|---|
| DANGRA等: "GitHub - scrapy/scrapy at 0.20", 《HTTPS://GITHUB.COM/SCRAPY/SCRAPY/TREE/0.20》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104731663A (en) * | 2015-03-31 | 2015-06-24 | 北京奇艺世纪科技有限公司 | Task processing method and system |
| CN105354080A (en) * | 2015-10-29 | 2016-02-24 | 无锡天脉聚源传媒科技有限公司 | Task processing method and apparatus |
| CN105354080B (en) * | 2015-10-29 | 2018-11-20 | 无锡天脉聚源传媒科技有限公司 | A kind of task processing method and device |
| CN107544849A (en) * | 2017-09-30 | 2018-01-05 | 北京天元创新科技有限公司 | A kind of WEB server concurrency management method and system |
| CN107832134A (en) * | 2017-11-24 | 2018-03-23 | 平安科技（深圳）有限公司 | multi-task processing method, application server and storage medium |
| CN109347930A (en) * | 2018-09-27 | 2019-02-15 | 视联动力信息技术股份有限公司 | A kind of task processing method and device |
| CN109347930B (en) * | 2018-09-27 | 2021-04-27 | 视联动力信息技术股份有限公司 | Task processing method and device |
| CN109976920A (en) * | 2019-02-20 | 2019-07-05 | 深圳点猫科技有限公司 | A kind of implementation method and device of the concurrent type frog control for educating operating system |
| CN111064746A (en) * | 2019-12-30 | 2020-04-24 | 深信服科技股份有限公司 | Resource allocation method, device, equipment and storage medium |
| CN111367645A (en) * | 2020-03-18 | 2020-07-03 | 中国建设银行股份有限公司 | Real-time task scheduling control method, system, equipment and readable storage medium |
| CN111367645B (en) * | 2020-03-18 | 2023-12-22 | 中国建设银行股份有限公司 | Real-time task scheduling control method, system, equipment and readable storage medium |
| CN111552565A (en) * | 2020-04-26 | 2020-08-18 | 深圳市鸿合创新信息技术有限责任公司 | Multithreading screen projection method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104461710A (en) | Method and device for processing tasks | |
| US11762697B2 (en) | Method and apparatus for scheduling resource for deep learning framework | |
| CN107515878B (en) | Data index management method and device | |
| EP3731161A1 (en) | Model application method and system, and model management method and server | |
| CN104331421A (en) | High-efficiency processing method and system for big data | |
| CN102521218B (en) | File combining method and file combining device | |
| CN110119307B (en) | Data processing request processing method and device, storage medium and electronic device | |
| CN104750690A (en) | Query processing method, device and system | |
| CN111191777B (en) | Neural network processor and control method thereof | |
| CN106131185A (en) | The processing method of a kind of video data, Apparatus and system | |
| US10241828B2 (en) | Method and system for scheduling transactions in a data system | |
| CN104484405A (en) | Method and device for carrying out crawling task | |
| CN104239134A (en) | Method and device for managing tasks of many-core system | |
| CN112540841A (en) | Task scheduling method and device, processor and electronic equipment | |
| CN111258978A (en) | Data storage method | |
| CN102760073B (en) | Method, system and device for scheduling task | |
| CN115033352A (en) | Task scheduling method, device and equipment for multi-core processor and storage medium | |
| CN109446515A (en) | Group information analysis method, electronic device and computer readable storage medium | |
| CN113132267A (en) | Distributed system, data aggregation method and computer readable storage medium | |
| CN110569129A (en) | Resource allocation method and device, storage medium and electronic device | |
| CN103501247A (en) | Method and device for processing high concurrency request | |
| CN109918277A (en) | Electronic device, the evaluation method of system log cluster analysis result and storage medium | |
| CN114296965A (en) | Feature retrieval method, feature retrieval device, electronic equipment and computer storage medium | |
| CN105138406A (en) | Task processing method, task processing device and task processing system | |
| CN113392131A (en) | Data processing method and device and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150325 |