Executing algorithms in parallel

• US 9,665,403 B2
• Filed: 03/15/2013
• Issued: 05/30/2017
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: MIOsoft Corporation
• Original Assignee: MIOsoft Corporation
• Inventors: Siepmann, Ernst M., Barabas, Albert B., van Gulik, Mark D. A.
• Primary Examiner(s): Bullock, Jr., Lewis A
• Assistant Examiner(s): Huynh, Tina
• Application Number:
  US13/842,253
• Publication Number:
  US 20140282600A1
• Time in Patent Office: 1,537 Days
• CPC Class Codes: G06F 8/456 Parallelism detection
• CPC Class Codes: G06F 9/44 Arrangements for executing specific programs
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451

Abstract

Among other things, a machine-based method comprises receiving an application specification comprising one or more algorithms. Each algorithm is not necessarily suitable for concurrent execution on multiple nodes in parallel. One or more different object classes are grouped into one or more groups, each being appropriate for executing the one or more algorithms of the application specification. The executing involves data that is available in objects of the object classes. A user is enabled to code an algorithm of the one or more algorithms for one group in a single threaded environment without regard to concurrent execution of the algorithm on multiple nodes in parallel. An copy of the coded algorithm is distributed to each of the multiple nodes, without needing additional coding. The coded algorithm is caused to be executed on each node in association with at least one instance of a group independently of and in parallel to executing the other copies of the coded algorithm on the other nodes.

Claims

1. A machine-based method comprising:

with respect to an application specification comprising one or more algorithms each not necessarily suitable for concurrent execution on multiple nodes in parallel;

grouping one or more different object classes into one or more groups each of the one or more groups representing the application specification and each of the one or more groups being based on a context, each of the groups being appropriate for executing the one or more algorithms of the application specification based on data that is available in instances of objects of the one or more different object classes of the group;

enabling a user to code an algorithm of the one or more algorithms for one of the one or more groups based on the context for execution in a single threaded environment without regard to concurrent execution of the algorithm on the multiple nodes in parallel;

distributing instances of the coded algorithm to corresponding nodes to be executed without needing additional coding;

causing each of the instances of the coded algorithm to be executed on the corresponding node as part of executing at least one instance of the group independently of and in parallel to executing other instances of the coded algorithm on other nodes also as part of executing the at least one instance of the group, each instance of the group comprising instances of objects of the object classes of the group, each of the instances of the objects having referential relationships only to other objects of the group; and

the coded algorithm being executed on a node using one process to access an instance of an object without contention from other processes used for concurrently executing other instances of the coded algorithm.

2. The machine-based method of claim 1, wherein each of the multiple nodes comprises a physical node.

3. The machine-based method of claim 1, wherein each node comprises a single thread for executing the coded algorithm.

4. The machine-based method of claim 1, wherein each node comprises a single process for executing the coded algorithm.

5. The machine-based method of claim 1, wherein the one or more algorithms comprise a business function.

6. The machine-based method of claim 1, comprising causing the coded algorithm to be executed on each node on a single instance of a group using a single process, and wherein different processes are independent of each other.

7. The machine-based method of claim 1, comprising assigning a weight to each node, the weight being proportional to a number of instances associated with the node.

8. The machine-based method of claim 7, wherein the weight is the same for all nodes to which copies of the coded algorithm are distributed.

9. The machine-based method of claim 1, comprising distributing copies of the coded algorithm to additional nodes and causing the coded algorithm to be executed on each of those additional nodes without affecting the existing distribution of the coded algorithm and the existing execution of the coded algorithm.

10. The machine-based method of claim 1, wherein each node is associated with a single instance.

11. The machine-based method of claim 10, wherein each node is assigned with a unique identifier that identifies the corresponding single instance.

12. The machine-based method of claim 1, wherein each instance is associated with a single copy of the coded algorithm and a single node.

13. The machine-based method of claim 1, comprising identifying a root object class within each group and enabling retrieving an entire instance of a group based on an object of the root object class contained in the instance.

14. The machine-based method of claim 1, comprising enabling a user to save meta data of the grouping into a single file.

15. The machine-based method of claim 1, wherein causing the coded algorithm to be executed on each node in association with at least one instance of a group independently of and in parallel to executing the other instances of the coded algorithm on other nodes comprises:

causing the coded algorithm to be executed on each node in association with at least one instance of a group without requiring data access to other groups in the one or more groups.

16. The machine-based method of claim 1, wherein the context comprises a particular business context.

17. A computer program product residing on a non-transitory computer readable medium, the computer program product comprising instructions for causing a processor to:

with respect to an application specification comprising one or more algorithms each not necessarily suitable for concurrent execution on multiple nodes in parallel;

group one or more different object classes into one or more groups each of the one or more groups representing the application specification and each of the one or more groups being based on a context, each of the groups being appropriate for executing the one or more algorithms of the application specification based on data that is available in instances of objects of the one or more different object classes of the group;

enable a user to code an algorithm of the one or more algorithms for one of the one or more groups based on the context for execution in a single threaded environment without regard to concurrent execution of the algorithm on the multiple nodes in parallel;

distribute instances of the coded algorithm to corresponding nodes to be executed without needing additional coding;

causing each of the instances of the coded algorithm to be executed on the corresponding node as part of executing at least one instance of the group independently of and in parallel to executing other instances of the coded algorithm on other nodes also as part of executing the at least one instance of the group, each instance of the group comprising instances of objects of the object classes of the group, each of the instances of the objects having referential relationships only to other objects of the group; and

