Patents by Inventor Vadim Pasternak

Vadim Pasternak 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: 20250126743
    Abstract: An apparatus includes an interface and thermal management circuitry (TMC). The interface is configured to receive multiple measurements of multiple temperatures measured in multiple locations of an electronic system, respectively. The TMC is configured to: (a) convert the multiple measurements into multiple pulse width modulation (PWM) parameters, (b) calculate, based on at least the multiple PWM parameters, one or more PWM signals, and (c) control the multiple temperatures by applying the one or more PWM signals to one or more cooling devices.
    Type: Application
    Filed: October 15, 2023
    Publication date: April 17, 2025
    Inventors: Beeri Halachmi, Nir Einati, Vadim Pasternak
  • Publication number: 20250077236
    Abstract: System, methods, and devices for initializing a system by loading drivers are provided. In one example, a system includes comprising one or more circuits to initiate a system initiation or a boot of the system, during the system initiation or the boot of the system, read data from a non-volatile memory, based on the data from the non-volatile memory, identify a plurality of hardware components, identify one or more drivers based on the plurality of hardware components, and load the one or more drivers during the system initiation or the boot of the system.
    Type: Application
    Filed: September 5, 2023
    Publication date: March 6, 2025
    Inventors: Ofer Levy, Nir Einati, Michael Shych, Vadim Pasternak, Layal Arkab, Keren Younger Hadad
  • Publication number: 20030174717
    Abstract: A system and method for performing longest prefix matching processing, such as that employed for IP destination address lookups, is disclosed. The technique, referred as the Optimized Multi-bit Trie (OMT) approach, maps a routing table having prefix entries and next hop identification (NHID) values into a compact and readily searchable data structure. LPM searches of the OMT data structure can be performed without backtracking and without loops on the trie level. LPM searches of the OMT data structure can be performed without performing condition checks. The OMT data structure is constructed for a routing table so that the LPM searches are performed according to a fixed number of levels. The OMT technique reduces the number of memory accesses required for identifying LPM matches and is fast and memory efficient.
    Type: Application
    Filed: March 15, 2002
    Publication date: September 18, 2003
    Inventors: Boris Zabarski, Vadim Pasternak