Patents by Inventor Olga Golovanevsky

Olga Golovanevsky 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).

  • Patent number: 8756580
    Abstract: Dynamic determination of affinity between fields of structure may be determined based on accesses to the same instance. The affinity may be utilized in determining a data layout of a structure so as to optimize performance of a target program. The affinity determination may be an estimation based upon a trace of an execution of the target program. Access relation between proximate accesses to fields of the same instance may be utilized to estimate an optimized data layout of the structure.
    Type: Grant
    Filed: March 23, 2010
    Date of Patent: June 17, 2014
    Assignee: International Business Machines Corporation
    Inventors: Alon Dayan, David Joel Edelsohm, Olga Golovanevsky, Ayal Zaks
  • Patent number: 8359291
    Abstract: A data layout optimization may utilize affinity estimation between pairs of fields of a record in a computer program. The affinity estimation may be determined based on a trace of an execution and in view of actual processing entities performing each access to the fields. The disclosed subject matter may be configured to be aware of a specific architecture of a target computer having a plurality of processing entities, executing the program so as to provide an improved affinity estimation which may take into account both false sharing issues, spatial locality improvement and the like.
    Type: Grant
    Filed: June 8, 2010
    Date of Patent: January 22, 2013
    Assignee: International Business Machines Corporation
    Inventors: Alon Dayan, David Joel Edelsohn, Olga Golovanevsky, Ayal Zaks
  • Publication number: 20110302561
    Abstract: A data layout optimization may utilize affinity estimation between paris of fields of a record in a computer program. The affinity estimation may be determined based on a trace of an execution and in view of actual processing entities performing each access to the fields. The disclosed subject matter may be configured to be aware of a specific architecture of a target computer having a plurality of processing entities, executing the program so as to provide an improved affinity estimation which may take into account both false sharing issues, spatial locality improvement and the like.
    Type: Application
    Filed: June 8, 2010
    Publication date: December 8, 2011
    Applicant: International Business Machines Corporation
    Inventors: Alon Dayan, David Joel Edelsohn, Olga Golovanevsky, Ayal Zaks
  • Publication number: 20110239197
    Abstract: Dynamic determination of affinity between fields of structure may be determined based on accesses to the same instance. The affinity may be utilized in determining a data layout of a structure so as to optimize performance of a target program. The affinity determination may be an estimation based upon a trace of an execution of the target program. Access relation between proximate accesses to fields of the same instance may be utilized to estimate an optimized data layout of the structure.
    Type: Application
    Filed: March 23, 2010
    Publication date: September 29, 2011
    Applicant: International Business Machines Corporation
    Inventors: Alon Dayan, David Joel Edelsohn, Olga Golovanevsky, Ayal Zaks
  • Patent number: 6917946
    Abstract: A method and system for storing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules uses at least one range of values in at least one dimension. The method and system include separating a portion of the plurality of filter rules into a plurality of pure subsets of filter rules. Each of the plurality of pure subsets of filter rules includes at least one of the plurality of filter rules. The method and system also include combining a portion of the plurality of pure subsets of filter rules to provide a combined subset and determining whether an efficiency of utilizing the plurality of filter rules is improved by combining the portion of the plurality of pure subsets of filter rules. The method and system further includes storing the plurality of filter rules including storing the portion of the plurality of subsets of filter rules as the combined subset if the efficiency of searching the plurality of filter rules is improved.
    Type: Grant
    Filed: August 12, 2002
    Date of Patent: July 12, 2005
    Assignee: International Business Machines Corporation
    Inventors: Everett Arthur Corl, Jr., Olga Golovanevsky, Clark Debs Jeffries, Robert Franklin Kantner, Jr., Randall William Worzella, Avraham Zehavi
  • Publication number: 20040030424
    Abstract: A method and system for storing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules uses at least one range of values in at least one dimension. The method and system include separating a portion of the plurality of filter rules into a plurality of pure subsets of filter rules. Each of the plurality of pure subsets of filter rules includes at least one of the plurality of filter rules. The method and system also include combining a portion of the plurality of pure subsets of filter rules to provide a combined subset and determining whether an efficiency of utilizing the plurality of filter rules is improved by combining the portion of the plurality of pure subsets of filter rules. The method and system further includes storing the plurality of filter rules including storing the portion of the plurality of subsets of filter rules as the combined subset if the efficiency of searching the plurality of filter rules is improved.
    Type: Application
    Filed: August 12, 2002
    Publication date: February 12, 2004
    Applicant: International Business Machines Corporation
    Inventors: Everett Arthur Corl, Olga Golovanevsky, Clark Debs Jeffries, Robert Franklin Kantner, Randall William Worzella, Avraham Zehavi