Optimized job scheduling and execution in a distributed computing grid
First Claim
1. A method, comprising:
- determining, by a system including a processor, valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having a capability and capacity to complete a computer-executable job;
determining, by the system, from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links;
selecting, by the system, one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and
scheduling, by the system, the computer-executable job to be executed by the one of the first combinations of nodes and links.
3 Assignments
0 Petitions
Accused Products
Abstract
Disclosed example methods for scheduling a computer-executable job include determining valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having capability and capacity to complete the computer-executable job; determining, from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links; selecting one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and scheduling the computer-executable job to be executed by the one of the first combinations of nodes and links.
-
Citations
19 Claims
-
1. A method, comprising:
-
determining, by a system including a processor, valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having a capability and capacity to complete a computer-executable job; determining, by the system, from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links; selecting, by the system, one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and scheduling, by the system, the computer-executable job to be executed by the one of the first combinations of nodes and links. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A machine readable storage device comprising instructions that, when executed by a machine, cause the machine to perform operations, the operations comprising:
-
determining valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having a capability and capacity to complete a computer-executable job; determining from the valid combinations of nodes and links, first combinations of nodes and links based on a total cost associated with execution of the computer-executable job on corresponding ones of the valid combinations of nodes and links, the first combinations of nodes and links having total costs that match to within a threshold amount; selecting one of the first combinations of nodes and links based on a load balancing status between the first combinations of nodes and links; and scheduling the computer-executable job to be executed by the one of the first combinations of nodes and links. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. An apparatus, comprising:
-
at least one processor; and a memory that includes executable instructions that, when executed by the at least one processor, cause the at least one processor to perform operations, the operations including; determining valid combinations of nodes and links from a network of nodes interconnected by links, the valid combinations of nodes and links having a capability and capacity to complete a computer-executable job; determining from the valid combinations of nodes and links, a first combination of nodes and links and a second combination of nodes and links, the first and second combinations having a same total cost, the total cost based on the execution of the computer-executable job on corresponding ones of the first and second combinations of nodes and links; selecting the first combination of nodes and links or the second combination of nodes and links based on a load balancing status between the first and second combinations of nodes and links; and scheduling the computer-executable job to be executed by the selected one of the first combination of nodes and links or the second combination of nodes and links. - View Dependent Claims (14, 15, 16, 17, 18, 19)
-
Specification