CN104021040A - Cloud computing associated task scheduling method and device based on time constraint - Google Patents
Cloud computing associated task scheduling method and device based on time constraint Download PDFInfo
- Publication number
- CN104021040A CN104021040A CN201410245649.XA CN201410245649A CN104021040A CN 104021040 A CN104021040 A CN 104021040A CN 201410245649 A CN201410245649 A CN 201410245649A CN 104021040 A CN104021040 A CN 104021040A
- Authority
- CN
- China
- Prior art keywords
- task
- tasks
- virtual machine
- time
- unit
- 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.)
- Granted
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a cloud computing associated task scheduling method and device based on time constraint. The method comprises the steps that firstly, the associated relation between tasks in an associated task set is expressed by building a DAG; the thought of layering the DAG is adopted to enable unassociated tasks in the same layer to be fallen into the same task set; hardware resources are virtualized, and a virtual machine cluster is built so as to provide task execution places; finally, the layering scheduling method based on the time constraint is adopted to schedule the tasks in the task set in each layer to the most appropriate virtual machine to be executed so as to ensure that the tasks are completed on schedule. According to the technical scheme, the problem that execution of the cloud computing associated tasks is delayed in the scheduling process in the prior art is effectively solved, the delay phenomena of the tasks can be reduced to the maximum, it is ensured that the tasks are completed within the time expected by a user, and meanwhile virtual machine resources are effectively utilized.
Description
Technical field
The present invention relates to a kind of cloud computing associated task dispatching method and device, be specifically related to a kind of cloud computing associated task dispatching method and device based under time constraint condition.
Background technology
Cloud computing technology is emphasis and the Disciplinary Frontiers of the outer computer technology research of Present Domestic, cloud computing offers user by dynamic telescopic virtual resources in the mode of service, can effectively reduce user's hardware spending, and obtain high-quality service with lower cost.
The cloud computing that develops into of Intel Virtualization Technology provides good solution, by hardware resource is virtual, form multiple independently cluster virtual machines, user uses virtual machine by the mode of application, can effectively save the expense of hardware resource, improve effective utilization of resource and saved the cost of management.The Main Function of cloud computing task scheduling is exactly that the task application that user is submitted to is distributed to virtual machine by certain method, being submitted to by virtual machine completing user of task.
In submitting to user of task, some task is not single independent task, but there is the associated task of execution order precedence relationship, these associated tasks can not be assigned to virtual machine in the process of carrying out task scheduling simultaneously, need to wait for after own predecessor task completes just can be scheduled, in the process of this associated task scheduling, once delay appears in the execution of certain task, will affect the execution of subsequent tasks, thereby affect the deadline of whole associated task group.Current existing associated task dispatching method just considers a problem from the communications cost between minimizing task mostly, and does not have too many solution for the situation that goes out current task delay.
In the time that user has submitted one group of associated task to, in the time how the delay situation generation guarantee task of maximized minimizing task can be expected user, complete, finding more Parallel Task Scheduling to suitable virtual machine becomes matter of utmost importance to be solved by this invention with the effective utilization that reaches resource.
Summary of the invention
Goal of the invention: the object of the invention is for solve associated task in scheduling process, go out current task postpone in the situation that, in task scheduling process, because each task is to be mutually related on execution order, all tasks have forerunner or subsequent tasks, in the time that certain task occurs postponing in the process of implementation, the execution of subsequent tasks must be affected.How maximizing this impact of elimination and resources of virtual machine is utilized effectively is major issue to be solved by this invention.
Technical scheme: a kind of cloud computing associated task dispatching method based under time constraint condition, comprises the following steps:
(1) all tasks in associated task group are set up to DAG figure (without loop digraph) according to the precedence of its execution;
(2) according to the DAG figure having built in described step (1), all tasks being divided into different task-set by level, is every layer of task-set limiting time constraint;
(3) hardware resource is virtual, build cluster virtual machine;
(4) according to the time-constrain situation of every layer of task-set by task scheduling to corresponding virtual machine in cluster virtual machine.
In associated task of the present invention, the relevance between task is embodied on the execution order of task, and each task has its forerunner or subsequent tasks, only has in the time that the direct precursor task of each task completes, and its subsequent tasks could start to carry out.The detailed process of setting up DAG figure in described step (1) is:
(1.1) definition G={T, Λ, C} is the tlv triple of describing associated task group, wherein, T is set of tasks all in associated task figure, Λ is the set of the execution order between task, C be communication overhead between task set (each task carry out before required data be known, communication overhead refers to volume of transmitted data between task and the ratio of grid bandwidth), when two tasks with direct correlation relation are assigned to while carrying out on same virtual machine, between task, do not need to carry out data transmission, therefore its communication overhead is 0, in the time that two tasks with direct correlation relation are assigned to different virtual machines and carry out, its communication overhead can be calculated by following formula:
Wherein data_transmission represents the volume of transmitted data between task, and BW refers to grid bandwidth.
(1.2) show that according to the execution order between task in set Λ the DAG of associated task group schemes.
In described step (2), associated task group is mainly to adopt the thought of DAG figure layering by level division, the extremely different task-set of task division of same layer will be in, the different task collection of same level is considered to dereferenced, can be dispatched in virtual machine and carry out simultaneously.The detailed process that task-set is divided is:
(2.1) according to the order from entrance task to export task by described DAG figure layering;
(2.2) task in described DAG figure is divided in the set of tasks of equivalent layer according to its corresponding level;
(2.3) the associated task group deadline of user being expected is as total time-constrain of associated task scheduling, and the ratio that accounts for general assignment number according to number of tasks in every layer of task-set calculates the time-constrain of every layer of set of tasks.
In described step (3), the structure of cluster virtual machine is mainly to form cluster virtual machine at many multiple virtual machines of physical server deploy.The integrated required operating system of finishing the work in virtual machine, application software and data, adopt hardware virtualization method can effectively improve physical resource utilization factor, and the concrete steps that cluster virtual machine builds are as follows:
(3.1) by virtual physical resource (memory source, Internet resources, storage resources, cpu resource) and build many virtual machines;
(3.2) in virtual machine, dispose user task and carry out the required data of needed operating system, application program and tasks carrying;
(3.3) virtual machine building is added in cluster virtual machine to the wait task execution that is scheduled.
Task scheduling in described step (4) is based under time constraint condition, be user to the free constraint of completing of one group of associated task, all tasks must ensure to be scheduled on suitable virtual machine as far as possible to be carried out and task can complete on time.The idiographic flow of task scheduling is:
(4.1) receive one deck task-set according to the associated task group of having divided task-set in described step (2) by level, the task in task-set is dispensed to idle virtual machines different in cluster virtual machine, go to step (4.2);
(4.2) judge whether the task in received task-set is all finished, and continues wait task be finished if do not complete, otherwise go to step (4.3);
(4.3) total deadline of the calculating all tasks in task-set that receive, judge whether to be less than the confinement time of this layer of task, if the actual deadline is less than confinement time, goes to step (4.1), otherwise go to step (4.4);
(4.4) task in lower one deck task-set is dispensed in the virtual machine identical with its predecessor task, goes to step (4.2).
In the process of task scheduling, the task of being in every one deck task-set can be dispatched to virtual machine simultaneously, each task is assigned to as far as possible different virtual machines and carries out, although to sacrifice the communication overhead of task as cost, can effectively avoid multiple tasks to be assigned to the effect that identical virtual machine causes task to wait for.If this layer of confinement time that is greater than task T.T. that task completes after the task of every one deck completes, under scheduling when one deck task, task in this layer of set of tasks is dispensed to the identical virtual machine of its direct precursor task, does like this and can effectively avoid because forerunner and subsequent tasks are because of the call duration time between being dispensed to different virtual machines and producing of task.The delay producing to make up front one deck task by this kind of method.
A cloud computing associated task dispatching device based under time constraint condition, comprising: task image construction unit, task layering unit, Virtual Machine Manager unit and task scheduling unit;
Wherein task image construction unit is used for receiving associated task group, and all tasks are set up to DAG figure according to the precedence of tasks carrying;
Task layering unit is connected with task image construction unit, comprise task-set division unit and time-constrain computing unit, described task-set division unit is divided into different task-set by task according to level for the DAG figure having built according to task construction unit, and described time-constrain computing unit is assigned to the time-constrain of associated task group the time-constrain of concrete each layer;
The implementation status of task on virtual machine, for managing virtual machines cluster, can be monitored in Virtual Machine Manager unit;
Task scheduling unit is connected with Virtual Machine Manager unit with task layering unit respectively, for the task-set of having divided by layer of task layering unit is dispensed to the suitable virtual machine of Virtual Machine Manager Single Component Management according to time-constrain situation.
Described task scheduling unit comprises task-set receiving element, task-set allocation units, task-set execution monitoring unit and task-set time calculating unit;
Described task-set receiving element receives the time-constrain of pending task-set and task-set from described task layering unit; The task in task-set is dispensed to virtual machine by described task-set allocation units, task-set is carried out monitoring unit monitor task implementation status, the time that the concentrated all tasks of task-set time calculating unit calculation task complete also compares with the confinement time of task-set, and task-set allocation units are determined the distribution condition of lower one deck task-set according to comparative result.
The present invention adopts technique scheme, there is following beneficial effect: the method that the present invention builds DAG figure by use represents the incidence relation between task in associated task group, adopt the thought of DAG figure layering simultaneously, dereferenced task division in same layer is entered to same set of tasks, set up cluster virtual machine so that the place of tasks carrying to be provided, in the process of task scheduling, adopt point layer scheduling method based on time-constrain, task scheduling in every one deck is carried out to most suitable virtual machine, efficiently solve prior art medium cloud compute associations task and in scheduling process, occur carrying out the problem postponing, the delay situation of maximized minimizing task occurs, in the time that guarantee task can be expected user, complete, and realize effective utilization of resources of virtual machine.
Brief description of the drawings
Fig. 1 is the overall framework figure of the inventive method embodiment;
Fig. 2 is the DAG figure of the associated task group in the inventive method embodiment;
Fig. 3 is the process flow diagram of the associated task component layers scheduling in the inventive method embodiment;
Fig. 4 is the structural representation of apparatus of the present invention embodiment.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is further elaborated.
The invention provides a kind of cloud computing associated task dispatching method embodiment based under time constraint condition, Fig. 1 is the overall framework figure of the present embodiment, for the one group of associated task group being formed by n cloud computing associated task, wherein each task has its forerunner or subsequent tasks, only have subsequent tasks in the time that predecessor task completes could start the execution that is scheduled, the associated task group deadline that user expects is D, and the key step of the embodiment of the present invention is as follows:
(A) associated task group enters DAG figure and builds module, and DAG figure builds module and builds DAG figure according to the execution order of task;
(B) the DAG figure having built enters associated task hierarchical block, and task division is entered in the set of tasks of different levels;
(C) cpu resource, memory source, Internet resources and the storage resources that extract in resource pool generate multiple virtual machines, composition cluster virtual machine;
(D) task scheduling modules will be dispensed to the virtual machine in cluster in the task of identical level according to certain scheduling strategy.
Wherein the concrete steps of step (A) are:
(A1) definition G={T, Λ, C} is the tlv triple of describing associated task group, wherein, T is set of tasks T={t all in associated task figure
1, t
2..., t
n, Λ is task (t
i, t
j) between the set of execution order, t
ifor t
jdirect precursor task, t
jfor t
iimmediate successor task, C={c
1, c
2..., c
lit is the set of communication overhead between task.Between task, communication overhead is larger, longer for transmitting time of data between task.When two tasks with direct correlation relation are assigned to while carrying out on same virtual machine, its communication overhead is 0, can effectively reduce the time of predecessor task to subsequent tasks transmission data simultaneously.
(A2) show that according to the execution order between task in set Λ the DAG of associated task group schemes.
As shown in Figure 2, shown intuitively the DAG figure with 10 associated tasks, this group associated task is t
1-t
10, the incidence relation between task represents with arrow, the communication overhead between the numeral task on arrow.Task t
1for the Ingress node of associated task figure, task t
10for the Egress node of associated task, task t
2, t
3, t
4direct precursor task be t
1, subsequent tasks is respectively t
5, t
6, t
7, each task has forerunner or the subsequent tasks of oneself by that analogy.
The concrete steps of above-mentioned steps (B) are:
(B1) according to the order from entrance task to export task, described DAG figure is divided into k layer.
(B2) task in described DAG figure is divided in the set of tasks of equivalent layer according to its corresponding level, as shown in Figure 2, DAG figure has t
1-t
1010 associated tasks, according to from t
1to t
10the order of traversal task image, can be divided into associated task figure 5 layers: ground floor is t
1; The second layer is t
2, t
3, t
4; The 3rd layer is t
5, t
6, t
7; The 4th layer is t
8, t
9; Layer 5 is t
10.For the task-set that is in same layer, owing to there is no direct execution order relevance between task, so in the time that predecessor task completes, the task of same level can be dispatched simultaneously.For example task t
2, t
3, t
4only need its predecessor task t
1while completing, can be dispatched simultaneously.
(B3) total time-constrain that associated task group deadline D user being expected dispatches as associated task, according to
formula calculates the time-constrain of every layer of set of tasks.
Wherein, D
ibe the confinement time of i layer set of tasks, m
ibe the number of tasks in i layer set of tasks, and have
Describe the task scheduling flow process in above-mentioned steps (D) in detail below in conjunction with Fig. 3, comprise the steps:
S401: receive one deck task-set S from having divided the associated task group of task-set
i, its time is constrained to D
i, the level of the task-set that wherein i is current reception, i=1 while scheduling for the first time;
S402: by task-set S
iin task be dispensed to successively in idle virtual machines different in cluster virtual machine and carry out;
S403: judge task-set S
iin task whether be all finished, continue wait task if do not complete and be finished, otherwise go to S404;
S404: judge in task groups whether have the pending task-set of lower one deck, if do not exist task groups to be all finished, otherwise go to S405;
S405: calculation task collection S
iin total deadline T of all tasks
i.
S406: judge T
i<D
iwhether set up, take off one deck task-set if set up and go to step S402, go to step S407 otherwise take off one deck task-set;
S407: by task-set S
iin task be dispensed in the virtual machine identical with its direct precursor task and carry out, go to step 403;
The present invention also provides a kind of cloud computing associated task dispatching device embodiment based under time constraint condition, as shown in Figure 4, comprises task image construction unit 101, task layering unit 102, Virtual Machine Manager unit 103 and task scheduling unit 104;
Task image construction unit 101 is for receiving associated task group, and all tasks are set up to DAG figure according to the precedence of tasks carrying;
Task layering unit 102 is connected with task image construction unit 101, comprise task-set division unit 1021 and time-constrain computing unit 1022, task-set division unit 1021 is divided into different task-set by task according to level for the DAG figure having built according to task construction unit 101, and time-constrain computing unit 1022 calculates the time-constrain of associated task group the time-constrain of each layer according to the accounting situation of each layer of specific tasks number;
The implementation status of task on virtual machine, for managing virtual machines cluster, can be monitored in Virtual Machine Manager unit 103;
Task scheduling unit 104 is connected with Virtual Machine Manager unit 103 with task layering unit 102, comprises task-set receiving element 1041, task-set allocation units 1042, task-set execution monitoring unit 1043 and task-set time calculating unit 1044;
Task-set receiving element 1041 receives the time-constrain of one deck task-set and this layer of task-set successively from task layering unit 102, task-set allocation units 1042 are dispensed to virtual machine according to allocation rule by the task in task-set, task-set is carried out monitoring unit 1043 monitor task implementation status, task-set time calculating unit 1044 calculates the time that in a task-set, all tasks complete and compares with confinement time, task-set allocation units 1042 are determined the distribution condition of lower one deck task-set according to comparative result, if the time completing actual is less than confinement time, descend the task in one deck task-set to be dispensed to successively different idle virtual machines, otherwise the virtual machine that the task in lower one deck task-set is dispensed to its direct precursor task place is carried out.
The present invention is illustrated according to the preferred embodiment, should be appreciated that but above-described embodiment does not limit the present invention in any form, and all employings are equal to replaces or technical scheme that the form of equivalent transformation obtains, all drops in protection scope of the present invention.
Claims (8)
1. the cloud computing associated task dispatching method based under time constraint condition, is characterized in that, comprises the following steps:
(1) all tasks in associated task group are set up to DAG figure according to the precedence of its execution;
(2) according to the DAG figure having built in step (1), all tasks being divided into different task-set by level, is every layer of task-set limiting time constraint;
(3) hardware resource is virtual, build cluster virtual machine;
(4) according to the time-constrain situation of every layer of task-set by task scheduling to suitable virtual machine in cluster virtual machine.
2. the cloud computing associated task dispatching method based under time constraint condition according to claim 1, is characterized in that, the concrete steps of described step (1) are:
(1.1) definition G={T, Λ, C} is the tlv triple of describing associated task group, and wherein, T is set of tasks all in associated task group, and Λ is the set of the execution order between task, and C is the set of communication overhead between task;
(1.2) show that according to the execution order between task in set Λ the DAG of associated task group schemes.
3. the cloud computing associated task dispatching method based under time constraint condition according to claim 1, is characterized in that, the concrete steps of described step (2) are:
(2.1) according to the order from entrance task to export task by described DAG figure layering;
(2.2) task in described DAG figure is divided in the set of tasks of equivalent layer according to its corresponding level;
(2.3) the associated task group deadline of user being expected, as total time-constrain of associated task scheduling, calculates the time-constrain of every layer of set of tasks according to formula.
4. the cloud computing associated task dispatching method based under time constraint condition according to claim 3, is characterized in that,
The formula that calculates the time-constrain of every layer of set of tasks in described step (2.3) is
Wherein, D is the confinement time that associated task group completes, D
ibe the confinement time of i layer set of tasks, n is the total task number in associated task group, m
ibe the number of tasks in i layer set of tasks, meet
k is total number of plies of described DAG figure.
5. the cloud computing associated task dispatching method based under time constraint condition according to claim 1, is characterized in that, the concrete steps of described step (3) are:
(3.1) by physical resource, comprise cpu resource, Internet resources, memory source and storage resources, virtual and build many virtual machines;
(3.2) in virtual machine, dispose user task and carry out the required data of needed operating system, application program and tasks carrying;
(3.3) virtual machine building is added in cluster virtual machine to the wait task execution that is scheduled.
6. the cloud computing associated task dispatching method based under time constraint condition according to claim 1, is characterized in that, the flow process of the task scheduling in described step (4) is:
(4.1) receive one deck task-set according to the associated task group of having divided task-set in described step (2) by level, the task in task-set is dispensed to idle virtual machines different in cluster virtual machine, go to step (4.2);
(4.2) judge whether the task in received task-set is all finished, and continues wait task be finished if do not complete, otherwise go to step (4.3);
(4.3) total deadline of the calculating all tasks in task-set that receive, judge whether to be less than the confinement time of this layer of task, if actual total deadline is less than confinement time, goes to step (4.1), otherwise go to step (4.4);
(4.4) task in lower one deck task-set is dispensed in the virtual machine identical with its predecessor task, goes to step (4.2).
7. the cloud computing associated task dispatching device based under time constraint condition, it is characterized in that, comprise task image construction unit (101), task layering unit (102), Virtual Machine Manager unit (103) and task scheduling unit (104);
Described task image construction unit (101) is for receiving associated task group, and all tasks are set up to DAG figure according to the precedence of tasks carrying;
Described task layering unit (102) is connected with task image construction unit (101), comprise task-set division unit (1021) and time-constrain computing unit (1022), described task-set division unit (1021) is divided into different task-set by task according to level for the DAG figure having built according to described task construction unit (101), and described time-constrain computing unit (1022) is assigned to the time-constrain of associated task group the time-constrain of concrete each layer;
The implementation status of task on virtual machine, for managing virtual machines cluster, can be monitored in described Virtual Machine Manager unit (103);
Described task scheduling unit (104) is connected with Virtual Machine Manager unit (103) with task layering unit (102) respectively, for the task-set of having divided by layer of task layering unit (102) is dispensed to the suitable virtual machine of Virtual Machine Manager unit (103) management according to time-constrain situation.
8. the cloud computing associated task dispatching device based under time constraint condition according to claim 7, is characterized in that,
Described task scheduling unit (104) comprises task-set receiving element (1041), task-set allocation units (1042), task-set execution monitoring unit (1043) and task-set time calculating unit (1044);
Described task-set receiving element (1041) receives the time-constrain of pending task-set and task-set from described task layering unit (102);
Described task-set allocation units (1042) are dispensed to the task in task-set in virtual machine and carry out, described task-set is carried out monitoring unit (1043) monitor task implementation status, described task-set time calculating unit (1044) calculation task concentrates all tasks complete the time of expense and compare with the confinement time of task-set, and described task-set allocation units (1042) are determined the distribution condition of lower one deck task-set according to comparative result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410245649.XA CN104021040B (en) | 2014-06-04 | 2014-06-04 | Based on the cloud computing associated task dispatching method and device under time constraint condition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410245649.XA CN104021040B (en) | 2014-06-04 | 2014-06-04 | Based on the cloud computing associated task dispatching method and device under time constraint condition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104021040A true CN104021040A (en) | 2014-09-03 |
| CN104021040B CN104021040B (en) | 2017-09-26 |
Family
ID=51437808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410245649.XA Active CN104021040B (en) | 2014-06-04 | 2014-06-04 | Based on the cloud computing associated task dispatching method and device under time constraint condition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104021040B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104536804A (en) * | 2014-12-23 | 2015-04-22 | 西安电子科技大学 | Virtual resource dispatching system for related task requests and dispatching and distributing method for related task requests |
| CN106095584A (en) * | 2016-06-20 | 2016-11-09 | 中国人民解放军国防科学技术大学 | The dispatching method of the security sensitive work stream that task based access control replicates in cloud computing |
| CN106919449A (en) * | 2017-03-21 | 2017-07-04 | 联想(北京)有限公司 | The dispatch control method and electronic equipment of a kind of calculating task |
| CN107291536A (en) * | 2017-05-23 | 2017-10-24 | 南京邮电大学 | Application task stream scheduling method under a kind of cloud computing environment |
| CN107656730A (en) * | 2017-09-28 | 2018-02-02 | 链家网（北京）科技有限公司 | The adaptive visualization method and device of distributed software system topological structure |
| CN108028804A (en) * | 2015-07-10 | 2018-05-11 | 国际商业机器公司 | The management of virtual machine in virtual computation environmental based on structure limitation |
| CN104820616B (en) * | 2015-04-24 | 2018-10-30 | 中国联合网络通信集团有限公司 | A kind of method and device of task scheduling |
| CN108737462A (en) * | 2017-04-17 | 2018-11-02 | 华东师范大学 | A kind of cloud computation data center method for scheduling task based on graph theory |
| CN108958919A (en) * | 2018-07-13 | 2018-12-07 | 湘潭大学 | More DAG task schedule expense fairness assessment models of limited constraint in a kind of cloud computing |
| CN109074284A (en) * | 2016-04-01 | 2018-12-21 | 阿尔卡特朗讯 | For increasing and decreasing the method and system and computer program product of resource in proportion |
| CN109753337A (en) * | 2017-11-02 | 2019-05-14 | 阿里巴巴集团控股有限公司 | A kind of mirror image construction method, device and server |
| CN110018817A (en) * | 2018-01-05 | 2019-07-16 | 中兴通讯股份有限公司 | The distributed operation method and device of data, storage medium and processor |
| CN110968412A (en) * | 2019-12-13 | 2020-04-07 | 武汉慧联无限科技有限公司 | Task execution method, system and storage medium |
| CN111082971A (en) * | 2019-11-25 | 2020-04-28 | 南京航空航天大学 | Shared resource allocation method for cloud load test |
| CN111371856A (en) * | 2020-02-25 | 2020-07-03 | 程瑞萍 | Cloud computing task scheduling method and device, cloud computing system and server |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103605567A (en) * | 2013-10-29 | 2014-02-26 | 河海大学 | Cloud computing task scheduling method facing real-time demand change |
-
2014
- 2014-06-04 CN CN201410245649.XA patent/CN104021040B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103605567A (en) * | 2013-10-29 | 2014-02-26 | 河海大学 | Cloud computing task scheduling method facing real-time demand change |
Non-Patent Citations (1)
| Title |
|---|
| 谭文安，路广振，孙勇: "基于并行分层的工作流调度优化算法", 《计算机集成制造系统》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104536804A (en) * | 2014-12-23 | 2015-04-22 | 西安电子科技大学 | Virtual resource dispatching system for related task requests and dispatching and distributing method for related task requests |
| CN104820616B (en) * | 2015-04-24 | 2018-10-30 | 中国联合网络通信集团有限公司 | A kind of method and device of task scheduling |
| CN108028804A (en) * | 2015-07-10 | 2018-05-11 | 国际商业机器公司 | The management of virtual machine in virtual computation environmental based on structure limitation |
| CN109074284A (en) * | 2016-04-01 | 2018-12-21 | 阿尔卡特朗讯 | For increasing and decreasing the method and system and computer program product of resource in proportion |
| CN106095584A (en) * | 2016-06-20 | 2016-11-09 | 中国人民解放军国防科学技术大学 | The dispatching method of the security sensitive work stream that task based access control replicates in cloud computing |
| CN106919449A (en) * | 2017-03-21 | 2017-07-04 | 联想(北京)有限公司 | The dispatch control method and electronic equipment of a kind of calculating task |
| CN106919449B (en) * | 2017-03-21 | 2020-11-20 | 联想(北京)有限公司 | Scheduling control method of computing task and electronic equipment |
| CN108737462A (en) * | 2017-04-17 | 2018-11-02 | 华东师范大学 | A kind of cloud computation data center method for scheduling task based on graph theory |
| CN107291536B (en) * | 2017-05-23 | 2020-06-30 | 南京邮电大学 | Application task flow scheduling method in cloud computing environment |
| CN107291536A (en) * | 2017-05-23 | 2017-10-24 | 南京邮电大学 | Application task stream scheduling method under a kind of cloud computing environment |
| CN107656730A (en) * | 2017-09-28 | 2018-02-02 | 链家网（北京）科技有限公司 | The adaptive visualization method and device of distributed software system topological structure |
| CN107656730B (en) * | 2017-09-28 | 2020-10-16 | 贝壳找房(北京)科技有限公司 | Self-adaptive visualization method and device for topological structure of distributed software system |
| CN109753337A (en) * | 2017-11-02 | 2019-05-14 | 阿里巴巴集团控股有限公司 | A kind of mirror image construction method, device and server |
| CN109753337B (en) * | 2017-11-02 | 2023-03-28 | 阿里巴巴集团控股有限公司 | Mirror image construction method and device and server |
| CN110018817A (en) * | 2018-01-05 | 2019-07-16 | 中兴通讯股份有限公司 | The distributed operation method and device of data, storage medium and processor |
| CN108958919A (en) * | 2018-07-13 | 2018-12-07 | 湘潭大学 | More DAG task schedule expense fairness assessment models of limited constraint in a kind of cloud computing |
| CN111082971A (en) * | 2019-11-25 | 2020-04-28 | 南京航空航天大学 | Shared resource allocation method for cloud load test |
| CN111082971B (en) * | 2019-11-25 | 2021-07-20 | 南京航空航天大学 | Shared resource allocation method for cloud load test |
| CN110968412A (en) * | 2019-12-13 | 2020-04-07 | 武汉慧联无限科技有限公司 | Task execution method, system and storage medium |
| CN111371856A (en) * | 2020-02-25 | 2020-07-03 | 程瑞萍 | Cloud computing task scheduling method and device, cloud computing system and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104021040B (en) | 2017-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104021040A (en) | Cloud computing associated task scheduling method and device based on time constraint | |
| CN103605567B (en) | Cloud computing task scheduling method facing real-time demand change | |
| Xie et al. | The only constant is change: Incorporating time-varying network reservations in data centers | |
| CN105912401B (en) | A kind of distributed data batch processing system and method | |
| CN102063336B (en) | Distributed computing multiple application function asynchronous concurrent scheduling method | |
| CN102521055B (en) | Virtual machine resource allocating method and virtual machine resource allocating system | |
| US11206193B2 (en) | Method and system for provisioning resources in cloud computing | |
| WO2015096656A1 (en) | Thread creation method, service request processing method and related device | |
| CN107025139A (en) | A kind of high-performance calculation Scheduling Framework based on cloud computing | |
| Liu et al. | Resource preprocessing and optimal task scheduling in cloud computing environments | |
| CN103942098A (en) | System and method for task processing | |
| CN103870314A (en) | Method and system for simultaneously operating different types of virtual machines by single node | |
| Lai et al. | Sol: Fast distributed computation over slow networks | |
| CN104598426A (en) | task scheduling method applied to a heterogeneous multi-core processor system | |
| CN102223419A (en) | Virtual resource dynamic feedback balanced allocation mechanism for network operation system | |
| Liu et al. | A survey on virtual machine scheduling in cloud computing | |
| CN109783225B (en) | Tenant priority management method and system of multi-tenant big data platform | |
| CN105893158A (en) | Big data hybrid scheduling model on private cloud condition | |
| CN104407912A (en) | Virtual machine configuration method and device | |
| CN102495759A (en) | Method for scheduling job in cloud computing environment | |
| CN107168770A (en) | A kind of cloud data center workflow schedule of low energy consumption and resource provision method | |
| CN103944997A (en) | Load balancing method with combination of random sampling and virtualization technology | |
| CN103399626A (en) | Power consumption sensing scheduling system and power consumption sensing scheduling method for parallel application for hybrid computation environments | |
| CN102708003A (en) | Method for allocating resources under cloud platform | |
| CN102637138A (en) | Method for computing and scheduling virtual machine |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20140903 Assignee: HUANENG LANCANG RIVER HYDROPOWER Inc. Assignor: HOHAI University Contract record no.: 2019320000021 Denomination of invention: Cloud computing associated task scheduling method and device based on time constraint Granted publication date: 20170926 License type: Common License Record date: 20190228 |