MARC EDWARD HABERKORN
Pilots at Stonechase Dr, Raleigh, NC

2007002, Jan 25, 2007

Jul 19, 2005

11/184500

Marc Haberkorn - Raleigh NC, US
Brian Martin - Cary NC, US
William Newport - Rochester MN, US

International Business Machines Corporation - Armonk NY

G06F 15/16

709230000

Method and apparatus, in a data processing system that uses JMX as a mechanism for managing internal components, for processing JMX requests to a managed group that includes a plurality of group members. When a JMX request is transmitted to a first member of a group comprising a plurality of group members, a determination is made if the first member is in an active state capable of processing the request. If the first member is not in an active state, the JMX request is forwarded to a currently active member of the plurality of members for processing the request. The invention thus permits users to communicate with the group via JMX without knowing which member of the group is active at any particular time.

2009032, Dec 31, 2009

Jun 25, 2008

12/146006

Madhu K. Chetuparambil - Raleigh NC, US
Marc E. Haberkorn - Raleigh NC, US
Todd E. Kaplinger - Raleigh NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY

H04L 9/32, G06N 5/02

726 4, 706 48

A solution for controlling access to Uniform Resource Identifier (URI) identified resources can receive a request for a resource identified by a URI. The URI associated with the request can be compared against at least one previously established security rule. The security rule can include an exclusion comparison operator and a regular expression defining a pattern. A determination as to whether to grant a requester access to the resource can be based at least in part upon results of the comparing of the URI against the previously established security rule.

2009007, Mar 12, 2009

Sep 6, 2007

11/851164

THOMAS R. GISSEL - Apex NC, US
Marc E. Haberkorn - Raleigh NC, US
Sai G. Rathnam - Raleigh NC, US

G06F 9/54

719330

A method, system and computer program product for decoupling components of a software system at load/compile time to accelerate application startup times. In particular, a software components partitioning (SCP) utility pre-defines a number of (implementation) classes to initiate and facilitate the decoupling process. The SCP utility allows the method names and argument lists to be recorded from a remote interface into a local interface which emulates the remote interface. The local interface is augmented with an annotation to define the remote interface. Additionally, a pre-defined keyword is appended to the name of the local interface to enable the creation of a (pre-defined) classname. Furthermore, when the classname is loaded, an implementation (via a Java implementation class, for example) for the remote class is loaded, and the implementation is associated with a dynamic proxy that implements both the local and remote interfaces, on demand.

2008029, Nov 27, 2008

May 22, 2007

11/752019

THOMAS R. GISSEL - Apex NC, US
Marc Edward Haberkorn - Raleigh NC, US
Viswanath Srikanth - Chapel Hill NC, US

G06F 9/50

718104

A method for improving the availability characteristics of a constant throughput system that generates scores for multiple resources within multiple nodes in a software stack during a full stack update is disclosed. Each score includes at least a first weighted portion corresponding to a cost of bringing a resource offline, and a second weighted portion corresponding to a cost of re-routing service requests around the resource. An operating system (OS) selects a first node that has a lowest total score, re-routes service requests away from the resources of the first node, and brings the first node offline. The OS updates software of the resources in the first node with minimal disruption and brings the first node back online. The OS re-calculates the scores for the resources, and the OS selects a second node that has a new lowest total score. The OS repeats the process until all nodes are updated.

2007008, Apr 19, 2007

Oct 13, 2005

11/249536

Marc Haberkorn - Raleigh NC, US
Gennaro Cuomo - Durham NC, US
Thomas Gissel - Apex NC, US
Barton Vashaw - Apex NC, US

International Business Machines Corporation - Armonk NY

H04J 3/14

370242000

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.

2006008, Apr 20, 2006

Oct 19, 2004

10/968235

Elizabeth Black-Ziegelbein - Austin TX, US
Gennaro Cuomo - Cary NC, US
Marc Haberkorn - Raleigh NC, US
Barton Vashaw - Apex NC, US

International Business Machines Corporation - Armonk NY

G09G 5/02

345605000

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.

2011013, Jun 9, 2011

Dec 7, 2009

12/632427

Barton C. Vashaw - Apex NC, US
Brian K. Martin - Cary NC, US
Marc E. Haberkorn - Raleigh NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 15/173

709229

A system and method of constructing cluster views may involve determining that a process such as an application server process having an IP address is stopped. Another IP address may be assigned to the process in response to determining that the process is stopped, wherein the other IP address is dedicated to processes that are stopped. If a connection request for the process is received at the other IP address, the connection request may be actively refused. The active refusal may significantly reduce the amount of time required to generate cluster views.