Optimized job scheduling and execution in a distributed computing grid

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.

What is claimed is: 
     
         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.