Simplified Hash Table
US-2024422006-A1 · Dec 19, 2024 · US
Scheduling in MapReduce-like systems for fast completion time
US9104477B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9104477-B2 |
| Application number | US-201113101626-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 5, 2011 |
| Priority date | May 5, 2011 |
| 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 method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.
First claim
Opening claim text (preview).
We claim: 1. A computer-implemented method for scheduling a plurality of tasks, wherein tasks are assigned respectively to one of a plurality of processors, the method comprising: in response to respective arrivals of new jobs, determining, using one or more computer processors and memory, weighted lower bound completion times for a plurality of jobs respectively based on an importance of its respective job, wherein a job comprises a plurality of tasks; and determining, using on…
Assignees
Inventors
Classifications
- G06F9/4881Primary
Physics · 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 US9104477B2 cover?
- A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.
- Who is the assignee on this patent?
- Kodialam Muralidharan S, Lakshman Tirunell V, Mukherjee Sarit, and 3 more
- What technology area does this patent fall under?
- Primary CPC classification G06F9/4881. 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).