Module assignment management

Patent metadata

Field	Value
Publication number	US-10409641-B1
Application number	US-201916250829-A
Country	US
Kind code	B1
Filing date	Jan 17, 2019
Priority date	Nov 26, 2018
Publication date	Sep 10, 2019
Grant date	Sep 10, 2019

Abstract

Systems, methods, and non-transitory computer readable media are provided for managing assignment of modules. A job from a client may be received. The job may be inserted into a job queue. The job within the job queue may be compared with a set of cooldown modules to determine whether a compatible cooldown module is available. The job may be assigned to the compatible cooldown module responsive to the compatible cooldown module being available.

First claim

The invention claimed is:

1. A system comprising:
one or more processors; and
memory storing instructions that, when executed by the one or more processors, cause the system to perform:
receiving a job from a client;
inserting the job into a job queue;
comparing the job within the job queue with a set of modules to determine whether a compatible module is available;
assigning the job to the compatible module; and
when the compatible module is determined not to be available:
initiating creation of a new module for the job;
determining whether the compatible module becomes available during the creation of the new module;
when the compatible module does not become available during the creation of the new module, assigning the job to the new module; and
when the compatible module becomes available during the creation of the new module, assigning the job to the compatible module.

2. The system of claim 1 , wherein one or more modules of the set of modules are limited to assignment of a single job.

3. The system of claim 2 , wherein the limitation of assignment of the single job to the one or more modules provides job isolation for the one or more modules.

4. The system of claim 1 , wherein the system further determines whether a module of the set of modules is compatible based on a coding language of the job and the module.

5. The system of claim 1 , wherein the set of modules includes one or more modules that have completed one or more assigned jobs.

6. The system of claim 5 , wherein responsive to none of the one or more modules within the set of modules being compatible with the job, the one or more modules are terminated.

7. The system of claim 1 , wherein the instructions, when executed by the one or more processors, further cause the system to perform:
processing a new module for the job; and
assigning the job to the new module responsive to the new module being ready and the compatible module not being available.

8. The system of claim 7 , wherein responsive to the compatible module being available, processing of the new module for the job is terminated.

9. A method implemented by a computing system including one or more processors and storage media storing machine-readable instructions, wherein the method is performed using the one or more processors, the method comprising:
receiving a job from a client;
inserting the job into a job queue;
comparing the job within the job queue with a set of modules to determine whether a compatible module is available;
assigning the job to the compatible module; and
when the compatible module is determined not to be available:
initiating creation of a new module for the job;
determining whether the compatible module becomes available during the creation of the new module;
when the compatible module does not become available during the creation of the new module, assigning the job to the new module; and
when the compatible module becomes available during the creation of the new module, assigning the job to the compatible module.

10. The method of claim 9 , wherein one or more modules of the set of modules are limited to assignment of a single job.

11. The method of claim 10 , wherein the limitation of assignment of the single job to the one or more modules provides job isolation for the one or more modules.

12. The method of claim 9 , further comprising determining whether the job and a module of the set of modules is compatible based on a coding language of the job and the compatible cooldown module.

13. The method of claim 9 , wherein the set of modules includes one or more modules that have completed one or more assigned jobs.

14. The method of claim 13 , wherein responsive to none of the one or more modules within the set of modules being compatible with the job, the one or more modules are terminated.

15. The method of claim 9 , further comprising:
processing a new module for the job; and
assigning the job to the new module responsive to the new module being ready and the compatible module not being available.

16. The method of claim 15 , wherein responsive to the compatible module being available, processing of the new module for the job is terminated.

17. A non-transitory computer readable medium comprising instructions that, when executed, cause one or more processors to perform:
receiving a job from a client;
inserting the job into a job queue;
comparing the job within the job queue with a set of modules to determine whether a compatible module is available;
assigning the job to the compatible module; and
when the compatible module is determined not to be available:
initiating creation of a new module for the job;
determining whether the compatible module becomes available during the creation of the new module;
when the compatible module does not become available during the creation of the new module, assigning the job to the new module; and
when the compatible module becomes available during the creation of the new module, assigning the job to the compatible module.

18. The non-transitory computer readable medium of claim 17 , wherein the set of modules includes one or more modules that have completed one or more assigned jobs and responsive to none of the one or more modules within the set of modules being compatible with the job, the one or more modules are terminated.

19. The non-transitory computer readable medium of claim 17 , wherein the instructions, when executed, further cause the one or more processors to perform:
processing a new module for the job; and
assigning the job to the new module responsive to the new module being ready and the compatible module not being available.

20. The non-transitory computer readable medium of claim 19 , wherein responsive to the compatible module being available, processing of the new module for the job is terminated.

Assignees

• Palantir Technologies Inc

Inventors

• Blessing Alexander
• Uang Justin
• Manning Lawrence
• Elliot Mark
• Kruszewski Robert

Classifications

• G06F2209/503

  Resource availability · CPC title

• G06F9/5044

  considering hardware capabilities · CPC title

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• G06F9/5061 Primary

  Partitioning or combining of resources · CPC title