Scheduling system and method for online program update
US-2021365023-A1 · Nov 25, 2021 · US
US12093724B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12093724-B2 |
| Application number | US-202016910532-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 24, 2020 |
| Priority date | Jun 24, 2020 |
| Publication date | Sep 17, 2024 |
| Grant date | Sep 17, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Disclosed methods for managing two or more information handling systems receive administrator preferences for a job to be scheduled ton each system and assign time slots, based on the administrator preferences, for performing the job on each system. The time slots are assigned in a manner that avoids or minimizes time slot overlap. Job requests are created for each system wherein each job request includes or otherwise indicates a scheduled time slot for executing the job.
Opening claim text (preview).
What is claimed is: 1. A method comprising, at a management module configured to manage a plurality of information handling system server nodes: obtaining administrator preferences for a job to be scheduled at each of the plurality of information handling system server nodes; based on the administrator preferences, assigning for each of the plurality of information handling system server nodes a respective time slot for performing the job at such information handling system server node, to reduce overlap among the respective time slots; creating for each of the plurality of information handling system server nodes a respective job request for performing the job at such information handling system server node, the job request including a scheduled time for execution of the job based on the respective time slot of such information handling system server node; scheduling, at each information handling system server nodes, the job request associated with such information handling system based on a combination of: the scheduled time for execution associated with such information handling system node; and a node-based delay for job execution, determined based on an attribute of such information handling system server node wherein a value of the attribute differs between at least two of the plurality of information handling system server nodes. 2. The method of claim 1 , wherein the administrator preferences include one or more of a type of job to be scheduled, a window of time for scheduling the job, a scheduling behavior, and identities of the information handling system server nodes at which the job is to be performed. 3. The method of claim 2 , wherein the administrator preferences include a window of time for scheduling the job, and assigning the respective time slots comprises assigning the respective time slots within the window of time. 4. The method of claim 1 , wherein the administrator preferences include a scheduling behavior defining whether the respective time slots are assigned randomly or serially to the plurality of information handling system server nodes. 5. The method of claim 1 , wherein the attribute is a slot number associated with such information handling system server node. 6. The method of claim 1 , wherein the node-based delay is a mathematical product of a fixed delay and the attribute. 7. The method of claim 6 , wherein the fixed delay is based on a type of job subject to the job request. 8. The method of claim 1 , further comprising executing the job based on the scheduled time for execution and the node-based delay. 9. The method of claim 1 , wherein the node-based delay is based on a mathematical product of the attribute and a semaphore that ensures only one of the plurality of information handling system server nodes executes the job at a time. 10. The method of claim 1 , wherein the attribute is a random number. 11. An information handling system comprising: a central processing unit (CPU); and a computer readable memory including processor-executable instructions that, when executed by the CPU, cause a management module of the system, configured to manage a plurality of information handling system server nodes, to perform operations including: obtaining administrator preferences for a job to be scheduled at each of the plurality of information handling system server nodes; based on the administrator preferences, assigning for each of the plurality of information handling system server nodes a respective time slot for performing the job at such information handling system server node, to reduce overlap among the respective time slots; creating for each of the plurality of information handling system server nodes a respective job request for performing the job at such information handling system server node, the job request including a scheduled time for execution of the job based on the respective time slot of such information handling system server node; scheduling, at each information handling system server nodes, the job request associated with such information handling system based on a combination of: the scheduled time for execution associated with such information handling system node; and a node-based delay for job execution, determined based on an attribute of such information handling system server node wherein a value of the attribute differs between at least two of the plurality of information handling system server nodes. 12. The information handling system of claim 11 , wherein the administrator preferences include one or more of a type of job to be scheduled, a window of time for scheduling the job, a scheduling behavior, and identities of the information handling system server nodes at which the job is to be performed. 13. The information handling system of claim 12 , wherein the administrator preferences include a window of time for scheduling the job, and assigning the respective time slots comprises assigning the respective time slots within the window of time. 14. The information handling system of claim 11 , wherein the administrator preferences include a scheduling behavior defining whether the respective time slots are assigned randomly or serially to the plurality of information handling system server nodes. 15. The information handling system of claim 11 , wherein the attribute is a slot number associated with such information handling system server node. 16. The information handling system of claim 11 , wherein the node-based delay is a mathematical product of a fixed delay and the attribute. 17. The information handling system of claim 16 , wherein the fixed delay is based on a type of job subject to the job request. 18. The information handling system of claim 11 , wherein the operations further include executing the job based on the scheduled time for execution and the node-based delay. 19. The information handling system of claim 11 , wherein the node-based delay is based on a mathematical product of the attribute and a semaphore that ensures only one of the plurality of information handling system server nodes executes the job at a time. 20. The information handling system of claim 11 , wherein the attribute is a random number.
Transaction processing · CPC title
Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title
involving deadlines, e.g. rate based, periodic · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.