Systems and Methods for Efficient Data Preprocessing of Machine Learning Workloads
US-2024403138-A1 · Dec 5, 2024 · US
Resource sharing aware task partitioning for multiprocessors
US8938739B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8938739-B2 |
| Application number | US-201213487185-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 2, 2012 |
| Priority date | Jun 2, 2012 |
| Publication date | Jan 20, 2015 |
| Grant date | Jan 20, 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 multi processor task allocation method is described that considers task dependencies while performing task allocation in order to avoid blocking of a task's execution while waiting for the resolution of the dependency. While allocating the tasks to the processors the potential blocking time is considered, and the best allocation that will have the least amount of blocking time is found.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of multiprocessor task partitioning comprising the steps of: calculating processor utilization for each task; combining tasks sharing a common resource to form composite tasks; calculating processor utilization for each composite task; arranging not combined tasks and the composite tasks in a non increasing order of their processor utilization in an array; applying a worst fit decreasing heuristic on the tasks in said array; using a respon…
Assignees
Inventors
Classifications
- G06F9/5066Primary
Physics · mapped topic
- G06F9/4881Primary
Physics · mapped topic
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 US8938739B2 cover?
- A multi processor task allocation method is described that considers task dependencies while performing task allocation in order to avoid blocking of a task's execution while waiting for the resolution of the dependency. While allocating the tasks to the processors the potential blocking time is considered, and the best allocation that will have the least amount of blocking time is found.
- Who is the assignee on this patent?
- Kandhalu Raghu Arvind, Lee Sejoong, Choi Soon-Hyeok, and 1 more
- What technology area does this patent fall under?
- Primary CPC classification G06F9/5066. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Jan 20 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).