the coded algorithm being executed on a node using one process to access an instance of an object without contention from other processes used for concurrently executing other instances of the coded algorithm.

18. The computer program product of claim 17, wherein each of the multiple nodes comprises a physical node.

19. The computer program product of claim 17, wherein each node comprises a single thread for executing the coded algorithm.

20. The computer program product of claim 17, wherein each node comprises a single process for executing the coded algorithm.

21. The computer program product of claim 17, wherein the one or more algorithms comprise a business function.

22. The computer program product of claim 17, comprising instructions for causing the processor to cause the coded algorithm to be executed on each node on a single instance of a group using a single process, and wherein different processes are independent of each other.

23. The computer program product of claim 17, comprising instructions for causing the processor to assign a weight to each node, the weight being proportional to a number of instances associated with the node.

24. The computer program product of claim 23, wherein the weight is the same for all nodes to which copies of the coded algorithm are distributed.

25. The computer program product of claim 17, comprising instructions for causing the processor to distribute copies of the coded algorithm to additional nodes and to cause the coded algorithm to be executed on each of those additional nodes without affecting the existing distribution of the coded algorithm and the existing execution of the coded algorithm.

26. The computer program product of claim 17, wherein each node is associated with a single instance.

27. The computer program product of claim 26, wherein each node is assigned with a unique identifier that identifies the corresponding single instance.

28. The computer program product of claim 17, wherein each instance is associated with a single copy of the coded algorithm and a single node.

29. The computer program product of claim 17, comprising instructions for causing the processor to identify a root object class within each group and enable retrieving an entire instance of a group based on an object of the root object class contained in the instance.

30. The computer program product of claim 17, comprising instructions to cause the processor to enable a user to save meta data of the grouping into a single file.

31. The computer program product of claim 17, wherein causing the coded algorithm to be executed on each node in association with at least one instance of a group independently of and in parallel to executing the other instances of the coded algorithm on other nodes comprises:

causing the coded algorithm to be executed on each node in association with at least one instance of a group without requiring data access to other groups in the one or more groups.

32. The computer program product of claim 17, wherein the context comprises a particular business context.

33. A computer system comprising:

a processor;

a memory; and

a storage device that stores a program for execution by the processor using the memory, the program comprising instructions configured to cause the processor to;

with respect to an application specification comprising one or more algorithms each not necessarily suitable for concurrent execution on multiple nodes in parallel;

group one or more different object classes into one or more groups each of the one or more groups representing the application specification and each of the one or more groups being based on a context, each of the groups being appropriate for executing the one or more algorithms of the application specification based on data that is available in instances of objects of the one or more different object classes of the group;

enable a user to code an algorithm of the one or more algorithms for one of the one or more groups based on the context for execution in a single threaded environment without regard to concurrent execution of the algorithm on the multiple nodes in parallel;

distribute instances of the coded algorithm to corresponding nodes to be executed without needing additional coding;

cause each of the instances of the coded algorithm to be executed on the corresponding node as part of executing at least one instance of the group independently of and in parallel to executing other instances of the coded algorithm on other nodes also as part of executing the at least one instance of the group, each instance of the group comprising instances of objects of the object classes of the group, each of the instances of the objects having referential relationships only to other objects of the group; and

the coded algorithm being executed on a node using one process to access an instance of an object without contention from other processes used for concurrently executing other instances of the coded algorithm.

34. The system of claim 33, wherein each of the multiple nodes is comprises a physical node.

35. The system of claim 33, wherein each node comprises a single thread for executing the coded algorithm.

36. The system of claim 33, wherein each node comprises a single process for executing the coded algorithm.

37. The system of claim 33, wherein the one or more algorithms comprise a business function.

38. The system of claim 33, wherein the program comprises instructions configured to cause the processor to cause the coded algorithm to be executed on each node on a single instance of a group using a single process, and wherein different processes are independent of each other.

39. The system of claim 33, wherein the program comprises instructions configured to cause the processor to assign a weight to each node, the weight being proportional to a number of instances associated with the node.

40. The system of claim 39, wherein the weight is the same for all nodes to which copies of the coded algorithm are distributed.

41. The system of claim 33, wherein the program comprises instructions configured to cause the processor to distribute copies of the coded algorithm to additional nodes and to cause the coded algorithm to be executed on each of those additional nodes without affecting the existing distribution of the coded algorithm and the existing execution of the coded algorithm.

42. The system of claim 33, wherein each node is associated with a single instance.

43. The system of claim 42, wherein each node is assigned with a unique identifier that identifies the corresponding single instance.

44. The system of claim 33, wherein each instance is associated with a single copy of the coded algorithm and a single node.

45. The system of claim 33, wherein the program comprises instructions configured to cause the processor to identify a root object class within each group and enable retrieving an entire instance of a group based on an object of the root object class contained in the instance.

46. The system of claim 33, wherein the program comprises instructions configured to cause the processor to enable a user to save meta data of the grouping into a single file.

47. The system of claim 33, wherein causing the coded algorithm to be executed on each node in association with at least one instance of a group independently of and in parallel to executing the other copies instances of the coded algorithm on other nodes comprises:

causing the coded algorithm to be executed on each node in association with at least one instance of a group without requiring data access to other groups in the one or more groups.

48. The system of claim 33, wherein the context comprises a particular business context.