Versioned node configurations for parallel applications

• US 7,152,026 B1
• Filed: 12/07/2001
• Issued: 12/19/2006
• Est. Priority Date: 12/07/2001
• Status: Expired due to Term

• Current Assignee: Teradata US, Inc. (Teradata Corporation)
• Original Assignee: NCR Corporation (NCR Voyix Corporation)
• Inventors: Merritt, John Earl, Potter, Eric Thomas, Pederson, Donald Raymond
• Primary Examiner(s): FERRIS III, FRED O
• Application Number:
  US10/020,723
• Time in Patent Office: 1,838 Days
• Field of Search: 703/21, 703/22, 707/2, 707/7, 707/8, 713/1
• US Class Current: 703/21
• CPC Class Codes: G06F 11/2028 eliminating a faulty processor or activating a spare
• CPC Class Codes: G06F 16/2315 Optimistic concurrency control
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

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.

Claims

1. A method for executing database transactions, comprising the steps of:

defining each node of a plurality of interconnected nodes in terms of processor and storage resources of a parallel computing system;

mapping a first set of virtual processors 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;

mapping a second set of virtual processors 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;

storing the first map as a first configuration and the second map as a second configuration; and

executing at least one transaction using the first set of virtual processors and simultaneously executing at least one transaction using the second set of virtual processors;

wherein executing a transaction comprises;

identifying tasks necessary to complete the transaction;

identifying storage resources necessary to complete each of the tasks;

defining one or more groups of virtual processors having access to the identified storage resources as one or more transaction groups;

assigning to each task one of the transaction groups that includes virtual processors having access to resources necessary to complete the task; and

completing each task using the virtual processors of the assigned transaction group.

2. The method of claim 1, wherein the first subset of the nodes includes all of the plurality of nodes and the second subset of nodes includes all of the plurality of nodes except for at least one failed node.

3. The method of claim 2, further comprising the steps of:

mapping a third set of virtual processors across a third subset of the nodes to create a third map with at least one virtual processor being mapped to the third subset;

storing the third map as a third configuration; and

wherein the third subset of the nodes includes all of the plurality of nodes.

4. The method of claim 3, wherein the third subset includes at least one restored node.

5. The method of claim 2, wherein at least one transaction using the first set of virtual processors does not use any virtual processors mapped to the at least one failed node.

6. The method of claim 2, further comprising the step of:

halting an impacted transaction, the impacted transaction using the first set of virtual processors including at least one virtual processor mapped to one of the at least one failed nodes.

7. The method of claim 1, wherein the first and second configurations are stored as a configuration table and configurations are removed from the table when they are no longer associated with an executing transaction.

8. The method of claim 1, wherein using the first set of virtual processors consists of completing tasks assigned to transaction groups that include virtual processors from the first set of virtual processors.

9. The method of claim 1, wherein executing at least one transaction using the first set of virtual processors simultaneously with executing at least one transaction using the second set of virtual processors comprises executing a first transaction having at least first and second tasks, the first task executed by one or more virtual processors of the first set and the second task executed by one or more virtual processors of the second set.

10. A computer program, stored on a tangible storage medium, for use in executing database transactions, the program comprising executable instructions that cause a computer to

define each node of a plurality of interconnected nodes in terms of processor and storage resources of a parallel computing system;

map a first set of virtual processors 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;

map a second set of virtual processors 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;

store the first map as a first configuration and the second map as a second configuration; and

execute at least one transaction using the first set of virtual processors and simultaneously execute at least one transaction using the second set of virtual processors;

wherein executing a transaction comprises;

identifying tasks necessary to complete the transaction;

identifying storage resources necessary to complete each of the tasks;

defining one or more groups of virtual processors having access to the identified storage resources as one or more transaction groups;

assigning to each task one of the transaction groups that includes virtual processors having access to resources necessary to complete the task; and

completing each task using the virtual processors of the assigned transaction group.

11. The computer program of claim 10, wherein the first subset of the nodes includes all of the plurality of nodes and the second subset of nodes includes all of the plurality of nodes except for at least one failed node.

12. The computer program of claim 11, further comprising executable instructions that cause a computer to:

map a third set of virtual processors across a third subset of the nodes to create a third map with at least one virtual processor being mapped to each node in the third subset;

store the third map as a third configuration; and

wherein the third subset of the nodes includes all of the plurality of nodes.

13. The computer program of claim 12, wherein the third subset includes at least one restored node.

14. The computer program of claim 11, wherein the at least one transaction using the first set of virtual processors does not use any virtual processors mapped to the at least one failed node.

15. The computer program of claim 11, further comprising executable instructions that cause a computer to:

halt an impacted transaction, the impacted transaction using the first set of virtual processors including at least one virtual processor mapped to one of the at least one failed nodes.

16. The computer program of claim 10, wherein the first and second configurations are stored as a configuration table and configurations are removed from the table when they are no longer associated with an executing transaction.

17. The computer program of claim 10, wherein using the first set of virtual processors consists of completing tasks assigned to transaction groups that include virtual processors from the first set of virtual processors.

18. The computer program of claim 10, wherein executing at least one transaction using the first set of virtual processors simultaneously with executing at least one transaction using the second set of virtual processors comprises executing a first transaction having at least first and second tasks, the first task executed by one or more virtual processors of the first set and the second task executed by one or more virtual processors of the second set.

19. A massively parallel processing system in which database transactions are executed using virtual processors, the processing system comprising:

one or more nodes;

a plurality of CPUs, each of the one or more nodes providing access to one or more CPUs;

a plurality of virtual processors each of the one or more CPUs providing access to one or more virtual processors;

each process configured to manage data stored in one of a plurality of data-storage facilities;

a database-management component configured to execute the transactions by

interconnecting the plurality of nodes;

mapping a first set of the virtual processors 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;

mapping a second set of the virtual processors 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;

storing the first map as a first configuration and the second map as a second configuration; and

executing at least one transaction using the first set of virtual processors and simultaneously executing at least one transaction using the second set of virtual processors;

wherein executing a transaction comprises;

identifying tasks necessary to complete the transaction;

identifying storage resources necessary to complete each of the tasks;

defining one or more groups of virtual processors having access to the identified storage resources as one or more transaction groups;

assigning to each task one of the transaction groups that includes virtual processors having access to resources necessary to complete the task; and

completing each task using the virtual processors of the assigned transaction group.

20. The processing system of claim 19, wherein the first subset of the nodes includes all of the one or more nodes and the second subset of nodes includes all of the one or more nodes except for at least one failed node.

21. The processing system of claim 20, wherein the database-management component is also configured to execute the transactions by:

mapping a third set of virtual processors across a third subset of the nodes to create a third map with at least one virtual processor being mapped to each node in the third subset;

storing the third map as a third configuration; and

wherein the third subset of the nodes includes all of the one or more nodes.

22. The processing system of claim 21, wherein the third subset includes at least one restored node.

23. The processing system of claim 20, wherein the at least one transaction using the first set of virtual processors does not use any virtual processors mapped to the at least one failed node.

24. The processing system of claim 20, wherein the database-management component is also configured to execute the transactions by:

halting an impacted transaction, the impacted transaction using the first set of virtual processors including at least one virtual processor mapped to one of the at least one failed nodes.

25. The processing system of claim 19, wherein the first and second configurations are stored as a configuration table and configurations are removed from the table when they are no longer associated with an executing transaction.

26. The processing system of claim 19, wherein using the first set of virtual processors consists of completing tasks assigned to transaction groups that include virtual processors from the first set of virtual processors.

27. The processing system of claim 19, wherein executing at least one transaction using the first set of virtual processors simultaneously with executing at least one transaction using the second set of virtual processors comprises executing a first transaction having at least first and second tasks, the first task executed by one or more virtual processors of the first set and the second task executed by one or more virtual processors of the second set.