Patents by Inventor Itay Peled

Itay Peled 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: 20100030974
    Abstract: A write back allocate system that includes: (i) a store request circuit; (ii) a processor, adapted to generate a store request that comprises an information unit and an information unit address; and (iii) a cache module, connected to the store request circuit and to a high level memory unit. A single cache module line includes multiple segments, each segment is adapted to store a single information unit. A content of a cache module line is retrieved from the high level memory unit by generating a fetch burst that includes multiple segment fetch operations. The store request circuit includes a snooper and a controller. The snooper detects a portion of an address of a cache segment of a cache line that is being fetched during a fetch burst. The controller is adapted to request from the cache module to receive the information unit before a completion of the fetch burst if the portion of the address of the cache segment matches a corresponding portion of the information unit address.
    Type: Application
    Filed: July 29, 2008
    Publication date: February 4, 2010
    Inventors: Kostantin Godin, Roman Landa, Itay Peled, Yakov Tokar, Ziv Zamsky
  • Publication number: 20090063779
    Abstract: A cache memory that includes: (i) an arbitrator, connected to multiple access generator, the arbitrator is adapted to receive different types of access requests from the multiple access generators and to select a single access request per arbitration cycle; (ii) a sequence of pipeline stages, the sequence comprises an input pipeline stage that is connected to the arbiter; and (iii) multiple cache resources, connected to the sequence of pipeline stages; wherein each cache resource can be read only by a small portion of the sequence of pipeline stages and can be written to only by a small portion of the sequence of pipeline stages.
    Type: Application
    Filed: September 4, 2007
    Publication date: March 5, 2009
    Applicant: Freescale Semiconductor Inc.
    Inventors: Shai Koren, Alon Eldar, Amit Gur, Itay Peled, Rotem Porat
  • Publication number: 20080301371
    Abstract: A memory cache control arrangement for performing a coherency operation on a memory cache comprises a receive processor for receiving an address group indication for an address group comprising a plurality of addresses associated with a main memory. The address group indication may indicate a task identity and an address range corresponding to a memory block of the main memory. A control unit processes each line of a group of cache lines sequentially. Specifically it is determined if each cache line is associated with an address of the address group by evaluating a match criterion. If the match criterion is met, a coherency operation is performed on the cache line. If a conflict exists between the coherency operation and another memory operation the coherency means inhibits the coherency operation. The invention allows a reduced duration of a cache coherency operation. The duration is further independent of the size of the main memory address space covered by the coherency operation.
    Type: Application
    Filed: May 31, 2005
    Publication date: December 4, 2008
    Applicant: FREESCALE SEMICONDUCTOR, INC.
    Inventors: Itay Peled, Moshe Anschel, Yacov Efrat, Alon Eldar
  • Publication number: 20070294504
    Abstract: A virtual address cache and a method for sharing data. The virtual address cache includes: a memory, adapted to store virtual addresses, task identifiers and data associated with the virtual addresses and the task identifiers; and a comparator, connected to the memory, adapted to determine that data associated with a received virtual address and a received task identifier is stored in the memory if at least a portion of the received virtual address equals at least a corresponding portion of a certain stored virtual address and if at least one of the following criteria is fulfilled: the received task identifier equals a stored task identifier, (ii) a stored task identifier associated with the certain stored virtual address indicates that the data is shared between multiple tasks.
    Type: Application
    Filed: August 31, 2004
    Publication date: December 20, 2007
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Itay Peled, Moshe Anschel
  • Publication number: 20070277009
    Abstract: A memory management unit that includes: (i) multiple data segment descriptors, each data segment descriptor associated with a data memory segment; (ii) multiple program segment descriptors, each program segment descriptor associated with a program memory segment; and (iii) a controller, adapted to replace the content of the multiple data segment descriptors and the multiple program segment descriptors in response to a task switch.
    Type: Application
    Filed: September 10, 2004
    Publication date: November 29, 2007
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Moshe Anschel, Moshe Bachar, Uri Dayan, Jacob Efrat, Itay Peled, Zvika Rozenshein
  • Publication number: 20070266199
    Abstract: A virtual address cache comprising a comparator arranged to receive a virtual address for addressing data associated with a task and a memory, wherein the comparator is arranged to make a determination as to whether data associated with the received virtual address is stored in the memory based upon an indication that the virtual address is associated with data shared between a first task and a second task and a comparison of the received virtual address with an address associated with data stored in memory.
    Type: Application
    Filed: September 7, 2004
    Publication date: November 15, 2007
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Itay Peled, Moshe Anschel, Moshe Bachar, Jacob Efrat, Alon Eldar, Yakov Tokar
  • Patent number: 7249288
    Abstract: A method and apparatus non-intrusive tracing. The method includes: counting selected events by multiple counters; sampling the multiple counters to retrieve multiple counter values in response to predefined triggering events; receiving additional trace information that comprises at least one program counter value, and outputting, as a trace information, at least one of the multiple counters values and the additional trace information.
    Type: Grant
    Filed: September 14, 2004
    Date of Patent: July 24, 2007
    Assignee: Freescale Semiconductor, Inc.
    Inventors: Itay Peled, Moshe Anschel, Uri Dayan, Jacob Efrat, Avraham Horn
  • Publication number: 20060069952
    Abstract: A method and apparatus non-intrusive tracing. The method includes: counting selected events by multiple counters; sampling the multiple counters to retrieve multiple counter values in response to predefined triggering events; receiving additional trace information that comprises at least one program counter value, and outputting, as a trace information, at least one of the multiple counters values and the additional trace information.
    Type: Application
    Filed: September 14, 2004
    Publication date: March 30, 2006
    Inventors: Itay Peled, Moshe Anschel, Uri Dayan, Jacob Efrat, Avraham Horn
  • Publication number: 20060059312
    Abstract: A method for fetching information in response to hazard indication information, the method includes: (i) associating hazard indication information to at least one information unit that is being fetched to the cache module; (ii) receiving a request to perform a fetch operation; and (iii) determining whether to fetch at least one information unit to the cache module in response to the hazard indication information and in response to dirty information associated with the at least one information unit.
    Type: Application
    Filed: September 14, 2004
    Publication date: March 16, 2006
    Inventors: Itay Peled, Moshe Anschel, Jacob Efrat, Alon Eldar, Ziv Zamsky