Ronald Maurice Hill

US Patent:

6958118, Oct 25, 2005

Filed:

Aug 27, 2002

Appl. No.:

10/229680

Inventors:

Ronald G. Hill - Chandler AZ, US
John Johnson - Tempe AZ, US
Michael Wheat - Tempe AZ, US

Assignee:

MAAX, Inc. - Montreal

International Classification:

B01D036/02

US Classification:

210108, 210138, 210169, 210332, 21033301, 210411, 2101951

Abstract:

A self-cleaning water filtration system includes a pre-filter to filter oils and relatively medium sized particles in a water flow, a multi-stage filter to purify and provide a second level of filtration to the water flow, and a self-cleaning filter to provide a third level of filtration to the water flow. Water flow through the filter media of the self-cleaning filter is redirected to flush waste to a containment-tank filter. The self-cleaning filter has a purge output, which may spray the pre-filter to substantially remove particles from the pre-filter for collection in the containment tank. The multi-stage filter may have at least two layers of filter media. The pre-filter may be disposable and comprised of a mineral sanitizer positioned between two layers of an oil absorbing fabric.

US Patent:

20020053008, May 2, 2002

Filed:

May 3, 2001

Appl. No.:

09/847415

Inventors:

Brian Goodman - Tucson AZ, US
Ronald Hill - Tucson AZ, US
Leonard Jesionowski - Tucson AZ, US
Timothy Pierce - Tucson AZ, US
Robin Roberts - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

G06F012/16

US Classification:

711/162000

Abstract:

Verification of a primary or backup copy of vital information of a processing system employs a pseudo-fixed reference identifier, defined as an identifier unlikely to change over the life of the system, and controls which copy of vital information is correct. The primary copy of vital information is associated with a copy of the pseudo-fixed reference identifier and a backup copy of the vital information is associated with a copy of the pseudo-fixed reference identifier. A processor, when triggered, reads the pseudo-fixed reference identifier, compares it to the stored copies of the identifier of the primary and backup non-volatile storage. () If the read pseudo-fixed reference identifier matches the primary copy of the identifier, the processor indicates the vital information is valid. () If the read pseudo-fixed reference identifier matches the backup only, indicating that the backup copy of vital information is to be restore copied to become the primary copy.

US Patent:

20020091919, Jul 11, 2002

Filed:

Jan 5, 2001

Appl. No.:

09/755814

Inventors:

Brian Goodman - Tucson AZ, US
Ronald Hill - Tucson AZ, US
Leonard Jesionowski - Tucson AZ, US
Robin Roberts - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

G06F015/177
G06F009/00
G06F009/24

US Classification:

713/002000

Abstract:

Provided is a method, system, and program for method, system, and program for selecting a code image to execute. Multiple copies of a code image are maintained in a non-volatile memory device. A first operation routine is executed. A first counter is incremented if the first operation routine succeeds. A second operation routine is executed and a second counter is incremented if the second operation routine succeeds. The first and second counters are used to select one of the code images from the memory device to execute.

US Patent:

20020097720, Jul 25, 2002

Filed:

Jan 5, 2001

Appl. No.:

09/755405

Inventors:

Brian Goodman - Tuscon AZ, US
Ronald Hill - Tucson AZ, US
Leonard Jesionowski - Tucson AZ, US
Michael McIntosh - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

H04L012/56
G06F015/173
H04L012/28

US Classification:

370/392000, 709/238000

Abstract:

Provided is a method, system, and program for allowing communication among nodes in a system. A request is received in a source node from a source object executing in the source node to send a message to a destination object executing in a destination node. Each node includes a processor capable of multitasking multiple program objects and a communication interface to transmit and receive data with the other nodes. A determination is made in the source node as to whether the destination node and source node are a same node. The message is sent in the source node to the destination object within the source node if the destination node is the source node. If the destination node is not the source node, then the source node transmits the message to the destination node through the communication interface. The destination node sends the message to the destination object within the destination node.

US Patent:

20020199077, Dec 26, 2002

Filed:

Jun 11, 2001

Appl. No.:

09/878469

Inventors:

Brian Goodman - Tucson AZ, US
Ronald Hill - Tucson AZ, US
Timothy Pierce - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

G06F012/00

US Classification:

711/202000

Abstract:

A method to partition a data storage and retrieval system into one or more logical libraries, where that data storage and retrieval system includes a library controller, one or more data storage drives and one or more control ports. A data storage and retrieval system which includes a computer useable medium having computer readable program code disposed therein to implement Applicants' method to partition the data storage and retrieval system into one or more logical libraries. A computer program product usable with a programmable computer processor having computer readable program code embodied therein for partitioning Applicants' data storage and retrieval system into one or more logical libraries.

US Patent:

20030070053, Apr 10, 2003

Filed:

Oct 5, 2001

Appl. No.:

09/970933

Inventors:

Frank David Gallo - Rogers AR, US
Brian Gerard Goodman - Tucson AZ, US
Ronald Faye Hill - Tucson AZ, US
Roberta Lee Winston - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

G06F013/00

US Classification:

711/170000

Abstract:

Drives of a data storage library are concurrently configured. A processor transmits library configuration data separately to each drive, initializes a first configuration process state, with a time-out period, for each drive. A drive responds with a status response, the first process state is updated to “completed”. A request for drive unique information is transmitted to the responding drive, advancing the process to a second state, with a time-out period. A drive responds with the information, and the second process state is updated to “completed”, and the received information is stored.

US Patent:

20030233430, Dec 18, 2003

Filed:

Jun 13, 2002

Appl. No.:

10/171179

Inventors:

Ronald Hill - Tucson AZ, US
Ralph Jackson - Tucson AZ, US
Kevin Schwartz - Tucson AZ, US
Jennifer Somers - Tucson AZ, US
Bryan Wright - Tucson AZ, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F015/173

US Classification:

709/221000, 345/735000

Abstract:

A method for modifying a logical library configuration from a remote management application which reduces the number of separate UI display panels a user has to view, and also reduces the number of pages requested from the server. A single UI display panel displays a configuration of all logical libraries of a similar media type in the single display panel. The configuration of all logical libraries of a similar media type can be modified within a configuration range, wherein a modification of one logical library results in the display panel displaying the effects of the modification on other defined logical libraries. For each separate logical library, the single UI display panel displays its allocated number of drives, its allocated number of storage slots, and its allocated number of control ports. The validity of a selected configuration is checked by automatically adjusting the hardware allocation of other effected libraries whenever the configuration of one logical library is changed.

US Patent:

20040010568, Jan 15, 2004

Filed:

Jun 26, 2002

Appl. No.:

10/179186

Inventors:

Brian Goodman - Tucson AZ, US
Ronald Hill - Tucson AZ, US
Leonard Jesionowski - Tucson AZ, US
Raymond Yardy - Tucson AZ, US

Assignee:

International Business Machines Corporation

International Classification:

G06F015/177
G06F011/00

US Classification:

709/220000, 714/004000, 709/224000

Abstract:

Addressing failure is handled in a nodal system of processor nodes, which comprise at least one processor and at least one interface to a network. Upon detection of a node address failure of a processor node for the network, such as lack of a node address, or presence of a duplicate address, the processor node is disabled from the network, thereby temporarily failing the processor node so that the system remains operational. An alternate node address stored in nonvolatile memory may be selected that avoids the node address failure.