Patrick W Mccarthy

US Patent:

7181580, Feb 20, 2007

Filed:

Mar 27, 2003

Appl. No.:

10/401252

Inventors:

Kevin J. Erickson - Rochester MN, US
Richard K. Kirkman - Rochester MN, US
Patrick J. McCarthy - Rochester MN, US
Scott A. Plaetzer - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/00
G06F 13/00

US Classification:

711156, 711203, 711206

Abstract:

A method, apparatus, system, and signal-bearing medium that in an embodiment map a pointer to a target indirectly via a pointer map. In an embodiment, the pointer map is stored in a reserved area and an entry for the pointer in the pointer map includes a back-pointer containing an address of the pointer and a target-address containing the address of the target. When the pointer is accessed, the pointer is checked to ensure its contents point at the entry in the pointer map in the reserved area and that the back-pointer in the pointer map entry points back at the pointer. In this way, pointers are protected from being modified illegitimately.

US Patent:

7334230, Feb 19, 2008

Filed:

Mar 31, 2003

Appl. No.:

10/403150

Inventors:

Lynn Keat Chung - Rochester MN, US
Christopher Francois - Apple Valley MN, US
Richard Karl Kirkman - Rochester MN, US
Henry Joseph May - Mantorville MN, US
Patrick Joseph McCarthy - Rochester MN, US
Don Darrell Reed - Mantorville MN, US
Kenneth Charles Vossen - Mantorville MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/46

US Classification:

718104

Abstract:

An apparatus, program product and method in which application program-specified resource allocation and allocation strength preferences are used to allocate hardware resources from a computer for that application program. The resource allocation preference is used to allocate hardware resources for the application program, while the allocation strength preference is used to determine whether to allocate alternate hardware resources when the resource allocation preference specified by the application program cannot be met.

US Patent:

7356655, Apr 8, 2008

Filed:

May 15, 2003

Appl. No.:

10/438393

Inventors:

Kenneth Roger Allen - Rochester MN, US
Richard Karl Kirkman - Rochester MN, US
Patrick Joseph McCarthy - Rochester MN, US
Wade Byron Ouren - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/00

US Classification:

711153, 707205, 711170, 718104

Abstract:

Methods, systems, and media for managing dynamic memory are disclosed. Embodiments may disclose identifying nodes with having memory for dynamic storage, and reserving a portion of the memory from the identified nodes for a heap pool. After generating a heap pool, embodiments may allocate dynamic storage from the heap pool to tasks received that are associated with one of the identified nodes. More specifically, embodiments identify the node or home node associated with the task, the amount of dynamic storage requested by the task, and create a heap object in the node associated with the task to provide the requested dynamic storage. Some embodiments involve de-allocating the dynamic storage assigned to the task upon receipt of an indication that the task is complete and the dynamic storage is no longer needed for the task. Several of such embodiments return the de-allocated dynamic storage to the heap pool for reuse.

US Patent:

7498558, Mar 3, 2009

Filed:

Aug 18, 2005

Appl. No.:

11/206980

Inventors:

Scott W. Sparrold - Vail AZ, US
Patrick L. McCarthy - Tucson AZ, US
Richard C. Juergens - Tucson AZ, US

Assignee:

Raytheon Company - Waltham MA

International Classification:

H01J 3/14

US Classification:

250216, 359741, 359743

Abstract:

The disclosed system, device and method for spatial homogenization and focusing of electromagnetic radiation over an aperture to reduce the effects of atmospheric scintillation generally includes an optical lens having an at least partially undulating pattern mapped onto a curvilinear surface. Disclosed features and specifications may be variously controlled, adapted or otherwise optionally modified to eliminate or otherwise reduce the effects of atmospheric scintillation as well as other optical aberrations. Exemplary embodiments of the present invention generally provide improved systems and methods for the acquisition, tracking and engagement of military targets with missiles or other guided ordinance.

US Patent:

7512836, Mar 31, 2009

Filed:

Dec 11, 2006

Appl. No.:

11/608891

Inventors:

David L. Darrington - Rochester MN, US
Patrick Joseph McCarthy - Rochester MN, US
Amanda Peters - Rochester MN, US
Albert Sidelnik - St. Paul MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 11/20

US Classification:

714 13, 712 32, 714 7

Abstract:

A method and apparatus for fast backup of a set of compute nodes to save the state of the software in a parallel computer system. A fast backup mechanism in the service node of the computer system configures a set of nodes to be used for a backup and when needed uses the network hardware to perform a fast backup from node to node from an original set of nodes to the backup set of nodes. In the preferred embodiments a the fast backup is done with respect to a midplane or rack of nodes copied to a backup rack of nodes.

US Patent:

7552312, Jun 23, 2009

Filed:

Feb 9, 2007

Appl. No.:

11/672989

Inventors:

Charles J. Archer - Rochester MN, US
Camesha R. Hardwick - Fayetteville NC, US
Patrick J. McCarthy - Rochester MN, US
Brian P. Wallenfelt - Eden Prairie MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/16

US Classification:

712 32, 712 10, 719313

Abstract:

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

US Patent:

7574708, Aug 11, 2009

Filed:

Mar 4, 2004

Appl. No.:

10/793476

Inventors:

Lynn Keat Chung - Rochester MN, US
Christopher Francois - Apple Valley MN, US
Richard Karl Kirkman - Rochester MN, US
Patrick Joseph McCarthy - Rochester MN, US
Don Darrell Reed - Mantorville MN, US
Kenneth Charles Vossen - Mantorville MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/46

US Classification:

718104, 718105

Abstract:

Disclosed is an apparatus, method, and program product that enables distribution of operating system resources on a nodal basis in the same proportions as the expected system workload. The preferred embodiment of the present invention accomplishes this by assigning various types of weights to each node to represent their proportion of the overall balance within the system. Target Weights represent the desired distribution of the workload based on the existing proportions of processor and memory resources on each node. The actual workload balance on the system is represented by Current Weights, which the operating system strives to keep as close to the Target Weights as possible, on an ongoing basis. When the system is started, operating system services distribute their resources nodally in the same proportions as the Target Weights, and can request to be notified if the Target Weights ever change. If processors and/or memory are subsequently added or removed, new Target Weights are calculated at that time, and all services which requested notification are notified so they can redistribute their resources according to the new Target Weights or a stepwise refinement thereof.

US Patent:

7631169, Dec 8, 2009

Filed:

Feb 2, 2007

Appl. No.:

11/670803

Inventors:

David L. Darrington - Rochester MN, US
Patrick Joseph McCarthy - Rochester MN, US
Amanda Peters - Rochester MN, US
Albert Sidelnik - St. Paul MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 11/07

US Classification:

712220

Abstract:

A method and apparatus for fault recovery of on a parallel computer system from a soft failure without ending an executing job on a partition of nodes. In preferred embodiments a failed hardware recovery mechanism on a service node uses a heartbeat monitor to determine when a node failure occurs. Where possible, the failed node is reset and re-loaded with software without ending the software job being executed by the partition containing the failed node.