Dynamic distributed evaluator

1. An apparatus, comprising a first node of a network, the first node comprising:

an interface operable to:

communicate with a second node of the network; and

one or more processors operable to:

tell a plurality of nodes to perform an operation comprising a procedure of an application, the plurality of nodes comprising a second node and one or more additional nodes;

instruct the plurality of nodes how to perform the operation using computer code; and

tell the plurality of nodes what to do with a result of the operation, and

wherein the one or more processors does not know which one of the plurality of nodes will perform the operation.

2. The apparatus of claim 1 , wherein the first node operable to instruct the plurality of nodes how to perform the operation using code further comprising:

sending the code for performing the operation from the first node to the second node.

3. The apparatus of claim 1 , the first node operable to instruct the plurality of nodes how to perform the operation using code further comprising:

telling the second node where to find the code for performing the operation.

4. The apparatus of claim 1 , wherein the first node operable to instruct the plurality of nodes how to perform the operation using code further comprising:

providing the second node with a reference symbol, the reference symbol identifying the code to be used; and

instructing the second node to:

locate a source node, the source node having the code indicated by the reference symbol; and

obtain the code from the source node.

5. The apparatus of claim 1 , wherein the first node operable to tell the plurality of nodes what to do with the result of the operation further comprising:

telling the second node to send the result to a third node.

6. The apparatus of claim 1 , wherein the first node operable to tell the plurality of nodes what to do with the result of the operation further comprising:

telling the second node to send the result to the first node.

7. The apparatus of claim 1 , the code programmed to remove itself upon the completion of a. process or upon the expiration of a timer.

8. The apparatus of claim 1 , further comprising the first node instructing the second node to remove the code upon completion of a process.

9. The apparatus of claim 1 , wherein the first node operable to instruct the plurality of nodes how to perform the operation using code further comprising:

instructing the second node to use a first code comprising a first programming language and a second code comprising a second programming language.

10. The apparatus of claim 1 , further comprising:

wherein the first node operable to instruct the plurality of nodes how to perform the operation using code further comprising:

instructing the second node to use a first code configured to be executed on a first operating system; and

the first node operable to instruct a third node to perform the operation using a second code configured to be executed on a second operating system.

11. The apparatus of claim 1 , wherein:

the first node operable to tell the second node what to do with the result of the operation comprises telling the second node to send the result to a third node; and

the one or more processors is further operable to:

instruct the third node to use the result of the operation performed by the second node to perform an additional operation by the third node; and

instruct the third node to return the result of the additional operation performed by the third node to the second node.

12. A method, comprising:

establishing communication with a plurality of nodes of a network;

telling the plurality of nodes to perform an operation comprising a procedure of an application, the plurality of nodes comprising a second node and one or more additional nodes;

instructing the plurality of nodes how to perform the operation using computer code; and

telling the plurality of nodes what to do with a result of the operation, and

wherein the one or more processors does not know which one of the plurality of nodes will perform the operation.

13. The method of claim 12 , wherein the instructing the plurality of nodes how to perform the operation using code further comprising:

sending the code for performing the operation to the plurality of nodes;

telling the plurality of nodes where to find the code for performing the operation; or

providing the plurality of nodes with a reference symbol identifying the code and instructing the node to obtain the code from a source node having the code indicated by the reference symbol.

14. The method of claim 12 , wherein the telling the plurality of nodes what to do with the result of the operation further comprising:

telling the plurality of nodes to send the result to another node.

15. The method of claim 12 , the code programmed to remove itself upon the completion of a process or upon the expiration of a timer,

16. The method of claim 12 , wherein the instructing the node plurality of plurality of nodes how to perform the operation using code further comprising:

instructing the plurality of nodes to use a first code comprising a first programming language and a second code comprising a second programming language.

17. The method of claim 14 , wherein the one or more processors is further operable to:

instruct a third node to use the result of the operation performed by the second node to perform an additional operation by the third node; and

instruct the third node to return the result of the additional operation performed by the third node to the second node.

18. An apparatus, comprising a first node of a network, the first node comprising:

an interface operable to:

communicate with a second node of the network and a third node of the network; and

one or more processors operable to:

initiate an application comprising a plurality of operations, each operation of the plurality of operations comprising a procedure of the application;

tell a plurality of nodes to perform a first operation, the plurality of nodes comprising the second node, third node, and one or more additional nodes;

instruct the plurality of nodes how to perform the first operation using computer code; and

tell the plurality of nodes what to do with a result of the first operation, and

wherein the one or more processors does not know which one of the plurality of nodes will perform the first operation.

19. The apparatus of claim 18 , comprising:

instructing the second node to send the result of the first operation to the third node;

instructing the third node to use the result of the first operation as an input to the second operation.

20. The apparatus of claim 19 , wherein the one or more processors is further operable to

instruct the third node to return the result of the second operation performed by the third node to the second node.