Patents by Inventor Anton Malakhov

Anton Malakhov 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).

  • Performing concurrent rehashing of a hash table for multithreaded applications
    Patent number: 9563477
    Abstract: In one embodiment, the present invention includes a method for allocating a second number of buckets for a hash table shared concurrently by a plurality of threads, where the second number of buckets are logically mapped onto a corresponding parent one of the first number of buckets, and publishing an updated capacity of the hash table to complete the allocation, without performing any rehashing, such that the rehashing can later be performed in an on-demand, per bucket basis. Other embodiments are described and claimed.
    Type: Grant
    Filed: April 8, 2009
    Date of Patent: February 7, 2017
    Assignee: Intel Corporation
    Inventor: Anton Malakhov
  • Method and system for work partitioning between processors with work demand feedback
    Patent number: 9262230
    Abstract: A method according to one embodiment includes the operations of loading binary code comprising a top level task into memory on a first processor, the top level task having an associated range; determining if the top level task is divisible into a plurality of sub-tasks based on the range; for each of the sub-tasks, determining if a given sub-task is divisible into a plurality of sub-sub-tasks; and if the given sub-task is indivisible, executing the given sub-task; otherwise, if the given sub-task is divisible, dividing the given sub-task into the plurality of sub-sub-tasks.
    Type: Grant
    Filed: August 5, 2011
    Date of Patent: February 16, 2016
    Assignee: Intel Corporation
    Inventors: Anton Malakhov, Alexey Kukanov
  • METHOD AND SYSTEM FOR WORK PARTITIONING BETWEEN PROCESSORS WITH WORK DEMAND FEEDBACK
    Publication number: 20150026698
    Abstract: A method according to one embodiment includes the operations of loading binary code comprising a top level task into memory on a first processor, the top level task having an associated range; determining if the top level task is divisible into a plurality of sub-tasks based on the range; for each of the sub-tasks, determining if a given sub-task is divisible into a plurality of sub-sub-tasks; and if the given sub-task is indivisible, executing the given sub-task; otherwise, if the given sub-task is divisible, dividing the given sub-task into the plurality of sub-sub-tasks.
    Type: Application
    Filed: August 5, 2011
    Publication date: January 22, 2015
    Inventors: Anton Malakhov, Alexey Kukanov
  • PERFORMING CONCURRENT REHASHING OF A HASH TABLE FOR MULTITHREADED APPLICATIONS
    Publication number: 20120036134
    Abstract: In one embodiment, the present invention includes a method for allocating a second number of buckets for a hash table shared concurrently by a plurality of threads, where the second number of buckets are logically mapped onto a corresponding parent one of the first number of buckets, and publishing an updated capacity of the hash table to complete the allocation, without performing any rehashing, such that the rehashing can later be performed in an on-demand, per bucket basis. Other embodiments are described and claimed.
    Type: Application
    Filed: April 8, 2009
    Publication date: February 9, 2012
    Applicant: INTEL CORPORATION
    Inventor: Anton Malakhov