Managing data center orchestration using service plans and manifests
US-2024385850-A1 · Nov 21, 2024 · US
Batch scheduler management of speculative and non-speculative tasks based on conditions of tasks and compute resources
US9104491B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9104491-B2 |
| Application number | US-201213401773-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 21, 2012 |
| Priority date | Feb 21, 2012 |
| Publication date | Aug 11, 2015 |
| Grant date | Aug 11, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilized by the client is less than or equal to the predetermined limit, such that the non-speculative task is processed without being preempted by an additional task requested by an additional client. The task is dispatched, from the batch scheduler to the compute node, as a speculative task if the quantity of compute resources is available to process the task, and the quantity of compute resources in addition to the total quantity of compute resources is greater than the predetermined limit.
First claim
Opening claim text (preview).
We claim: 1. A computer program product comprising a non-transitory computer readable storage device having a computer readable program stored thereon, wherein the computer readable program when executed on a computer causes the computer to: receive, from a client, a request to perform a task, the client having a predetermined limit of compute resources; dispatch the task, from a batch scheduler to a compute node, as a non-speculative task if a quantity of compute resources is a…
Assignees
Inventors
Classifications
- G06F9/5072Primary
Physics · mapped topic
Physics · mapped topic
Cross-Sectional Technologies · mapped topic
Cross-Sectional Technologies · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9104491B2 cover?
- A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilize…
- Who is the assignee on this patent?
- Geibel Jonathan Eric, Jordan Jeffrey M, Burris Scott Lane, and 3 more
- What technology area does this patent fall under?
- Primary CPC classification G06F9/5072. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Aug 11 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).