PatentsDB

Scheduling for parallel processing of regionally-constrained placement problem

US8930867B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-8930867-B2
Application numberUS-201314046207-A
CountryUS
Kind codeB2
Filing dateOct 4, 2013
Priority dateJan 26, 2009
Publication dateJan 6, 2015
Grant dateJan 6, 2015

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Scheduling of parallel processing for regionally-constrained object placement selects between different balancing schemes. For a small number of movebounds, computations are assigned by balancing the placeable objects. For a small number of objects per movebound, computations are assigned by balancing the movebounds. If there are large numbers of movebounds and objects per movebound, both objects and movebounds are balanced amongst the processors. For object balancing, movebounds are assigned to a processor until an amortized number of objects for the processor exceeds a first limit above an ideal number, or the next movebound would raise the amortized number of objects above a second, greater limit. For object and movebound balancing, movebounds are sorted into descending order, then assigned in the descending order to host processors in successive rounds while reversing the processor order after each round. The invention provides a schedule in polynomial-time while retaining high quality of results.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer-implemented method of assigning computational loads for placement regions of an integrated circuit design to a plurality of host processors in a computer system, comprising: receiving a list of the placement regions and placeable objects associated with the placement regions by executing first instructions in the computer system; calculating an ideal number of placeable objects per processor by executing second instructions in the computer syste…

Assignees

Inventors

Classifications

Patent family

Related publications grouped by family.

View patent family 42355230

External sources

Next steps

Free tools are coming soon. Tell us what you want to track and we'll notify you.

Get alerts for this patentView on Google Patents

Request deeper analysis

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US8930867B2 cover?
Scheduling of parallel processing for regionally-constrained object placement selects between different balancing schemes. For a small number of movebounds, computations are assigned by balancing the placeable objects. For a small number of objects per movebound, computations are assigned by balancing the movebounds. If there are large numbers of movebounds and objects per movebound, both objec…
Who is the assignee on this patent?
IBM
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 06 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).