IP Library Granted Patent US 10,430,919
Granted Patent B2
US 10,430,919 · App. 15/594,512 · Granted Oct 1, 2019

Determination of per line buffer unit memory allocation

Inventors: Hyunchul Park (Santa Clara, CA); Albert Meixner (Mountain View, CA); Qiuling Zhu (Santa Clara, CA); William Mark (Mountain View, CA)
Assignee: Google LLC
G06T1/60G06F3/0604G06F3/068G06F3/0631G06F3/0659G06F3/0664G06F9/5016G06F17/5009G06F17/5022G06T1/20G09G5/363G06F12/084G06F12/0842G06F2212/455G06F2212/601
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,430,919
App. No.
15/594,512
Filed
May 12, 2017
Granted
Oct 1, 2019
Kind
B2
Examiner
HSU, JONI
Art Unit
2611
USPC
345/531
Abstract

A method is described. The method includes simulating execution of an image processing application software program. The simulating includes intercepting kernel-to-kernel communications with simulated line buffer memories that store and forward lines of image data communicated from models of producing kernels to models of consuming kernels. The simulating further includes tracking respective amounts of image data stored in the respective line buffer memories over a simulation runtime. The method also includes determining respective hardware memory allocations for corresponding hardware line buffer memories from the tracked respective amounts of image data. The method also includes generating configuration information for an image processor to execute the image processing application software program. The configuration information describes the hardware memory allocations for the hardware line buffer memories of the image processor.

Claims (35)

1. A non-transitory machine readable storage medium containing program code that when processed by a computing system causes the computing system to perform operations comprising:

simulating execution of an image processing application software program having a plurality of kernels, each kernel comprising load instructions that read from a line buffer storing data produced by another kernel, store instructions that write to a line buffer storing data to be consumed by another kernel, or both, wherein simulating the execution of the image processing application software program comprises simulating operations of a plurality of line buffers using a respective plurality of simulated line buffers, including performing operations comprising:

simulating each load instruction occurring in the plurality of kernels including updating a respective read pointer for a respective simulated line buffer that simulates a line buffer referenced by the load instruction,

simulating each write instruction occurring in the plurality of kernels including updating a respective write pointer for a respective simulated line buffer that simulates a line buffer referenced by the store instruction;

computing, for each simulated line buffer, a respective maximum difference encountered during the simulation between the respective read pointer and the respective write pointer of the simulated line buffer; and

generating a respective memory size to allocate to line buffers of an image processor based on the respective maximum differences computed for the simulated line buffers.

2. The non-transitory machine readable storage medium of claim 1 , wherein the operations further comprise continually updating the maximum difference between each read pointer and each write pointer for each respective simulated line buffer during the simulation.

3. The non-transitory machine readable storage medium of claim 1 wherein simulating execution of the image processing application comprises imposing a write policy for a particular simulated line buffer that prevents a next unit of image data from being written into the particular simulated line buffer memory until one or more simulated load instructions are stalled.

4. The non-transitory machine readable storage medium of claim 1 , further comprising stripping out one or more instructions that are not load or store instructions from one or more of the plurality of kernels.

5. The non-transitory machine readable storage medium of claim 4 , wherein simulating execution of the image processing application comprises simulating respective delays for instructions that were stripped out of one or more of the plurality of kernels.

6. The non-transitory machine readable storage medium of claim 1 wherein the each simulated line buffer corresponds to a respective line buffer of an image processor having a plurality of line buffers configured to buffer data among a plurality of processing cores of the image processor.

7. The non-transitory machine readable storage medium of claim 6 wherein the image processing application software program is code that is compiled to be executed by a processing core having a two dimensional execution lane array and a two dimensional shift register array.

8. The non-transitory machine readable storage medium of claim 1 , wherein each simulated line buffer comprises an unbounded portion of memory.

9. A system, comprising:

one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising

simulating execution of an image processing application software program having a plurality of kernels, each kernel comprising load instructions that read from a line buffer storing data produced by another kernel, store instructions that write to a line buffer storing data to be consumed by another kernel, or both, wherein simulating the execution of the image processing application software program comprises simulating operations of a plurality of line buffers using a respective plurality of simulated line buffers, including performing operations comprising:

simulating each load instruction occurring in the plurality of kernels including updating a respective read pointer for a respective simulated line buffer that simulates a line buffer referenced by the load instruction,

simulating each write instruction occurring in the plurality of kernels including updating a respective write pointer for a respective simulated line buffer that simulates a line buffer referenced by the store instruction;

computing, for each simulated line buffer, a respective maximum difference encountered during the simulation between the respective read pointer and the respective write pointer of the simulated line buffer; and

generating a respective memory size to allocate to line buffers of an image processor based on the respective maximum differences computed for the simulated line buffers.

10. The system of claim 9 wherein simulating execution of the image processing application comprises imposing a write policy for a particular simulated line buffer that prevents a next unit of image data from being written into the particular simulated line buffer memory until one or more simulated load instructions are stalled.

11. The system of claim 9 , further comprising stripping out one or more instructions that are not load or store instructions from one or more of the plurality of kernels.

12. The system of claim 9 , wherein simulating execution of the image processing application comprises simulating respective delays for instructions that were stripped out of one or more of the plurality of kernels.

13. A method, comprising:

simulating execution of an image processing application software program having a plurality of kernels, each kernel comprising load instructions that read from a line buffer storing data produced by another kernel, store instructions that write to a line buffer storing data to be consumed by another kernel, or both, wherein simulating the execution of the image processing application software program comprises simulating operations of a plurality of line buffers using a respective plurality of simulated line buffers, including performing operations comprising:

simulating each load instruction occurring in the plurality of kernels including updating a respective read pointer for a respective simulated line buffer that simulates a line buffer referenced by the load instruction,

simulating each write instruction occurring in the plurality of kernels including updating a respective write pointer for a respective simulated line buffer that simulates a line buffer referenced by the store instruction;

computing, for each simulated line buffer, a respective maximum difference encountered during the simulation between the respective read pointer and the respective write pointer of the simulated line buffer; and

generating a respective memory size to allocate to line buffers of an image processor based on the respective maximum differences computed for the simulated line buffers.

14. The method of claim 13 wherein simulating execution of the image processing application comprises imposing a write policy for a particular simulated line buffer that prevents a next unit of image data from being written into the particular simulated line buffer memory until one or more simulated load instructions are stalled.

15. The method of claim 13 , further comprising stripping out one or more instructions that are not load or store instructions from one or more of the plurality of kernels.

16. The method of claim 13 , wherein simulating execution of an image processing application software program comprises:

loading a compiled version of the image processing application software program onto a hardware image processor;

configuring each simulated line buffer according to the compiled version of the image processing application software program; and

executing the compiled version of the image processing application software program on the hardware image processor using one or more of the configured simulated hardware line buffer units.

Assignments (2)
CHANGE OF NAME Recorded Oct 20, 2017
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 044567/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 23, 2017
From: PARK, HYUNCHUL; MEIXNER, ALBERT; ZHU, QIULING; MARK, WILLIAM
To: GOOGLE INC.
Reel/Frame 042484/0031 →
Continuity (1)
Related Publication 20180330467A1 · Nov 15, 2018