Joint network and task scheduling
First Claim
1. A method for scheduling tasks in a distributed computing network, comprising the steps of:
- collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks;
predicting a performance of each of the candidate resources in performing the given task based on both i) network state and ii) a scheduling policy of the distributed computing network; and
selecting a best candidate resource for the given task based on the performance,wherein the performance is predicted based on a flow completion time (FCT), and wherein for a current flow of size s and link bandwidth of B, FCT(s)=(total #bytes transmitted upon completing s)/B.
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques for network state-aware and network scheduling policy-aware task scheduling are provided. In one aspect, a method for scheduling tasks in a distributed computing network includes the steps of: collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predicting a performance of each of the candidate resources in performing the given task based on both i) a state and ii) a scheduling policy of the distributed computing network; and selecting a best candidate resource for the given task based on the performance. A system for scheduling tasks in a distributed computing network is also provided which includes a task scheduler; and a network scheduler, wherein the task scheduler is configured to schedule the tasks in the distributed computing network based on both i) the state and ii) the scheduling policy of the distributed computing network.
-
Citations
17 Claims
-
1. A method for scheduling tasks in a distributed computing network, comprising the steps of:
-
collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predicting a performance of each of the candidate resources in performing the given task based on both i) network state and ii) a scheduling policy of the distributed computing network; and selecting a best candidate resource for the given task based on the performance, wherein the performance is predicted based on a flow completion time (FCT), and wherein for a current flow of size s and link bandwidth of B, FCT(s)=(total #bytes transmitted upon completing s)/B. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 16)
-
-
11. A system for scheduling tasks in a distributed computing network, the system comprising a memory coupled with a processor device, the memory embodying instructions that, when executed by the processor device, cause the processor device to implement:
-
a task scheduler; and a network scheduler, wherein the network scheduler is configured to provide a network state and a scheduling policy of the distributed computing network to the task scheduler, and wherein the task scheduler is configured to schedule the tasks in the distributed computing network based on both i) the network state and ii) the scheduling policy of the distributed computing network, wherein the task scheduler is further configured to;
collect a pool of candidate resources in the distributed computing network for performing a given one of the tasks;
predict a performance of each of the candidate resources in performing the given task based on both i) the network state and ii) the scheduling policy of the distributed computing network; and
select a best candidate resource for the given task based on the performance, wherein the performance is predicted based on a FCT, and wherein for a current flow of size s and link bandwidth of B, FCT(s)=(total #bytes transmitted upon completing s)/B. - View Dependent Claims (12, 13, 14, 15)
-
-
17. A computer program product for scheduling tasks in a distributed computing network, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to:
-
collect a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predict a performance of each of the candidate resources in performing the given task based on both i) network state and ii) a scheduling policy of the distributed computing network; and select a best candidate resource for the given task based on the performance, wherein the performance is predicted based on a FCT, and wherein for a current flow of size s and link bandwidth of B, FCT(s)=(total #bytes transmitted upon completing s)/B.
-
Specification