Patents by Inventor Barton Vashaw

Barton Vashaw 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: 20070086350
    Abstract: The present invention provides a method, system, and computer program product for failure detection with minimal bandwidth usage. A method for failure detection in a multi-node system in accordance with an embodiment of the present invention includes the steps of associating all connections between a first node and a second node with a last receipt value and a maximum idle value, calculating a difference between the last receipt value and a current time, and establishing a heartbeat connection from the first node to the second node if the difference between the last receipt value and the current time exceeds the maximum idle value. A heartbeat process is then initiated over the heartbeat connection to determine the condition of the second node.
    Type: Application
    Filed: October 13, 2005
    Publication date: April 19, 2007
    Applicant: International Business Machines Corporation
    Inventors: Marc Haberkorn, Gennaro Cuomo, Thomas Gissel, Barton Vashaw
  • Publication number: 20060082592
    Abstract: The inventive process comprises and improved process for displaying hierarchical information in a treemap by associating a different color with each nested treemap in a parent treemap, and generating a gradient for each color to preserve the representative value of varying shades. In general, a user divides the hierarchical information into clusters of nodes, designates a primary weight and a secondary weight for each cluster, and designates a base color for each cluster. The inventive process then divides the range of each cluster's secondary weight into bins, adjusts each cluster's base color to create a distinguishing gradient of the base color, assigns a distinguishing gradient to each bin, and draws a nested treemap for each cluster so that each nested treemap has a cluster's base color and each node in the cluster is represented by a bounding box having a distinct gradient of the cluster's base color.
    Type: Application
    Filed: October 19, 2004
    Publication date: April 20, 2006
    Applicant: International Business Machines Corporation
    Inventors: Elizabeth Black-Ziegelbein, Gennaro Cuomo, Marc Haberkorn, Barton Vashaw
  • Publication number: 20060085541
    Abstract: A system and method are disclosed for leveraging bandwidth and processor utilization to advantageously influence response time performance. The objective of such leveraging is to maximize transaction throughput (e.g., requests per second) between a pair of servers when the servers are connected through less than optimal networks and/or network connections. Such an optimization is accomplished by determining whether or not adjusting request and/or reply sizes by applying a compression factor (i.e., to facilitate compression) will have a desirable influence on response time performance. Such determination is based on decision criteria including, but are not limited to, network protocol performance, CPU utilization, bandwidth utilization, and estimates of the CPU time and network time costs of sending compressed verses uncompressed data.
    Type: Application
    Filed: October 19, 2004
    Publication date: April 20, 2006
    Applicant: International Business Machines Corporation
    Inventors: Gennaro Cuomo, Thomas Gissel, Harvey Gunther, Barton Vashaw