Patents by Inventor Elad Kadosh

Elad Kadosh 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: 20240095175
    Abstract: A cache is provided having a plurality of entries for storing data. In response to a given access request, lookup circuitry performs a lookup operation in the cache to determine whether one of the entries in the cache is allocated to store data associated with the memory address indicated by the given access request, with a hit indication or a miss indication being generated dependent on the outcome of that lookup operation. During a single lookup period, the lookup circuitry is configured to perform lookup operations in parallel for up to N access requests. In addition, allocation circuitry is provided that is able to determine, during the single lookup period, at least N candidate entries for allocation from amongst the plurality of entries, and to cause one of the candidate entries to be allocated for each of the up to N access requests for which the lookup circuitry generates a miss indication.
    Type: Application
    Filed: September 21, 2022
    Publication date: March 21, 2024
    Inventors: Yoav Asher LEVY, Elad KADOSH, Jakob Axel FRIES, Lior-Levi BANDAL
  • Patent number: 11914518
    Abstract: A cache is provided having a plurality of entries for storing data. In response to a given access request, lookup circuitry performs a lookup operation in the cache to determine whether one of the entries in the cache is allocated to store data associated with the memory address indicated by the given access request, with a hit indication or a miss indication being generated dependent on the outcome of that lookup operation. During a single lookup period, the lookup circuitry is configured to perform lookup operations in parallel for up to N access requests. In addition, allocation circuitry is provided that is able to determine, during the single lookup period, at least N candidate entries for allocation from amongst the plurality of entries, and to cause one of the candidate entries to be allocated for each of the up to N access requests for which the lookup circuitry generates a miss indication.
    Type: Grant
    Filed: September 21, 2022
    Date of Patent: February 27, 2024
    Assignee: Arm Limited
    Inventors: Yoav Asher Levy, Elad Kadosh, Jakob Axel Fries, Lior-Levi Bandal
  • Patent number: 9916332
    Abstract: An example process for selecting chart scalings for plotting two time-series datasets includes determining a first log difference between a logarithm of a maximum value of a first dataset and a logarithm of a minimum value of the first dataset. The process also includes determining a second log difference between a logarithm of a maximum value of a second dataset and a logarithm of a minimum value of the second dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the first dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the second dataset.
    Type: Grant
    Filed: July 9, 2015
    Date of Patent: March 13, 2018
    Assignee: EntIT Software LLC
    Inventors: Luba Tsirulnik, Gabriel Dayan, Elad Kadosh
  • Publication number: 20170315842
    Abstract: In one implementation, a system for resource consuming tasks scheduling includes a metrics engine to identify a plurality of metrics based on a task to be scheduled, a utilization engine to generate a compiled representation of combined resource values over a period of time, wherein the combined resource values are based on a combination of the plurality of metrics;, an identification engine to identify common lows of resource utilization for the plurality of metrics based on the generated representation, and a schedule engine to schedule the task for a time that corresponds to the identified common lows of resource utilization.
    Type: Application
    Filed: October 30, 2014
    Publication date: November 2, 2017
    Inventors: Marina Lyan, Pavel Danichev, Elad Kadosh
  • Publication number: 20170011072
    Abstract: An example process for selecting chart scalings for plotting two time-series datasets includes determining a first log difference between a logarithm of a maximum value of a first dataset and a logarithm of a minimum value of the first dataset. The process also includes determining a second log difference between a logarithm of a maximum value of a second dataset and a logarithm of a minimum value of the second dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the first dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the second dataset.
    Type: Application
    Filed: July 9, 2015
    Publication date: January 12, 2017
    Inventors: Luba Tsirulnik, Gabriel Dayan, Elad Kadosh