Eric B Potter

US Patent:

7152026, Dec 19, 2006

Filed:

Dec 7, 2001

Appl. No.:

10/020723

Inventors:

John Earl Merritt - Torrance CA, US
Donald Raymond Pederson - San Diego CA, US
Eric Thomas Potter - Redondo Beach CA, US

Assignee:

NCR Corp. - Dayton OH

International Classification:

G06F 13/10
G06F 7/00

US Classification:

703 21, 703 13, 707 1, 707 4, 707100, 713 1

Abstract:

A method for executing database transactions is disclosed. A plurality of interconnected nodes are each defined in terms of processor and storage resources of a parallel computing system. A first set of virtual processors is mapped across a first subset of the nodes to create a first map with at least one virtual processor being mapped to each node in the first subset. A second set of virtual processors is mapped across a second subset of the nodes to create a second map with at least one virtual processor being mapped to each node in the second subset. The first map is stored as a first configuration and the second map is stored as a second configuration. At least one transaction is executed using the first set of virtual processors and simultaneously at least one transaction is executed using the second set of virtual processors.

US Patent:

59240938, Jul 13, 1999

Filed:

May 29, 1997

Appl. No.:

8/864798

Inventors:

Eric Thomas Potter - Redondo Beach CA
John Earl Merritt - Torrance CA

Assignee:

NCR Corporation - Dayton OH

International Classification:

G06F 1730

US Classification:

707 7

Abstract:

A method, apparatus, and article of manufacture for sorting data on a parallel processing computer system, wherein the system is comprised of one or more nodes, each of the nodes executes one or more threads to generate a subset of the data, and the subset of data comprises one or more records. A local data structure is generated on each of the nodes, wherein the local data structure stores ordered entries associated with the records generated by each of the threads. A global data structure is generated on a coordinator node, wherein the global data structure stores ordered entries associated with the records stored in each of the local data structures generated by each of the nodes. An answer set is generated using sorted records from the global data structure.