James R Curtis

US Patent:

6795832, Sep 21, 2004

Filed:

Oct 9, 2001

Appl. No.:

09/971581

Inventors:

James R. Curtis - Placerville CA
Eric R Soderberg - Mountain View CA
Jonathan Patrizio - San Francisco CA
Morris Lee - Sunnyvale CA

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 1730

US Classification:

707203, 707 3, 707 4, 707 5, 707 10, 709201, 709217, 709218, 709219

Abstract:

A rule based compatibility module provides a single unified mechanism for testing rules where testing results depend on various combinations of database queries, computable values, and/or run-string parameters. The testing results may be evaluated within a particular operational environment. The rule based compatibility module encapsulates all versions of compatibility issues, which are highly dependant on the operational context, into one simple mechanism, thereby reducing risks of unexpected behaviors caused by improper or incomplete handling of compatibility issues. In addition, the rule based compatibility module provides a simple mechanism for handling ad-hoc run-string switches used for debugging, or for optional enabling or disabling of features under development.

US Patent:

6892378, May 10, 2005

Filed:

Sep 17, 2001

Appl. No.:

09/953276

Inventors:

James R. Curtis - Placerville CA, US
Eric Hwang - Saratoga CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F009/44

US Classification:

717127, 717162

Abstract:

A method for detecting memory leakage of a linked list in a running program, includes saving current size of the linked list as a new maximum size of the linked list when a new element is added to the linked list that causes the current size of the linked list to exceed a former maximum size of the linked list, determining whether a first pre-determined period of time has elapsed from when the liked list was created, and determining whether the new maximum size of the linked list exceeds the former maximum size of the linked list during a second pre-determined period of time.

US Patent:

6966010, Nov 15, 2005

Filed:

Aug 31, 2001

Appl. No.:

09/942911

Inventors:

James R. Curtis - Placerville CA, US
Eric M. Soderberg - Mountain View CA, US
James M. Nissen - Cupertino CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F011/00

US Classification:

714 4

Abstract:

The present invention provides a process for providing High Availability applications on a Cluster without utilizing a fail-over mechanism. The process utilizes a first instantiation of a Package containing information needed to implement an application on a first Node of a Cluster. Additionally, the process utilizes a second instantiation of the Package on at least one second Node of the Cluster. Upon detection of a fault condition or possible fault condition in an application, a Cluster management system transfers operation of the application from the first Node to the second Node. The second Node utilizing the second instantiation of the Package to immediately implement the application without requiring the Cluster management system to fail-over the application.

US Patent:

7047299, May 16, 2006

Filed:

Aug 31, 2001

Appl. No.:

09/942910

Inventors:

James R. Curtis - Placerville CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173

US Classification:

709225, 709226, 709223, 709238

Abstract:

The present invention provides a process for implementing a generic Cluster wide lock broker that enables Clients attached to a Node on the Cluster to determine whether a lock can be established on a Resource and whether conflicting active locks are already held by another Peer Node. The process utilizes lock request that include a lock name identifying the desired Resource. Each lock request is compared by a lock broker daemon resident on each Node of the Cluster against a Lock Broker Table identifying active locks currently held by any client associated with each specific Peer Node. Additionally, the process enables the use and creation of customized locks by utilizing intent modes, which designate how a Client desires to utilize a Resource, and deny modes, which designate how a Client desires to prevent other Clients from utilizing a Resource. Further, lock requests initially denied because an active lock exists for the desired Resource can be placed in a wait state and re-requested upon releasing of the active lock.

US Patent:

7069321, Jun 27, 2006

Filed:

Aug 31, 2001

Appl. No.:

09/942909

Inventors:

James R. Curtis - Placerville CA, US
Eric M. Soderberg - Mountain View CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173

US Classification:

709225, 709223, 719313, 719316

Abstract:

A system and a process is provided for requesting and obtaining information about Resources on a Cluster. The system utilizes a Multiplex Provider, that may be provided on every Node of the Cluster. The Multiplex Provider facilitates the communication of requests to various Nodes without requiring Providers, at such Nodes, to be Cluster-aware and without requiring a Client to directly communicate the request to every Node. The present invention also includes a scope, specifying a range for which any request may be applied. The scope may be determined utilizing a discovery process, wherein each Node on a Cluster identifies the Providers and Resources associated with the Node. The process also entails capturing the results of a request for information in a tabular format. The tabulation may be specified to include all results of the query, unique results of the query and/or based upon any other desired tabulation.

US Patent:

8135849, Mar 13, 2012

Filed:

Jul 31, 2007

Appl. No.:

11/831756

Inventors:

James R Curtis - Placerville CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/16

US Classification:

709228, 709229, 726 21

Abstract:

A computer system comprises a server that serves a plurality of clients and performs client authentication and authorization during client login to the server using file system permissions specified for domain sockets. The server creates a domain socket file for individual users during initialization which sets permissions enabling user access to the domain socket file, monitors file descriptors for received connection requests from client processes, and either opens a requesting client process with permission-enabled user access or denies access to an unauthorized client process.

US Patent:

8171349, May 1, 2012

Filed:

Jun 18, 2010

Appl. No.:

12/818582

Inventors:

Richard Mark Stern - Saratoga CA, US
James R. Curtis - Placerville CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 11/00

US Classification:

714 471, 714 41, 714 411, 714 412

Abstract:

A virtual machine is migrated from a source physical machine to a target physical machine, where the virtual machine has an executable service and a monitoring agent for monitoring the executable service. In response to the migrating, a monitoring manager is started that issues a command to start the executable service. It is determined whether the command is for the executable service that is already running in the migrated virtual machine. In response to such determining, the started monitoring manager is associated with the already running executable service, where the monitoring manager cooperates with the monitoring agent to detect fault of the executable service.

US Patent:

8230001, Jul 24, 2012

Filed:

May 28, 2004

Appl. No.:

10/856330

Inventors:

James R. Curtis - Placerville CA, US
Eric Soderberg - Mountain View CA, US
Morris Lee - Sunnyvale CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/16

US Classification:

709203

Abstract:

Methods and systems for providing information a client requested about a system using scripts are described. In one embodiment, one or more scripts request information about a computer system. A translator receives the information about the system from the scripts. The translator stores the information about the system in readily accessible data structures.