Patent ID: 7844968
Filing Date: 2010-11-30
Classification: G06F

Abstract:
1. A computer-implemented method for scheduling a plurality of computing jobs on a computer system comprising: calculating, using a processor, a static urgency for a first computing job requiring a plurality of resources to execute, wherein the static urgency depends on a scarcity of a first resource of the plurality of resources; obtaining an initial priority for the first computing job; calculating, using the processor, a static priority for the first computing job by adding the initial priority and the static urgency; selecting, using the processor, the first computing job from the plurality of computing jobs, wherein the static priority of the first computing job exceeds a static priority of a second computing job of the plurality of computing jobs; identifying, using the processor, a first computing node having the first resource and a second computing node having the first resource; predicting, using the processor, a first earliest predicted completion time for the first computing job on the first computing node, by: predicting, using the processor, a second earliest predicted completion time for the first computing job on the second computing node; and scheduling, using the processor, execution of the first computing job on the first computing node, wherein the first earliest predicted completion time is earlier than the second earliest predicted completion time.