IP Library Granted Patent US 12,436,809
Granted Patent B2
US 12,436,809 · App. 17/545,149 · Granted Oct 7, 2025

Cloud bursting technologies

Inventor: Arthur L. Allen (Naples, FL)
Assignee: Adaptive Computing Enterprises, Inc.
G06F9/5038G06F9/45558G06F9/505G06F9/5077H04L41/5009G06F2009/45562
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,436,809
App. No.
17/545,149
Filed
Dec 8, 2021
Granted
Oct 7, 2025
Kind
B2
Art Unit
2446
USPC
709/219
Abstract

Technologies are provided for a multi-cloud bursting service. An example method can include receiving, via a cloud bursting service associated with different clouds, a cloud bursting configuration enabling the cloud bursting service for a local compute environment; based on the cloud bursting configuration, determining a number of jobs in a jobs queue associated with one or more cloud environments from the different clouds; determining a number of nodes available to process the number of jobs in the jobs queue; based on the number of jobs in the jobs queue and number of nodes available, determining whether to spin up a new node, take offline an existing node, or shutdown the existing node to yield a determination; and based on the determination and cloud bursting configuration, performing a cloud bursting action including spinning up the new node, taking offline the existing node, or shutting down the existing node.

Claims (36)

1. A method comprising:

evaluating, via a bursting service, a plurality of jobs received from a plurality of users, the plurality of jobs being in a job queue to yield an evaluation, wherein the evaluation determines whether there are enough active nodes in a combination of nodes in the current cluster and first nodes in an on-demand cluster to process the plurality of jobs in the job queue;

determining, via the bursting service and based on the evaluation, a bursting mode from a plurality of bursting modes;

bursting from the current cluster into the on-demand cluster based on the bursting mode determined via the bursting service to yield a new cluster comprising second nodes from the on-demand cluster in addition to the nodes in the current cluster and first nodes of the on-demand cluster; and

processing the plurality of jobs via at least one of the current cluster and the new cluster.

2. The method of claim 1 , wherein the evaluation covers all jobs within the job queue that have requirements to finish by a certain time in the job queue.

3. The method of claim 1 , wherein the plurality of bursting modes comprises at least one of a minimum burst mode, a maximum burst mode and a burst all mode.

4. The method of claim 3 , wherein in the minimum burst mode, the method comprises spinning up a minimum number of nodes required to complete all the plurality of jobs.

5. The method of claim 3 , wherein in the maximum burst mode, the method comprises spinning up enough nodes required to complete all the plurality of jobs immediately.

6. The method of claim 3 , wherein in the burst all mode, the method comprises spinning up all available nodes at one time.

7. The method of claim 6 , further comprising, for the burst all mode, shutting down all nodes upon completing all jobs.

8. The method of claim 1 , wherein bursting from the current cluster into the on-demand cluster further comprises:

in a first mode, maintaining a head node as active and destroying compute nodes after a job of the plurality of jobs requiring the compute nodes is complete;

in a second mode, maintaining the head node as active and setting off-line the compute nodes after the job requiring the compute nodes is complete; and

in a third mode, upon completion of the job, destroying the new cluster including the head node.

9. The method of claim 1 , wherein the bursting service can be set to on or off.

10. The method of claim 9 , wherein when the bursting service is set to be off, the method includes spinning up all or a portion of licensed instances in a cluster that remain persistent.

11. A system comprising:

one or more processors; and

at least one non-transitory computer-readable storage medium storing instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

evaluating a plurality of jobs received from a plurality of users, the plurality of jobs being in a job queue and to be processed in a current cluster to yield an evaluation, wherein the evaluation determines whether there are enough active nodes in a combination of nodes in the current cluster and first nodes in an on-demand cluster to process the plurality of jobs in the job queue;

determining, based on the evaluation, a bursting mode from a plurality of bursting modes;

bursting from the current cluster into the on-demand cluster based on the bursting mode determined to yield a new cluster comprising second nodes from the on-demand cluster in addition to the nodes in the current cluster and first nodes of the on-demand cluster; and

