Patents by Inventor Andrew H. Richter

Andrew H. Richter 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: 20150106663
    Abstract: Systems and methods for labeling text with alphanumeric identifiers are included. A logging string that includes a block of output text may be determined during program code execution. A computing device may generate a first alphanumeric identifier for the logging string using a hashing algorithm. The computing device may remove a portion of the logging string to determine a modified string. The computing device may generate a second alphanumeric identifier for the modified string using the hashing algorithm. The first alphanumeric identifier and the second alphanumeric identifier are presented with the logging string.
    Type: Application
    Filed: March 13, 2014
    Publication date: April 16, 2015
    Applicant: SAS Institute Inc.
    Inventor: Andrew H. Richter
  • Patent number: 8510360
    Abstract: Techniques are disclosed for calculating large precision common logarithms. A common logarithm may be calculated using addition and/or subtraction of known logarithm values. Embodiments of the invention permit calculation of common logarithms of real numbers stored within character arrays, where each element of the array corresponds to a digit in the real number.
    Type: Grant
    Filed: June 4, 2010
    Date of Patent: August 13, 2013
    Assignee: International Business Machines Corporation
    Inventors: Paul Anderson, Andrew H. Richter, Grace A. Richter
  • Patent number: 8200812
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to workload management of backend systems and provide a novel and non-obvious method, system and computer program product for limiting a request rate from a client based on a health state of a server system. In one embodiment of the invention, a computer-implemented method for limiting a request rate from a client based on a health state of a server system that includes monitoring a server system, determining a measure of health of the server system, sending the determined measure of health to a client submitting a request to the server system and receiving a subsequent request from the client that is delayed by a time period, wherein the time period is based at least in part upon the determined measure of health.
    Type: Grant
    Filed: December 31, 2009
    Date of Patent: June 12, 2012
    Assignee: International Business Machines Corporation
    Inventors: Paul Anderson, Wim De Pauw, Rohit D. Kelapure, Andrew H. Richter
  • Publication number: 20110302229
    Abstract: Techniques are disclosed for calculating large precision common logarithms. A common logarithm may be calculated using addition and/or subtraction of known logarithm values. Embodiments of the invention permit calculation of common logarithms of real numbers stored within character arrays, where each element of the array corresponds to a digit in the real number.
    Type: Application
    Filed: June 4, 2010
    Publication date: December 8, 2011
    Applicant: International Business Machines Corporation
    Inventors: Paul Anderson, Andrew H. Richter, Grace A. Richter
  • Publication number: 20110161488
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to workload management of backend systems and provide a novel and non-obvious method, system and computer program product for limiting a request rate from a client based on a health state of a server system. In one embodiment of the invention, a computer-implemented method for limiting a request rate from a client based on a health state of a server system that includes monitoring a server system, determining a measure of health of the server system, sending the determined measure of health to a client submitting a request to the server system and receiving a subsequent request from the client that is delayed by a time period, wherein the time period is based at least in part upon the determined measure of health.
    Type: Application
    Filed: December 31, 2009
    Publication date: June 30, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Paul Anderson, Wim De Pauw, Rohit D. Kelapure, Andrew H. Richter
  • Patent number: 7924873
    Abstract: A method for enabling connectivity for protocol aware applications across different network topologies can include receiving frames passing between a first network having a first network topology and a second network having a second network topology; inspecting an incoming one of the frames to identify a remote resource in the second network and a device identifier corresponding to the remote resource, and an outgoing one of the frames to identify a socket assigned to a local resource in the first network and a device identifier for the local resource corresponding to the socket; and, transmitting data from a protocol-aware application in the first network to the remote resource in the second network in a protocol consistent with the second network topology, and further transmitting data from the remote resource in the second network to the protocol-aware application in the first network in a protocol consistent with the first network topology.
    Type: Grant
    Filed: July 26, 2005
    Date of Patent: April 12, 2011
    Assignee: International Business Machines Corporation
    Inventors: Andrew H. Richter, Belinda L. Thompson
  • Patent number: 6430622
    Abstract: Methods, systems and computer program products are provided for transferring a Virtual IP Address (VIPA) from a first application instance to a second application instance executing on a cluster of data processing systems having a plurality of communication protocol stacks. A list of dynamic VIPAs is distributed among the protocol stacks and a hierarchy of backup communication protocol stacks for the dynamic VIPAs is determined based on the list of dynamic VIPAs. Upon receiving notification of failure of the first stack the second stack evaluates the hierarchy of backup stacks to determine if it is the next stack in the hierarchy for the VIPA associated with the first application instance. If so, then the VIPA associated with the first application instance is transferred to the second communication protocol stack associated with the second application instance.
    Type: Grant
    Filed: September 22, 1999
    Date of Patent: August 6, 2002
    Assignee: International Business Machines Corporation
    Inventors: John Andrew Aiken, Jr., Michael Edward Baskey, James L. Hall, Dilip Dinkar Kandlur, Andrew H. Richter