Patents by Inventor Michael Zuckerman

Michael Zuckerman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20250028509
    Abstract: For example, a compiler may be configured to identify a first plurality of instructions based on a source code to be compiled into a target code to be executed by a target processor. For example, the compiler may be configured to determine, based on the first plurality of instructions, an instruction to Arithmetic Logic Unit (ALU) (instruction-ALU) allocation to allocate a second plurality of instructions to a plurality of ALU's of the target processor. For example, the second plurality of instructions may be based on the first plurality of instructions. For example, the compiler may be configured to generate the target code based on compilation of the source code. For example, the target code may be based on the second plurality of instructions allocated to the plurality of ALUs.
    Type: Application
    Filed: October 12, 2023
    Publication date: January 23, 2025
    Applicant: MOBILEYE VISION TECHNOLOGIES LTD.
    Inventors: Alon Kom, Michael Zuckerman, Michael Marjieh, Oren Benita Ben-Simhon
  • Patent number: 11714653
    Abstract: A method for computing includes defining a processing pipeline, including at least a first stage in which producer processors compute and output data to respective locations in a buffer and a second processing stage in which one or more consumer processors read the data from the buffer and apply a computational task to the data read from the buffer. The computational task is broken into multiple, independent work units, for application by the consumer processors to respective ranges of the data in the buffer, and respective indexes are assigned to the work units in a predefined index space. A mapping is generated between the index space and the addresses in the buffer, and execution of the work units is scheduled such that at least one of the work units can begin execution before all the producer processors have completed the first processing stage.
    Type: Grant
    Filed: February 15, 2021
    Date of Patent: August 1, 2023
    Assignee: HABANA LABS LTD.
    Inventors: Tzachi Cohen, Michael Zuckerman, Doron Singer, Ron Shalev, Amos Goldman
  • Patent number: 11467827
    Abstract: A method for computing includes providing software source code defining a processing pipeline including multiple, sequential stages of parallel computations, in which a plurality of processors apply a computational task to data read from a buffer. A static code analysis is applied to the software source code so as to break the computational task into multiple, independent work units, and to define an index space in which the work units are identified by respective indexes. Based on the static code analysis, mapping parameters that define a mapping between the index space and addresses in the buffer are computed, indicating by the mapping the respective ranges of the data to which the work units are to be applied. The source code is compiled so that the processors execute the work units identified by the respective indexes while accessing the data in the buffer in accordance with the mapping.
    Type: Grant
    Filed: April 6, 2021
    Date of Patent: October 11, 2022
    Assignee: HABANA LABS LTD.
    Inventors: Michael Zuckerman, Tzachi Cohen, Doron Singer, Ron Shalev, Amos Goldman
  • Patent number: D589966
    Type: Grant
    Filed: October 1, 2008
    Date of Patent: April 7, 2009
    Inventor: Michael Zuckerman
  • Patent number: D595725
    Type: Grant
    Filed: December 9, 2008
    Date of Patent: July 7, 2009
    Inventor: Michael Zuckerman
  • Patent number: D632697
    Type: Grant
    Filed: November 5, 2009
    Date of Patent: February 15, 2011
    Inventor: Michael Zuckerman