Multiprocessor Programming Toolkit for Design Reuse
US-2024394048-A1 · Nov 28, 2024 · US
US9104432B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9104432-B2 |
| Application number | US-201313925083-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 24, 2013 |
| Priority date | Jun 24, 2013 |
| Publication date | Aug 11, 2015 |
| Grant date | Aug 11, 2015 |
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.
Compile-time recognition of graph structure where graph has arbitrary connectivity and is constructed using recursive computations is provided. In one aspect, the graph structure recognized at compile time may be duplicated at runtime and can then operate on runtime values not known at compile time.
Opening claim text (preview).
We claim: 1. A method for extracting a stream graph for a hardware circuit from a program written in a programming language, comprising: receiving a program; analyzing the program, by a processor, for one or more constructs in the programming language that builds the stream graph for programming the hardware circuit, a node in the stream graph representing a computation to be performed, the computation expressed in the programming language, an edge in the stream graph representi…
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.