System and method of providing a fixed time offset based dedicated co-allocation of a common resource set
View Patent ↗Disclosed are a system, method and computer-readable medium relating to managing resources within a compute environment having a group of nodes or computing devices. The method comprises, for each node in the compute environment: traversing a list jobs having a fixed time relationship, wherein for each job in the list, the following steps occur: obtaining a range list of available timeframes for each job, converting each availability timeframe to a start range, shifting the resulting start range in time by a job offset, for a first job, copying the resulting start range into a node range, and for all subsequent jobs, logically AND'ing the start range with the node range. Next, the method comprises logically OR'ing the node range with a global range, generating a list of acceptable resources on which to start and the timeframe at which to start and creating reservations according to the list of acceptable resources for the resources in the group of computing devices and associated job offsets.
1. A method comprising:
obtaining a range list of available timeframes for each job in a list of jobs to consume compute resources in a compute environment;
converting each availability timeframe in the range list of available timeframes to a first start range;
determining a second start range based on a node range that indicates available compute resources associated with a node in the compute environment;
logically AND'ing the second start range with the node range to yield a second node range;
logically OR'ing the second node range with a global node range to yield a third node range, wherein the global node range reflects timeframes and resources available to all jobs that can simultaneously consume resources on a same set of allocated resources;
generating a list of compute resources based on the third node range on which to start jobs from the list of jobs to consume compute resources and a timeframe at which to start the jobs; and
establishing a reservation in the compute environment according to the list of compute resources.
2. The method of claim 1 , wherein the list of jobs has a fixed time relationship between at least two jobs in the list of jobs, wherein at least one of the steps of claim 1 are performed for each job in the list of jobs.
3. The method of claim 1 , further comprising shifting the first start range in time by a job offset to yield a shifted first start range.
4. The method of claim 3 , wherein establishing the reservation is based on the job offset.
5. The method of claim 1 , wherein parameters associated with the each job which are used to identify a history of available timeframes comprise at least one of duration, resource requirements, allocated resources and actions.
6. The method of claim 2 , wherein the fixed time relationship between each of the at least two jobs is established by specifying and enforcing an offset-based relationship between the at least two jobs.
7. The method of claim 2 , further comprising determining whether a job of the least two jobs has a highest priority, and if yes, providing first access to all currently available resources to the job with the highest priority.
8. The method of claim 2 , wherein the fixed time relationship between each of the at least two jobs results in at least one of job overlap, job juxtaposition and an offset-based relationship between jobs.
9. A non-transitory computer-readable medium storing instructions which, when executed by a processor, cause the processor to perform operations comprising:
obtaining a range list of available timeframes for each job in a list of jobs to consume compute resources in a compute environment;
converting each availability timeframe in the range list of available timeframes to a first start range;
determining a second start range based on a node range that indicates available compute resources associated with a node in the compute environment;
logically AND'ing the second start range with the node range to yield a second node range;
logically OR'ing the second node range with a global node range to yield a third node range, wherein the global node range reflects timeframes and resources available to all jobs that can simultaneously consume resources on a same set of allocated resources;
generating a list of compute resources based on the third node range on which to start jobs from the list of jobs to consume compute resources and a timeframe at which to start the jobs; and
establishing a reservation in the compute environment according to the list of compute resources.
10. The non-transitory computer-readable medium of claim 9 , wherein the list of jobs has a fixed time relationship between at least two jobs in the list of jobs, wherein at least one of the steps of claim 1 are performed for each job in the list of jobs.
11. The non-transitory computer-readable medium of claim 9 , wherein the computer-readable medium stores instructions which cause the operations to further comprise shifting the first start range in time by a job offset to yield a shifted first start range.
12. The non-transitory computer-readable medium of claim 9 , wherein the computer-readable medium stores instructions which cause the operations to further comprise establishing the reservation based on the job offset.
13. The non-transitory computer-readable medium of claim 9 , wherein parameters associated with the each job which are used to identify a history of available timeframes comprise at least one of duration, resource requirements, allocated resources and actions.
14. The non-transitory computer-readable medium of claim 9 , wherein the fixed time relationship between each of the at least two jobs is established by specifying and enforcing an offset-based relationship between the at least two jobs.
15. The non-transitory computer-readable medium of claim 9 , wherein the computer-readable medium stores instructions which cause the operations to further comprise determining whether a job of the least two jobs has a highest priority, and if yes, providing first access to all currently available resources to the job with the highest priority.
16. The non-transitory computer-readable medium of claim 9 , wherein the fixed time relationship between each of the at least two jobs results in at least one of job overlap, job juxtaposition and an offset-based relationship between jobs.
17. A system comprising:
a processor; and
a computer-readable storage medium storing instructions, which, when executed by the processor, cause the processor to perform operations comprising:
obtaining a range list of available timeframes for each job in a list of jobs to consume compute resources in a compute environment;
converting each availability timeframe in the range list of available timeframes to a first start range;
determining a second start range based on a node range that indicates available compute resources associated with a node in the compute environment;
logically AND'ing the second start range with the node range to yield a second node range;
logically OR'ing the second node range with a global node range to yield a third node range, wherein the global node range reflects timeframes and resources available to all jobs that can simultaneously consume resources on a same set of allocated resources;
generating a list of compute resources based on the third node range on which to start jobs from the list of jobs to consume compute resources and a timeframe at which to start the jobs; and
establishing a reservation in the compute environment according to the list of compute resources.
18. The system of claim 17 , wherein the list of jobs has a fixed time relationship between at least two jobs in the list of jobs, wherein at least one of the steps of claim 1 are performed for each job in the list of jobs.
19. The system of claim 18 , when the computer-readable medium stores further instructions which cause the processor to perform further operations comprising shifting the first start range in time by a job offset to yield a shifted first start range.
20. The system of claim 17 , wherein establishing the reservation is based on the job offset.