processing the plurality of jobs via at least one of the current cluster and the new cluster.

12. The system of claim 11 , wherein the evaluation covers all jobs within the job queue that have requirements to finish by a certain time in the job queue.

13. The system of claim 11 , wherein the plurality of bursting modes comprises at least one of a minimum burst mode, a maximum burst mode and a burst all mode.

14. The system of claim 13 , wherein in the minimum burst mode, the operations further comprise spinning up a minimum number of nodes required to complete all the plurality of jobs.

15. The system of claim 13 , wherein in the maximum burst mode, the operations further comprise spinning up enough nodes required to complete all the plurality of jobs immediately.

16. The system of claim 13 , wherein in the burst all mode, the operations further comprise spinning up all available nodes at one time.

17. The system of claim 16 , further comprising, for the burst all mode, shutting down all nodes upon completing all jobs.

18. The system of claim 11 , wherein bursting from the current cluster into the on-demand cluster further comprises:

in a first mode, maintaining a head node as active and destroying compute nodes after a job of the plurality of jobs requiring the compute nodes is complete;

in a second mode, maintaining the head node as active and setting off-line the compute nodes after the job requiring the compute nodes is complete; and

in a third mode, upon completion of the job, destroying the new cluster including the head node.

19. The system of claim 11 , wherein the operations comprise a bursting service that can be set to on or off.

20. The system of claim 19 , wherein when the bursting service is set to be off, the operations further comprise spinning up all or a portion of licensed instances in a cluster that remain persistent.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 17, 2025
From: NODUS SOFTWARE SOLUTIONS LLC
To: ADAPTIVE COMPUTING ENTERPRISES, INC.
Reel/Frame 072281/0822 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 15, 2022
From: ALLEN, ARTHUR L.
To: NODUS SOFTWARE SOLUTIONS LLC
Reel/Frame 059115/0053 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2022
From: NODUS SOFTWARE SOLUTIONS LLC
To: ADAPTIVE COMPUTING ENTERPRISES, INC.
Reel/Frame 058988/0310 →
Continuity (3)
Continuation In Part 16788774 · Feb 12, 2020
Continuation In Part 15994501 · May 31, 2018
Related Publication 20220100573A1 · Mar 31, 2022
References Cited (25)
US 9935829B1 · Miller · 2018 [cited by applicant]
US 10003550B1 · Babcock · 2018 [cited by applicant]
US 10877796B1 · Kinney, Jr. · 2020 [cited by applicant]
US 20060212332A1 · Jackson · 2006 [cited by examiner]
US 20120179824A1 · Jackson · 2012 [cited by examiner]
US 20120222041A1 · Sabin · 2012 [cited by examiner]
US 20130007753A1 · Jain · 2013 [cited by examiner]
US 20130124720A1 · Wood · 2013 [cited by examiner]
US 20130212277A1 · Bodik · 2013 [cited by examiner]
US 20140280961A1 · Martinez · 2014 [cited by applicant]
US 20140379924A1 · Das · 2014 [cited by examiner]
US 20150242204A1 · Hassine · 2015 [cited by applicant]
US 20150341230A1 · Dave · 2015 [cited by applicant]
US 20150370601A1 · Ghosh · 2015 [cited by examiner]
US 20160048408A1 · Madhu · 2016 [cited by applicant]
US 20160105321A1 · Thakkar · 2016 [cited by applicant]
US 20160182397A1 · Mcfarlin · 2016 [cited by examiner]
US 20180227240A1 · Liu · 2018 [cited by applicant]
US 20180349183A1 · Popovic · 2018 [cited by examiner]
US 20190079751A1 · Foskett · 2019 [cited by applicant]
US 20190130327A1 · Carpenter · 2019 [cited by examiner]
US 20190147089A1 · Megahed · 2019 [cited by applicant]
US 20190258513A1 · Poort · 2019 [cited by applicant]
US 20190312795A1 · Karve · 2019 [cited by applicant]
US 20200387357A1 · Mathon · 2020 [cited by applicant]