CN102630316B - Processing method and apparatus of concurrent tasks - Google Patents
Processing method and apparatus of concurrent tasks Download PDFInfo
- Publication number
- CN102630316B CN102630316B CN201180003339.1A CN201180003339A CN102630316B CN 102630316 B CN102630316 B CN 102630316B CN 201180003339 A CN201180003339 A CN 201180003339A CN 102630316 B CN102630316 B CN 102630316B
- Authority
- CN
- China
- Prior art keywords
- task
- thread
- subtask
- running condition
- predetermined running
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Abstract
The present invention provides a processing method and an apparatus of concurrent tasks. The method includes: distributing a first thread to a first task, which has met a pre-determined operating condition, for the processing of the first task by the first thread, wherein the first task is one of the recorded concurrent tasks; if the first task has sub-tasks, then distributing a second thread to a sub-task when the sub-task meets the pre-determined operation condition, and recording the processing progress of the first task and release the first thread. The apparatus includes a distribution module and a release module.
Description
Technical field
The present invention relates to the communication technology, particularly relate to a kind of disposal route and device of concurrent tasks.
Background technology
At Internet technology (Internet Technology, referred to as: IT) Service-Oriented Architecture Based (the Service-Oriented Architecture in field, referred to as: SOA) apply, particularly in Page Service (WebService) application, a large amount of concurrent tasks can be run into.Service provider, in order to the response speed of the experience or system that improve user, can carry out concurrent processing to these concurrent tasks usually.
For the concurrent processing of concurrent tasks, be generally adopt the mode of multithreading to realize.Such as, when receiving concurrent tasks, each task is given an idle thread, thread processes according to task requests, until task terminates rear release thread after starting.The mode of this concurrent processing needs to create more thread, and number of threads too much can cause system call busy, inefficiency.
Summary of the invention
First aspect of the present invention is to provide a kind of disposal route of concurrent tasks, comprising:
For the first task reaching predetermined running condition distributes the first thread, to make first task described in described first thread process, described first task is a task in the concurrent tasks recorded;
If described first task has subtask, be then that the second thread is distributed in described subtask when reaching predetermined running condition in described subtask, and record the process progress of described first task, discharge described first thread.
Another aspect of the present invention is to provide a kind for the treatment of apparatus of concurrent tasks, comprising:
Distribution module, distributes the first thread for the first task for reaching predetermined running condition, and to make first task described in described first thread process, described first task is a task in the concurrent tasks recorded;
Release module, if described first task has subtask, then when described subtask reaches predetermined running condition, for for distributing the second thread in described subtask, and recording the process progress of first task, discharging described first thread.
Technique effect of the present invention is: when a task is father's task of another task, then in the process of process father task, if subtask meets predetermined running condition, record the process progress of this father's task, and the thread of this father's task of release process, the quick turnover achieving thread uses, and effectively improves the quantity of system process concurrent tasks request, enhances the processing power of system.
Accompanying drawing explanation
The process flow figure of the concurrent tasks that Fig. 1 provides for the embodiment of the present invention one;
The multiple subtask scheduling schematic diagram that Fig. 2 provides for the embodiment of the present invention one;
The process flow figure of the concurrent tasks that Fig. 3 provides for the embodiment of the present invention two;
The process flow figure of the concurrent tasks that Fig. 4 provides for the embodiment of the present invention three;
The process flow figure of the concurrent tasks that Fig. 5 provides for the embodiment of the present invention four;
The process flow figure of the concurrent tasks that Fig. 6 provides for the embodiment of the present invention five;
The treating apparatus structural representation of the concurrent tasks that Fig. 7 provides for the embodiment of the present invention six.
Embodiment
The process flow figure of the concurrent tasks that Fig. 1 provides for the embodiment of the present invention one, as shown in Figure 1, the method comprises:
Step 101, task dispatcher are that the first task having reached predetermined running condition distributes the first thread, and to make this this first task of the first thread process, this first task is a task in the concurrent tasks recorded.
Here it should be noted that, whole tasks that this task dispatcher can regularly travel through in the concurrent tasks recorded, once find that some tasks reach the predetermined running condition of this task, is just this task matching idle thread.First task is the acute pyogenic infection of finger tip of any one task in the concurrent tasks recorded, and the first thread is also the acute pyogenic infection of finger tip of any one thread in idle thread, not in order to limit the protection domain of the application.Can by whole task record in task data logger in the embodiment of the present invention, this task data record sheet can create when system initialization, is then persisted to local data base.Task data record sheet can be, but not limited to be described in table 1 below:
Table 1
| Task identification | Task status | Father's task identification | Subtask identifies | Subtask state |
| Task001 | Waiting | NULL | Task002 | Ready |
| Task002 | Running | Task001 | NULL | |
| Task003 | Waiting | NULL | Task004 | Ready |
| Task004 | Waiting | Task003 | Task005 | Waiting |
| Task005 | Running | Task004 | NULL |
Wherein, each task recorded in task data record sheet can be, but not limited to comprise following information: task identification, task status, father's task identification, subtask mark and subtask state.Wherein, task identification is used for unique identification task, as task ID, such as, goes up the Task001 etc. shown in table 1.Whether whether task status having reached predetermined running condition for identifying this task, having run, whether be in wait subtask result phase, completed.Such as, task status can be set to Preprocess (pre-service) when not reaching predetermined running condition, reach predetermined running condition and task status can be set to Ready (ready can run), running and task status can be set to Running (running), be in and wait for that task status can be set to Waiting (wait) by subtask result phase, completed and task status can be set to Done (completing).Father's task identification and subtask mark be all for sign task between communication with one another, father's task identification is used for after current task process completes, and the father's task identification preserved by oneself is found father's task and then activates father task and carries out continuations and process.Whether whether subtask state having reached predetermined running condition for identifying subtask, having run, whether be in wait subtask result phase, completed.A task existing father's task can have subtask again, if task identification in table 1 is the task of Task004, also subtask can be only had there is no father's task, if task identification in table 1 is the task of Task001, father's task can also be only had there is no subtask, if task identification in table 1 is the task of Task002, father's task can not both be had not have subtask equally yet, not shown in table 1.When there is no subtask or father's task, NULL can be labeled as.
Predetermined running condition can be a zone bit, as when the zone bit that this represents predetermined running condition is set, representative reaches predetermined running condition, or can be a data bit, when the data bit (as task status) that this represents predetermined running condition is " Ready ", representative reaches predetermined running condition.Certainly above-mentioned two kinds of modes are all the explanations to predetermined running condition possibility, and the form of the predetermined running condition that those skilled in the art's enlightenment according to the above description obtains is all in the protection domain of the application.
If step 102 first task has subtask, then for distributing the second thread in this subtask when reaching predetermined running condition in subtask, and recording the process progress of this first task, discharging this first thread.
Here father's task and subtask are described in detail.In general, if the execution of a task depends on the execution result of another task, then " task " that can think here is father's task of " another task ", and " another task " is the subtask of " task ".That is, when father's task in the process of implementation, can promoter task, also namely subtask reaches predetermined running condition, is that idle thread (being called the second thread here) is distributed in subtask.Under normal circumstances, the thread of father's task can not discharge, but waits for the execution result of subtask, then obtains the execution result of father's task according to the execution result of subtask.But in embodiments of the present invention, once for distributing idle thread in subtask, the process progress of father's task just can be recorded, then the thread of father's task is discharged.The benefit done like this is: decrease taking of thread, makes more thread can be concurrent request service.It should be noted that, subtask can also as father's task of other tasks, and carries out the process that connects with one another closely, thus realizes the modularized processing of subtask, namely each subtask can the subtask of independent design oneself, is responsible for United Dispatching by task dispatcher.The multiple subtask scheduling schematic diagram that the embodiment of the present invention one as shown in Figure 2 provides, the subtask that the subtask that task 5 is task 4, task 4 are task 3, task 3 is the subtask of task 2, and task 2 is the subtask of task 1.When task 5 is run, there is not corresponding thread in task 4, task 3, task 2 and task 1.When only having the task as subtask to complete, corresponding father's task just can be made again to be triggered, thus on the basis of the above-mentioned process progress recorded, continue this father's task of process.
Also it should be noted that, the relation between father's task and subtask can set in advance, can not arrange subtask for the task that just can process in millisecond.
The process flow figure of the concurrent tasks that Fig. 3 provides for the embodiment of the present invention two, as shown in Figure 3, step 301 and step 302 are identical with the step 101 in Fig. 1 and step 102, do not repeat herein.After step 302, the method can also comprise:
Step 303, receive the execution result of subtask, for first task distributes new thread, on the basis of the process progress of the first task recorded, continue process this first task according to the execution result of subtask with the thread making this new.
Again for father's task redistributes thread after obtaining the execution result of subtask, achieve the quick turnover of thread, be conducive to processing concurrent request better.
The process flow figure of the concurrent tasks that Fig. 4 provides for the embodiment of the present invention three, as shown in Figure 4, step 401 is identical to step 403 with the step 301 in Fig. 3 to step 303, does not repeat herein.Before step 401, the method can also comprise:
Step 400, server receive concurrent task requests, for task requests distributes idle thread (being the 3rd thread here), to make the 3rd thread, task corresponding for task requests are carried out record.
3rd thread is also the acute pyogenic infection of finger tip of any one thread in idle thread, not in order to limit the protection domain of the application.
Can be specifically the relevant information of logger task in the task data record sheet shown in table 1, include but not limited to following information: task identification, task status, father's task identification, subtask mark and subtask state.
The process flow figure of the concurrent tasks that Fig. 5 provides for the embodiment of the present invention four, as shown in Figure 5, step 500 is identical to step 503 with the step 400 in Fig. 4 to step 403, does not repeat herein.After step 500, the method can also comprise:
For the 3rd thread of logger task in step 500a, release steps 500.
In step 500 for the 3rd thread of logger task after completion of recording, namely can be released, achieve the quick transfer of thread better.
The process flow figure of the concurrent tasks that Fig. 6 provides for the embodiment of the present invention five, as shown in Figure 6, step 600 is identical to step 603 with the step 500 in Fig. 5 to step 503, does not repeat herein.Before step 601, the method can also comprise:
Step 600b, establishment query task are that this query task distributes idle thread (being called the 4th thread here).
4th thread is also the acute pyogenic infection of finger tip of any one thread in idle thread, not in order to limit the protection domain of the application.
The fundamental purpose creating this query task is: effectively control reaches the task quantity of predetermined running condition simultaneously, temporary transient delay is carried out to the task that part reaches predetermined running condition, is no more than with the quantity ensureing to distribute thread simultaneously the maximal value that thread allows to distribute simultaneously.The while that thread allowing the maximal value of simultaneously distributing to be permission system, the maximal value of the quantity of processing threads, generally rule of thumb can set, not limit herein.This query task can effectively prevent a certain moment thread too much, and the CPU fluctuation caused is excessive, the problem of system instability.
Step 600c, the 4th thread pool have reached the task quantity of predetermined running condition;
If exceed the maximal value that thread allows to distribute simultaneously, perform step 600d;
If do not exceed the maximal value that thread allows to distribute simultaneously, perform step 601.
Step 600d, perform step 600b by meeting after pre-conditioned task postpones Preset Time.
Wherein, the time delay that each different task matching is different.For process I/O very long task consuming time, as created virtual volume in cloud computing or creating the tasks such as virtual machine image, generally can be set as 500ms the scheduled wait time, namely the I/O processing time is decided to be the task of length consuming time in the task of more than 500ms.For the task of this length consuming time, just can think to meet pre-conditioned task, namely can postpone the task that certain hour distributes thread process.
When server receives task requests, record can be carried out to foregoing, and be kept at task data record sheet.Task data record sheet after preservation can be, but not limited to as shown in table 2 below:
Table 2
Relative to the task data record sheet shown in table 1, in table 2, newly increase the scheduled wait time, in order to characterize the time delay that each different task is distributed.
The disposal route of the concurrent request that the embodiment of the present invention provides, if a task is father's task of another task, then in the process of process father task, if subtask meets predetermined running condition, then record the process progress of this father's task, and the thread of this father's task of release process, after subtask processes into, be the thread that this father's task matching is new again, and continue this father's task of process according to the process progress recorded, the quick turnover achieving thread uses, effectively improve the quantity of system process concurrent tasks request, enhance the processing power of system.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can have been come by the hardware that programmed instruction is relevant, aforesaid program can be stored in a computer read/write memory medium, this program, when performing, performs the step comprising said method embodiment; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
The treating apparatus structural representation of the concurrent tasks that Fig. 7 provides for the embodiment of the present invention six, this device is the specific executive agent of said method embodiment, and its concrete execution flow process with reference to the description in said method embodiment, can not repeat herein.As shown in Figure 7, the treating apparatus of this concurrent tasks comprises: distribution module 701 and release module 702.Wherein, distribution module 701, distributes the first thread for the first task for reaching predetermined running condition, and to make this this first task of the first thread process, this first task is a task in the concurrent tasks recorded.Release module 702, if this first task has subtask, then when reaching predetermined running condition in subtask, for for distributing the second thread in this subtask, and recording the process progress of this first task, discharging this first thread.
On the basis of said apparatus, this device can also comprise: receiver module.This receiver module, for receiving the execution result of this subtask, for this first task distributes new thread, continues process this first task according to the execution result of this subtask with the thread making this new on the basis of the process progress of this first task.
On the basis of said apparatus, this device can also comprise: logging modle.Task corresponding for task requests, for receiving concurrent task requests, for task requests distributes the 3rd thread, is carried out record to make the 3rd thread by this logging modle.
Further, release module 702 also for: be that task requests distributes idle thread in logging modle, to make after task corresponding for task requests records by the 3rd thread, to discharge the 3rd thread.
On the basis of above-mentioned embodiment, this device can also comprise: creation module, for creating query task, for query task distributes the 4th thread, with the task quantity making the 4th thread pool reach predetermined running condition; If the task quantity having reached predetermined running condition does not exceed the maximal value that thread allows to distribute simultaneously, then distribution module 701 is that the first task having reached predetermined running condition distributes the first thread.
Further, creation module can also be used for: if the task quantity having reached predetermined running condition exceeds the maximal value that thread allows to distribute simultaneously, postpones Preset Time by meeting pre-conditioned task.
In above-mentioned embodiment, in the concurrent tasks recorded, each task at least records following information: the parameter such as task identification, father's task identification, subtask mark, subtask state.
The treating apparatus of the concurrent request that the embodiment of the present invention provides, if a task is father's task of another task, then in the process of process father task, if subtask meets predetermined running condition, then record the process progress of this father's task, and the thread of this father's task of release process, after subtask processes into, be the thread that this father's task matching is new again, and continue this father's task of process according to the process progress recorded, the quick turnover achieving thread uses, effectively improve the quantity of system process concurrent tasks request, enhance the processing power of system.
Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.
Claims (12)
1. a disposal route for concurrent tasks, is characterized in that, comprising:
Regularly travel through the whole tasks in the concurrent tasks recorded, for the first task reaching predetermined running condition distributes the first thread, to make first task described in described first thread process, described first task is a task in the concurrent tasks recorded;
If described first task has subtask, be then that the second thread is distributed in described subtask when reaching predetermined running condition in described subtask, and record the process progress of described first task, discharge described first thread;
Wherein, in the described concurrent tasks recorded, each task at least records following information: task identification, task status, father's task identification, subtask mark, subtask state; Whether whether described task status having reached predetermined running condition for identifying this task, having run, whether be in wait subtask result phase, completed.
2. method according to claim 1, is characterized in that, after described first thread of described release, described method also comprises:
Receive the execution result of described subtask, for described first task distributes new thread, on the basis of the process progress of described first task, continue process described first task according to the execution result of described subtask to make described new thread.
3. method according to claim 1, is characterized in that, before the described first task for reaching predetermined running condition distributes the first thread, described method also comprises:
Receive concurrent task requests;
For described task requests distributes the 3rd thread, to make described 3rd thread, task corresponding for described task requests is carried out record.
4. method according to claim 3, is characterized in that, described is that described task requests distributes the 3rd thread, and to make after task corresponding for described task requests records by described 3rd thread, described method also comprises:
Discharge described 3rd thread.
5. according to the arbitrary described method of Claims 1-4, it is characterized in that, the described first task for reaching predetermined running condition distributes the first thread, specifically comprises:
Create query task, for described query task distributes the 4th thread, reach the task quantity of described predetermined running condition to make described 4th thread pool; If the task quantity having reached described predetermined running condition described does not exceed preset value, then the described first task for reaching described predetermined running condition distributes the first thread.
6. method according to claim 5, is characterized in that, the task quantity having reached described predetermined running condition if described exceeds preset value, and described method also comprises:
Preset Time is postponed by meeting pre-conditioned task.
7. a treating apparatus for concurrent tasks, is characterized in that, comprising:
Distribution module, for regularly traveling through the whole tasks in the concurrent tasks that recorded, for the first task reaching predetermined running condition distributes the first thread, to make first task described in described first thread process, described first task is a task in the concurrent tasks recorded;
Release module, if described first task has subtask, then when described subtask reaches predetermined running condition, for for distributing the second thread in described subtask, and recording the process progress of described first task, then discharging described first thread;
Wherein, in the described concurrent tasks recorded, each task at least records following information: task identification, task status, father's task identification, subtask mark, subtask state; Whether whether described task status having reached predetermined running condition for identifying this task, having run, whether be in wait subtask result phase, completed.
8. device according to claim 7, is characterized in that, described device also comprises:
Receiver module, for receiving the execution result of described subtask, for described first task distributes new thread, continues process described first task according to the execution result of described subtask to make described new thread on the basis of the process progress of described first task.
9. device according to claim 7, is characterized in that, described device also comprises:
Logging modle, for receiving concurrent task requests, for described task requests distributes the 3rd thread, carries out record to make described 3rd thread by task corresponding for described task requests.
10. device according to claim 9, it is characterized in that, described release module also for: be that described task requests distributes described 3rd thread in described logging modle, to make after task corresponding for described task requests records by described 3rd thread, to discharge described 3rd thread.
11., according to the arbitrary described device of claim 7 to 10, is characterized in that, also comprise:
Creation module, for creating query task, for described query task distributes the 4th thread, has reached the task quantity of described predetermined running condition to make described 4th thread pool; If the task quantity having reached described predetermined running condition described does not exceed preset value, then described distribution module is that the first task having reached predetermined running condition distributes the first thread.
12. devices according to claim 11, is characterized in that, described creation module also for: the task quantity having reached described predetermined running condition if described exceeds preset value, will meet pre-conditioned task and postpone Preset Time.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2011/084451 WO2013091219A1 (en) | 2011-12-22 | 2011-12-22 | Method and apparatus for processing concurrent tasks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102630316A CN102630316A (en) | 2012-08-08 |
| CN102630316B true CN102630316B (en) | 2015-05-06 |
Family
ID=46588266
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201180003339.1A Expired - Fee Related CN102630316B (en) | 2011-12-22 | 2011-12-22 | Processing method and apparatus of concurrent tasks |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102630316B (en) |
| WO (1) | WO2013091219A1 (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103942098A (en) * | 2014-04-29 | 2014-07-23 | 国家电网公司 | System and method for task processing |
| CN105630588B (en) * | 2014-11-06 | 2019-03-01 | 卓望数码技术（深圳）有限公司 | A kind of Distributed Job Scheduling method and system |
| CN106325989A (en) * | 2016-08-17 | 2017-01-11 | 东软集团股份有限公司 | Task execution method and device |
| CN106531168B (en) * | 2016-11-18 | 2020-04-28 | 北京云知声信息技术有限公司 | Voice recognition method and device |
| CN108319495B (en) * | 2017-01-16 | 2023-01-31 | 阿里巴巴集团控股有限公司 | Task processing method and device |
| CN107256180B (en) * | 2017-05-19 | 2019-04-26 | 腾讯科技（深圳）有限公司 | Data processing method, device and terminal |
| CN107341054B (en) * | 2017-06-29 | 2020-06-16 | 广州市百果园信息技术有限公司 | Task execution method and device and computer readable storage medium |
| CN109582396B (en) * | 2017-09-25 | 2022-02-18 | 北京国双科技有限公司 | Task state processing method, device and system and storage medium |
| CN107678838B (en) * | 2017-10-19 | 2021-07-02 | 郑州云海信息技术有限公司 | Method and device for tracking operation of virtual machine and virtual machine management platform |
| CN108196882A (en) * | 2017-12-29 | 2018-06-22 | 普强信息技术（北京）有限公司 | A kind of accelerating method and device for neural computing |
| CN110333915A (en) * | 2019-05-31 | 2019-10-15 | 深圳壹账通智能科技有限公司 | Timing executes method, apparatus, computer equipment and the storage medium of task |
| CN117290113B (en) * | 2023-11-22 | 2024-02-13 | 太平金融科技服务（上海）有限公司 | Task processing method, device, system and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101596113A (en) * | 2008-06-06 | 2009-12-09 | 中国科学院过程工程研究所 | A kind of CT parallel reconstructing system and formation method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009033248A1 (en) * | 2007-09-10 | 2009-03-19 | Novell, Inc. | A method for efficient thread usage for hierarchically structured tasks |
| US7941646B2 (en) * | 2007-12-31 | 2011-05-10 | Freescale Semicondoctor, Inc. | Completion continue on thread switch based on instruction progress metric mechanism for a microprocessor |
| US8453156B2 (en) * | 2009-03-30 | 2013-05-28 | Intel Corporation | Method and system to perform load balancing of a task-based multi-threaded application |
-
2011
- 2011-12-22 WO PCT/CN2011/084451 patent/WO2013091219A1/en active Application Filing
- 2011-12-22 CN CN201180003339.1A patent/CN102630316B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101596113A (en) * | 2008-06-06 | 2009-12-09 | 中国科学院过程工程研究所 | A kind of CT parallel reconstructing system and formation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102630316A (en) | 2012-08-08 |
| WO2013091219A1 (en) | 2013-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102630316B (en) | Processing method and apparatus of concurrent tasks | |
| Liu et al. | Priority-based consolidation of parallel workloads in the cloud | |
| CN102317917B (en) | Hot field virtual machine cpu dispatching method and virtual machine system (vms) | |
| CN105579959A (en) | Virtualization of hardware accelerator | |
| CN106980546A (en) | A kind of task asynchronous execution method, apparatus and system | |
| CN104011685A (en) | Resource management method of virtual machine system, virtual machine system, and apparatus | |
| KR20120017294A (en) | System and method of scheduling | |
| CN106681840A (en) | Tasking scheduling method and device for cloud operating system | |
| CN104252390A (en) | Resource scheduling method, device and system | |
| CN101661486A (en) | Method and system for fragment sorting for hard disk of host comprising virtual computer | |
| US20100042723A1 (en) | Method and system for managing load in a network | |
| CN107864211B (en) | Cluster resource dispatching method and system | |
| CN104023042B (en) | Cloud platform resource scheduling method | |
| CN101510163A (en) | Processing method and system for planning task | |
| CN108334409A (en) | A kind of fine-grained high-performance cloud resource management dispatching method | |
| CN102520887A (en) | Storage space configuration and management method applied to cloud computing | |
| CN106325989A (en) | Task execution method and device | |
| CN105786619A (en) | Virtual machine distribution method and device | |
| CN102629220A (en) | Dynamic task allocation and management method | |
| EP2972840A1 (en) | Co-processor-based array-oriented database processing | |
| CN103685492A (en) | Dispatching method, dispatching device and application of Hadoop trunking system | |
| CN110442454A (en) | A kind of resource regulating method, device and computer equipment | |
| CN102760073A (en) | Method, system and device for scheduling task | |
| CN102201922B (en) | Data charging method and relevant apparatus | |
| CN101770504A (en) | Data storage method, data reading method, data storage equipment and data reading equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150506 Termination date: 20191222 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |