Distributed data propagator

• US 20030154284A1
• Filed: 08/16/2002
• Published: 08/14/2003
• Est. Priority Date: 05/31/2000
• Status: Abandoned Application

• Current Assignee: James Bernardin, James Lewis, Peter Lee
• Original Assignee: James Bernardin, James Lewis, Peter Lee
• Inventors: Lewis, James, Lee, Peter, Bernardin, James
• Application Number:
  US10/222,337
• Publication Number:
  US 20030154284A1
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: G06F 9/465 Distributed object oriented systems remote method invocation [RMI] G06F9/548

Abstract

The invention provides an off-the-shelf product solution to target the specific needs of commercial users with naturally parallel applications. A top-level, public API provides a simple “compute server” or “task farm” model that dramatically accelerates integration and deployment. A Propagator API allows parallel applications that require inter-node communication to be seamlessly deployed in heterogeneous environments, including networks of interruptible PCs. Implementation of parallel applications using the Propagator API does not require that the environment provide a separate node (or processor) for each block of concurrently-executable code. Nor does the Propagator API require that the assignment between particular blocks of code and processing resources remain static during execution of the parallel application.

Claims

12. A method for executing a message-passing parallel program, comprised of a plurality of concurrently-executable virtual nodes, each having one or more numbered step(s), with one or more associated executable instruction(s) and zero or more associated messaging task(s), the method comprising:

maintaining a pool of available processing elements, wherein the number of processing elements in the pool may be smaller than the number of virtual nodes;

assigning each of the virtual nodes to at least one processing element from the pool of available processing elements; and

,

executing the parallel program, starting with the lowest-numbered step, by;

(a) executing all instruction(s) associated with said step;

(b) completing all messaging task(s) associated with said step; and

, then,

(c) repeating (a)-(b) for the next lowest-numbered step until execution of the parallel program is completed.

1. A method for deploying a message-passing parallel program on a network of processing elements, where the number, N, of available processing elements in the network can be less than the number, P, of concurrently-executable processes in the message-passing parallel program, the method comprising:

defining the parallel program'"'"'s concurrently-executable processes as virtual nodes, such that each virtual node contains (i) state information, (ii) a plurality of executable instructions, and (iii) a messaging interface capable of sending and/or receiving messages to/from other virtual node(s);

assigning each of the defined virtual nodes to at least one of the available processing elements in the network for execution, such that at least some of the available processing elements have more than one assigned virtual node; and

,

allowing the virtual nodes to migrate from one available processing element to another during execution of the parallel program.

2. A method for deploying a message-passing parallel program, as defined in claim 1, wherein allowing the virtual nodes to migrate during execution comprises:

providing an adaptive scheduler that selectively reassigns virtual nodes based on load balancing considerations.

3. A method for deploying a message-passing parallel program, as defined in claim 2, wherein:

if processing element i is more capable than processing element j, the adaptive scheduler assigns a larger number of virtual nodes to processing element i than to processing element j.

4. A method for deploying a message-passing parallel program, as defined in claim 1, wherein:

each virtual node'"'"'s plurality of executable instructions are associated with one or more steps.

5. A method for deploying a message-passing parallel program, as defined in claim 4, wherein:

the steps define barrier synchronization points for the message-passing parallel program.

6. A method for deploying a message-passing parallel program, as defined in claim 5, wherein:

all virtual nodes must complete execution of any instructions associated with a given step n, before any virtual node may commence execution of instructions associated with step n+1.

7. A method for deploying a message-passing parallel program, as defined in claim 6, wherein:

any virtual node-to-virtual node message(s) sent during step n must be received before any virtual node may commence execution of instructions associated with step n+1.

8. A method for deploying a message-passing parallel program, as defined in claim 1, wherein:

the messaging interface includes a webserver.

9. A method for deploying a message-passing parallel program, as defined in claim 1, wherein:

the messaging interface associated with each virtual node supports at least three of the following operations;

(i) broadcast a message to all virtual nodes, except the current virtual node;

(ii) clear all message(s) and associated message state(s);

(iii) get message(s) for the current virtual node;

(iv) get the message(s) from a specified virtual node for the current virtual node;

(v) get the state of a specified virtual node;

(vi) get the total number of virtual nodes;

(vii) send a message to a specified virtual node; and

/or,

(viii) set the state of a specified virtual node.

10. A method for deploying a message-passing parallel program, as defined in claim 1, wherein:

the messaging interface associated with each virtual node supports-at least four of the following operations;

(i) broadcast a message to all virtual nodes, except the current virtual node;

(ii) clear all message(s) and associated message state(s);

(iii) get message(s) for the current virtual node;

(iv) get the message(s) from a specified virtual node for the current virtual node;

(v) get the state of a specified virtual node;

(vi) get the total number of virtual nodes;

(vii) send a message to a specified virtual node, and/or,

(viii) set the state of a specified virtual node.

11. A method for deploying a message-passing parallel program, as defined in claim 1, wherein:

the messaging interface associated with each virtual node supports at least five of the following operations;

(i) broadcast a message to all virtual nodes, except the current virtual node;

(ii) clear all message(s) and associated message state(s);

(iii) get message(s) for the current virtual node;

(iv) get the message(s) from a specified virtual node for the current virtual node;

(v) get the state of a specified virtual node;

(vi) get the total number of virtual nodes;

(vii) send a message to a specified virtual node; and

/or,

(viii) set the state of a specified virtual node.

13. A method for executing a message-passing parallel program, as defined in claim 12, further comprising:

reassigning one or more virtual node(s) to different processing elements during the execution of the parallel program.

14. A method for executing a message-passing parallel program, as defined in claim 13, wherein:

the reassigning of one or more virtual node(s) occurs in response to a change in the pool of available processing elements.

15. A method for executing a message-passing parallel program, as defined in claim 13, wherein:

the reassigning of one or more virtual node(s) occurs in response to one or more of the processing elements in the pool becoming unavailable.

16. A method for executing a message-passing parallel program, as defined in claim 13, wherein:

the reassigning of one or more virtual node(s) occurs in response to one or more additional processing elements entering the pool of available processing elements.

17. A method for executing a message-passing parallel program, as defined in claim 13, wherein:

the reassigning of one or more virtual node(s) is performed to optimize load balance between the processing elements in the pool.

18. A method for executing a message-passing parallel program, as defined in claim 12, wherein:

assigning each of the virtual nodes to at least one processing element further comprises;

identifying one or more of the virtual node(s) as critical; and

,

redundantly assigning each of the critical virtual node(s) to more than one processing element.

19. A method for executing a message-passing parallel program, as defined in claim 12, further comprising:

monitoring user interface activity on each processing element to which a virtual node has been assigned.

20. A method for executing a message-passing parallel program, as defined in claim 12, further comprising:

monitoring user interface activity on each processing element to which a virtual node has been assigned and, upon detection of user activity, immediately suspending execution of instructions associated with the assigned virtual node.

21. A method for executing a message-passing parallel program, as defined in claim 12, further comprising:

monitoring, on a substantially continuous basis, user interface activity on each processing element to which a virtual node has been assigned.

22. A method for executing a message-passing parallel program, as defined in claim 21, wherein:

monitoring, on a substantially continuous basis, comprises checking for user interface activity at least once each second.

23. A method for executing a message-passing parallel program, as defined in claim 21, further comprising:

immediately removing from the pool any processing element on which user interface activity is detected.

24. A method for executing a message-passing parallel program, as defined in claim 21, further comprising:

reassigning any virtual nodes assigned to processing elements on which user interface activity is detected.

25. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, the method comprising:

(a) maintaining a plurality of concurrently-executable virtual nodes, each having associated state information;

(b) cacheing the state information associated with each virtual node onto one or more network-accessible servers;

(c) advancing execution of the parallel program by permitting instructions associated with one or more of the virtual nodes to be executed on one or more available processing elements, and permitting messages to be exchanged between the virtual nodes;

(d) upon normal completion of (c), updating cached state information on the network-accessible servers and returning to (c) to continue execution, or, upon fault detection or timeout during (c), restoring the state of the virtual nodes using the cached state information and repeating (c).

26. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 24, wherein:

each virtual node comprises executable instructions and messaging tasks, associated with a plurality of steps.

27. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 26, wherein:

advancing execution of the parallel program comprises executing instructions and messaging tasks associated with a selected step.

28. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 24, wherein:

cacheing the state information associated with each virtual node onto one or more network-accessible servers comprises collectively maintaining, on one or more network-accessible servers, at least one copy of the state information for each virtual node.

29. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 24, wherein:

cacheing the state information associated with each virtual node onto one or more network-accessible servers comprises collectively maintaining, on a plurality of network-accessible servers, at least two copies, located on different servers, of the state information for each virtual node.

30. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 24, wherein:

cacheing the state information associated with each virtual node further comprises maintaining a copy of such state information in the active memory of an assigned processing element.

25-1. A fault-tolerant method for executing a message-passing parallel program on a network of interruptible processors, as defined in claim 24, wherein:

in (c), permitting instructions associated with one or more of the virtual nodes to be executed involves executing all instructions associated with a selected step; and

,

in (d), returning to (c) to continue execution involves advancing the selected step prior to returning to (c).

31. A network-based computing system configured to execute a message-passing parallel program, wherein the system includes a network of processing elements in which the number, N, of available processing elements in the network can be less than the number, P, of concurrently-executable processes in the message-passing parallel program, the system comprising:

a plurality of virtual nodes, each corresponding to a concurrently-executable process in the parallel program, each virtual node including (i) state information, (ii) a plurality of executable instructions, and (iii) a messaging interface capable of sending and/or receiving messages to/from other virtual node(s);

an adaptive scheduler that assigns each of the virtual nodes to at least one of the available processing elements in the network for execution, such that at least some of the available processing elements have more than one assigned virtual node;

characterized in that the virtual nodes can migrate from one available processing element to another during execution of the parallel program.

32. A network-based computing system configured to execute a message-passing parallel program, as defined in claim 31, wherein the adaptive scheduler selectively reassigns virtual nodes based on load balancing considerations.

33. A network-based computing system configured to execute a message-passing parallel program, as defined in claim 31, wherein the messaging interface comprises a webserver.

34. A network-based computing system configured to execute a message-passing parallel program, as defined in claim 33, wherein:

the messaging interface associated with each virtual node supports at least three of the following operations;

(i) broadcast a message to all virtual nodes, except the current virtual node;

(ii) clear all message(s) and associated message state(s);

(iii) get message(s) for the current virtual node;

(iv) get the message(s) from a specified virtual node for the current virtual node;

(v) get the state of a specified virtual node;

(vi) get the total number of virtual nodes,

(vii) send a message to a specified virtual node; and

/or,

(viii) set the state of a specified virtual node.

35. A network-based computing system configured to execute a message-passing parallel program, as defined in claim 31, wherein:

the messaging interface associated with each virtual node supports at least four of the following operations;

(i) broadcast a message to all virtual nodes, except the current virtual node;

(ii) clear all message(s) and associated message state(s);

(iii) get message(s) for the current virtual node;

(iv) get the message(s) from a specified virtual node for the current virtual node;

(v) get the state of a specified virtual node;

(vi) get the total number of virtual nodes;

(vii) send a message to a specified virtual node; and

/or,

(viii) set the state of a specified virtual node.

36. A fault-tolerant, network-based computing system configured to execute a message-passing parallel program on a network of interruptible processors, the system comprising:

(a) a plurality of concurrently-executable virtual nodes, each having associated state information;

(b) one or more network-accessible servers that collectively maintain a cache of the state information associated with each virtual node;

(c) at least one server that controls execution of the parallel program by permitting instructions associated with one or more of the virtual nodes to be executed on one or more available processing elements, and permits messages to be exchanged between the virtual nodes;

(d) the server including means for updating cached state information and continuing execution, or, upon fault detection or timeout, restoring the state of the virtual nodes using cached state information and repeating execution of selected instructions.