System and method for changing abilities of a process
US-9213571-B2 · Dec 15, 2015 · US
US10445250B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10445250-B2 |
| Application number | US-201715859454-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 30, 2017 |
| Priority date | Dec 30, 2017 |
| Publication date | Oct 15, 2019 |
| Grant date | Oct 15, 2019 |
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.
Systems, methods, and apparatuses relating to a configurable spatial accelerator are described. In one embodiment, a processor includes a core with a decoder to decode an instruction into a decoded instruction and an execution unit to execute the decoded instruction to perform a first operation; a plurality of processing elements; and an interconnect network between the plurality of processing elements to receive an input of a dataflow graph comprising a plurality of nodes, wherein the dataflow graph is to be overlaid into the interconnect network and the plurality of processing elements with each node represented as a dataflow operator in the plurality of processing elements, and the plurality of processing elements are to perform a second operation by a respective, incoming operand set arriving at each of the dataflow operators of the plurality of processing elements.
Opening claim text (preview).
What is claimed is: 1. An apparatus comprising: a spatial array of processing elements to receive an input of a dataflow graph comprising a plurality of nodes, wherein the dataflow graph is to be overlaid into the spatial array of processing elements with each node represented as a dataflow operator in the spatial array of processing elements, and the spatial array of processing elements is to perform an operation by a respective, incoming operand set arriving at each of the dataflow operators; a plurality of request address file circuits coupled to the spatial array of processing elements and a cache memory, each request address file circuit of the plurality of request address file circuits to access data in the cache memory in response to a request for data access from the spatial array of processing elements; a plurality of translation lookaside buffers comprising a translation lookaside buffer in each of the plurality of request address file circuits to provide an output of a physical address for an input of a virtual address; and a translation lookaside buffer manager circuit comprising a higher-level translation lookaside buffer than the plurality of translation lookaside buffers, the translation lookaside buffer manager circuit to perform a first page walk in the cache memory for a miss of an input of a virtual address into a first translation lookaside buffer and into the higher-level translation lookaside buffer to determine a physical address mapped to the virtual address, and store a mapping of the virtual address to the physical address from the first page walk in the higher-level translation lookaside buffer to cause the higher-level translation lookaside buffer to send the physical address to the first translation lookaside buffer in a first request address file circuit. 2. The apparatus of claim 1 , wherein the translation lookaside buffer manager circuit is to: concurrently, with the first page walk, perform a second page walk in the cache memory, wherein the second page walk is for a miss of an input of a virtual address into a second translation lookaside buffer and into the higher-level translation lookaside buffer to determine a physical address mapped to the virtual address, and store a mapping of the virtual address to the physical address from the second page walk in the higher-level translation lookaside buffer to cause the higher-level translation lookaside buffer to send the physical address to the second translation lookaside buffer in a second request address file circuit. 3. The apparatus of claim 1 , wherein receipt of the physical address in the first translation lookaside buffer is to cause the first request address file circuit to perform a data access for the request for data access from the spatial array of processing elements on the physical address in the cache memory. 4. The apparatus of claim 1 , wherein the translation lookaside buffer manager circuit is to insert an indicator in the higher-level translation lookaside buffer for the miss of the input of the virtual address in the first translation lookaside buffer and the higher-level translation lookaside buffer to prevent an additional page walk for the input of the virtual address during the first page walk. 5. The apparatus of claim 1 , wherein the translation lookaside buffer manager circuit is to receive a shootdown message from a requesting entity for a mapping of a physical address to a virtual address, invalidate the mapping in the higher-level translation lookaside buffer, and send shootdown messages to only those of the plurality of request address file circuits that include a copy of the mapping in a respective translation lookaside buffer, wherein each of those of the plurality of request address file circuits are to send an acknowledgement message to the translation lookaside buffer manager circuit, and the translation lookaside buffer manager circuit is to send a shootdown completion acknowledgment message to the requesting entity when all acknowledgement messages are received. 6. The apparatus of claim 1 , wherein the translation lookaside buffer manager circuit is to receive a shootdown message from a requesting entity for a mapping of a physical address to a virtual address, invalidate the mapping in the higher-level translation lookaside buffer, and send shootdown messages to all of the plurality of request address file circuits, wherein each of the plurality of request address file circuits are to send an acknowledgement message to the translation lookaside buffer manager circuit, and the translation lookaside buffer manager circuit is to send a shootdown completion acknowledgment message to the requesting entity when all acknowledgement messages are received. 7. A method comprising: overlaying an input of a dataflow graph comprising a plurality of nodes into a spatial array of processing elements with each node represented as a dataflow operator in the spatial array of processing elements; coupling a plurality of request address file circuits to the spatial array of processing elements and a cache memory with each request address file circuit of the plurality of request address file circuits accessing data in the cache memory in response to a request for data access from the spatial array of processing elements; providing an output of a physical address for an input of a virtual address into a translation lookaside buffer of a plurality of translation lookaside buffers comprising a translation lookaside buffer in each of the plurality of request address file circuits; coupling a translation lookaside buffer manager circuit comprising a higher-level translation lookaside buffer than the plurality of translation lookaside buffers to the plurality of request address file circuits and the cache memory; and performing a first page walk in the cache memory for a miss of an input of a virtual address into a first translation lookaside buffer and into the higher-level translation lookaside buffer with the translation lookaside buffer manager circuit to determine a physical address mapped to the virtual address, and store a mapping of the virtual address to the physical address from the first page walk in the higher-level translation lookaside buffer to cause the higher-level translation lookaside buffer to send the physical address to the first translation lookaside buffer in a first request address file circuit. 8. The method of claim 7 , further comprising: concurrently, with the first page walk, performing a second page walk in the cache memory with the translation lookaside buffer manager circuit, wherein the second page walk is for a miss of an input of a virtual address into a second translation lookaside buffer and into the higher-level translation lookaside buffer to determine a physical address mapped to the virtual address, and storing a mapping of the virtual address to the physical address from the second page walk in the higher-level translation lookaside buffer to cause the higher-level translation lookaside buffer to send the physical address to the second translation lookaside buffer in a second request address file circuit. 9. The method of claim 7 , further comprising causing the first request address file circuit to perform a data access for the request for data access from the spatial array of processing elements on the physical address in the cache memory in response to receipt of the physical address in the first translation lookaside buffer. 10. The method of claim 7 , further comprising inserting, with the translation lookaside buffer manager circuit, an indicator in the higher-level translation lookaside buffer for the miss of the input of the virtual address in the first translation lookaside
Details relating to cache mapping · CPC title
Power efficiency · CPC title
the data cache being concurrently physically addressed · CPC title
Mapping of cache memory to specific storage devices or parts thereof · CPC title
Non-volatile memory · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.