Computer architecture and method of operation for multi-computer distributed processing and coordinated memory and asset handling

• US 20060242464A1
• Filed: 10/25/2005
• Published: 10/26/2006
• Est. Priority Date: 04/23/2004
• Status: Active Grant

• Current Assignee: Waratek Limited (Waratek Holdings Ltd.)
• Original Assignee: Waratek Pty Limited
• Inventors: Holt, John Matthew
• Granted Patent: US 7,788,314 B2
• Time in Patent Office: Days
• US Class Current: 714/25
• CPC Class Codes: G06F 15/16 Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs coordinating program control therefor G06F9/52; in regulating and control system G05B
• CPC Class Codes: G06F 8/456 Parallelism detection

Abstract

The present invention discloses a modified computer architecture (50, 71, 72) which enables an applications program (50) to be run simultaneously on a plurality of computers (M1, . . . Mn). Shared memory at each computer is updated with amendments and/or overwrites so that all memory read requests are satisfied locally. During initial program loading (75), or similar, instructions which result in memory being re-written or manipulated are identified (92). Additional instructions are inserted (103) to cause the equivalent memory locations at all computers to be updated. In addition, the initialization of JAVA language classes and objects is disclosed (162, 163) so all memory locations for all computers are initialized in the same manner. The finalization of JAVA language classes and objects is also disclosed (162, 163) so finalization only occurs when the last class or object present on all machines is no longer required. During initial program loading (75), or similar, instructions which result in the application program (50) acquiring (or releasing) a lock on a particular asset (50A, 50X-50Y) (synchronization) are identified. Additional instructions are inserted (162, 163) to result in a modified synchronization routine with which all computers are updated.

Claims

1. A method of running simultaneously on a plurality of computers at least one application program each written to operate on only a single computer but modified by a modification routine to run simultaneously on the plurality of computers, said computers being interconnected by means of a communications network, said method comprising the steps of:

(i) executing different portions of said application program(s) on different ones of said computers and for each said portion creating a like plurality of substantially identical objects each in the corresponding computer.

2. The method as claimed in claim 1, comprising the further step of:

(ii) naming each of said plurality of substantially identical objects with a substantially identical name.

3. The method as claimed in claim 1, wherein:

each said object having a substantially identical name.

4. The method as claimed in claim 3, comprising the further step of:

(iii) creating the initial contents of each of said identically named objects substantially the same.

5. The method as claimed in claim 3, comprising the further step of:

(iii) deleting all said identical objects collectively when all of said plurality of computers no longer need to refer to their corresponding object.

6. The method as claimed in claim 3, comprising the further step of:

(iii) requiring any of said computers wishing to utilize a named object therein to acquire an authorizing lock which permits said utilization and which prevents all the other computers from utilizing their corresponding named object until said authorizing lock is relinquished.

7. The method as claimed in claim 1, wherein (P1) each computer having an independent local memory.

8. The method as claimed in claim 7, wherein (P1) each object accessible only by the corresponding portion of said application program.

9. The method as claimed in claim 2, comprising the further step of:

(ii) naming each of said plurality of substantially identical objects with a substantially identical name.

10. The method as claimed in claim 1, wherein:

each computer having an independent local memory;

each object accessible only by the corresponding portion of said application program; and

the method comprising the further steps of;

(ii) naming each of said plurality of substantially identical objects with a substantially identical name;

(iii) creating the initial contents of each of said identically named objects substantially the same;

(iv) deleting all said identical objects collectively when all of said plurality of computers no longer need to refer to their corresponding object; and

(v) requiring any of said computers wishing to utilize a named object therein to acquire an authorizing lock which permits said utilization and which prevents all the other computers from utilizing their corresponding named object until said authorizing lock is relinquished.

11. The method as claimed in claim 1, comprising the further steps of:

(ii) creating the initial contents of each of said identically named objects substantially the same.

(iii) deleting all said identical objects collectively when all of said plurality of computers no longer need to refer to their corresponding object.

(iv) requiring any of said computers wishing to utilize a named object therein to acquire an authorizing lock which permits said utilization and which prevents all the other computers from utilizing their corresponding named object until said authorizing lock is relinquished.

12. The method as claimed in claim 11, comprising the further step of:

(v) if a portion of said application program running on one of said computers creates an object in that computer, then the created object is propagated to all of the other computers via said communications network.

13. The method as claimed in claim 12, including the further step of:

(vi) modifying said application program before, during or after loading by inserting an initialization routine to modify each instance at which said application program creates an object, said initialization routine propagating every object created by one computer to all said other computers.

14. A method as claimed in claim 11, including the further step of:

(vii) providing each said computer with a distributed run time means to communicate between said computers via said communications network.

15. A method as claimed in claim 14, including the further step of:

(viii) providing a shared table accessible by each said distributed run time means and in which is stored the identity of any computer which no longer requires to access an object, together with the identity of the object.

16. A method as claimed in claim 15, including the further step of:

(ix) associating a counter means with said shared table, said counter means storing a count of the number of said computers which no longer require to access said object.

17. A method as claimed in claim 16, including the further step of:

(x) providing an additional computer on which said shared program does not run and which hosts said shared table and counter, said additional computer being connected to said communications network.

18. A method as claimed in claim 14, including the further step of:

(xi) providing a shared table accessible by each said distributed run time means and in which is stored the identity of any computer which currently has to access an object, together with the identity of the object.

19. A method as claimed in claim 18, including the further step of:

(xii) associating a counter means with said shared table, said counter means storing a count of the number of said computers which seek access to said object.

20. A method as claimed in claim 19, including the further step of:

(xiii) providing an additional computer on which said shared program does not run and which hosts said shared table and counter, said additional computer being connected to said communications network.

21. The method as claimed in claim 8, comprising the further step of:

(ii) naming each of said plurality of substantially identical objects with a substantially identical name.

22. The method as claimed in claim 21, comprising the further step of:

(iii) if a portion of said application program running on one of said computers changes the contents of an object in that computer, then the change in content of said object is propagated to all of the other computers via said communications network to change the content of the corresponding object in each of said other computers.

23. The method as claimed in claim 22, including the further step of:

(iv) modifying said application program before, during or after loading by inserting an updating propagation routine to modify each instance at which said application program writes to memory, said updating propagation routine propagating every memory write by one computer to all said other computers.

24. The method as claimed in claim 23, including the further step of:

(v) modifying said application program utilizing a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

25. The method as claimed in claim 22, including the further step of:

(vi) transferring the modified application program to all said computers utilizing a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

26. The method as claimed in claim 4, comprising the further step of:

(iii) if a portion of said application program running on one of said computers creates an object in that computer, then the created object is propagated to all of the other computers via said communications network.

27. The method as claimed in claim 26, including the further step of:

(iv) modifying said application program before, during or after loading by inserting an initialization routine to modify each instance at which said application program creates an object, said initialization routine propagating every object created by one computer to all said other computers.

28. The method as claimed in claim 27, including the further step of:

(v) modifying said application program utilizing a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

29. The method as claimed in claim 27, including the further step of:

(vi) transferring the modified application program to all said computers utilizing a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

30. A method as claimed in claim 5, including the further step of:

(iii) providing each said computer with a distributed run time means to communicate between said computers via said communications network.

31. A method as claimed in claim 30, including the further step of:

(iv) providing a shared table accessible by each said distributed run time means and in which is stored the identity of any computer which no longer requires to access an object, together with the identity of the object.

32. A method as claimed in claim 31, including the further step of:

(v) associating a counter means with said shared table, said counter means storing a count of the number of said computers which no longer require to access said object.

33. A method as claimed in claim 32, including the further step of:

(vi) providing an additional computer on which said shared program does not run and which hosts said shared table and counter, said additional computer being connected to said communications network.

34. A method as claimed in claim 6, including the further step of:

(iii) providing each said computer with a distributed run time means to communicate between said computers via said communications network.

35. A method as claimed in claim 34, including the further step of:

(iv) providing a shared table accessible by each said distributed run time means and in which is stored the identity of any computer which currently has to access an object, together with the identity of the object.

36. A method as claimed in claim 35, including the further step of:

(v) associating a counter or counter means with said shared table, said counter means storing a count of the number of said computers which seek access to said object.

37. A method as claimed in claim 36, including the further step of:

(vi) providing an additional computer on which said shared program does not run and which hosts said shared table and counter, said additional computer being connected to said communications network.

38. A computer program product comprising a set of program instructions stored in a storage medium or existing in electronic or digital form anywhere and operable to permit at least one computers to carry out the method as claimed in claims 1.

39. A multiple computer system having at least one application program each written to operate only on a single computer but modified by a modification routine and running simultaneously on a plurality of computers interconnected by a communications network, wherein portions of said application program(s) execute substantially simultaneously on different ones of said plurality of computers;

and for each portion a like plurality of substantially identical objects are created, each in the corresponding one of the plurality of computers.

40. The system as claimed in claim 39, wherein each of said like plurality of substantially identical objects having a corresponding name or identifier on each of said plurality of computers.

41. The system as claimed in claim 39, wherein each of said like plurality of substantially identical objects having a substantially identical name.

42. The system as claimed in claim 39, wherein each of said plurality of substantially identical objects has a substantially identical name.

43. The system as claimed in claim 39, wherein each computer has an independent local memory accessible only by the corresponding portion of said application program(s).

44. The system as claimed in claim 39, wherein the initial contents of each of said identically named objects is substantially the same.

45. The system as claimed in claim 39, wherein all said identical objects are collectively deleted when each one of said plurality of computers no longer needs to refer to their corresponding object.

46. The system as claimed in claim 39, wherein said system including a lock means applicable to all said computers wherein any computer wishing to utilize a named object therein acquires an authorizing lock from said lock means which permits said utilization and which prevents all the other computers from utilizing their corresponding named object until said authorizing lock is relinquished.

47. The system as claimed in claim 39, wherein said portions are different portions

48. The system as claimed in claim 44, wherein each of said plurality of substantially identical objects has a substantially identical name.

49. The system as claimed in claim 39, wherein:

each of said like plurality of substantially identical objects having a substantially identical name;

the initial contents of each of said identically named objects is substantially the same;

all said identical objects are collectively deleted when each one of said plurality of computers no longer needs to refer to their corresponding object; and

said system including a lock means applicable to all said computers wherein any computer wishing to utilize a named object therein acquires an authorizing lock from said lock means which permits said utilization and which prevents all the other computers from utilizing their corresponding named object until said authorizing lock is relinquished.

50. The system as claimed in claim 49, wherein said lock means includes an acquire lock routine and a release lock routine, and both said routines are included in modifications made to said application program running on all said computers.

51. The system as claimed in claim 50, wherein said lock means further includes a shared table listing said named objects in use by any said computer, a lock status for each said object, and a queue of any pending lock acquisitions.

52. The system as claimed in claim 51, wherein said lock means is located within an additional computer not running said application program and connected to said communications network.

53. The system as claimed in claim 49, wherein each said computer includes a distributed run time means with the distributed run time means of each said computer able to communicate with all other computers whereby if a portion of said application program(s) running on one of said computers creates an object in that computer then the created object is propagated by the distributed run time means of said one computer to all the other computers.

54. The system as claimed in claim 49, wherein each said computer includes a distributed run time means with the distributed run time means of each said computer able to communicate with all other computers whereby if a portion of said application program(s) running on one of said computers no longer needs to refer to an object in that computer then the identity of the unreferenced object is transmitted by the distributed run time means of said one computer to a shared table accessible by all the other computers.

55. The system as claimed in claim 49, wherein each said application program is modified before, during, or after loading by inserting an initialization routine to modify each instance at which said application program creates an object, said initialization routine propagating every object newly created by one computer to all said other computers.

56. The system as claimed in claim 55, wherein the application program is modified in accordance with a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

57. The system as claimed in claim 55, wherein said modified application program is transferred to all said computers in accordance with a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

58. The system as claimed in claim 49, wherein the local memory capacity allocated to the, or each, said application program is substantially identical and the total memory capacity available to the, or each, said application program is said allocated memory capacity.

59. The system as claimed in claim 58, wherein all said computers include a distribution update means each of which communicates via said communications link at a data transfer rate which is substantially less than the local memory read rate.

60. The system as claimed in claim 59, wherein at least some of said computers are manufactured by different manufacturers and/or have different operating systems.

61. The system as claimed in claim 43, wherein each of said plurality of substantially identical objects has a substantially identical name.

62. The system as claimed in claim 61, wherein each said computer includes a distributed run time means with the distributed run time means of each said computer able to communicate with all other computers whereby if a portion of said application program(s) running on one of said computers changes the contents of an object in that computer then the change in content for said object is propagated by the distributed run time means of said one computer to all other computers to change the content of the corresponding object in each of said other computers.

63. The system as claimed in claim 62, wherein each said application program is modified before, during, or after loading by inserting an updating propagation routine to modify each instance at which said application program writes to memory, said updating propagation routine propagating every memory write by one computer to all said other computers.

64. The system as claimed in claim 63, wherein the application program is modified in accordance with a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

65. The system as claimed in claim 64, wherein said modified application program is transferred to all said computers in accordance with a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

66. The system as claimed in claim 44, wherein each said computer includes a distributed run time means with the distributed run time means of each said computer able to communicate with all other computers whereby if a portion of said application program(s) running on one of said computers creates an object in that computer then the created object is propagated by the distributed run time means of said one computer to all the other computers.

67. The system as claimed in claim 66, wherein each said application program is modified before, during, or after loading by inserting an initialization routine to modify each instance at which said application program creates an object, said initialization routine propagating every object newly created by one computer to all said other computers.

68. The system as claimed in claim 67, wherein said inserted initialization routine modifies a pre-existing initialization routine to enable the pre-existing initialization routine to execute on creation of the first of said like plurality of objects, and to disable the pre-existing initialization routine on creation of all subsequent ones of said like plurality of objects.

69. The system as claimed in claim 68, wherein the application program is modified in accordance with a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

70. The system as claimed in claim 66, wherein said modified application program is transferred to all said computers in accordance with a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

71. The system as claimed in claim 45, wherein each said computer includes a distributed run time means with the distributed run time means of each said computer able to communicate with all other computers whereby if a portion of said application program(s) running on one of said computers no longer needs to refer to an object in that computer then the identity of the unreferenced object is transmitted by the distributed run time means of said one computer to a shared table accessible by all the other computers.

72. The system as claimed in claim 71, wherein each said application program is modified before, during, or after loading by inserting a finalization routine to modify each instance at which said application program no longer needs to refer to an object.

73. The system as claimed in claim 72, wherein said inserted finalization routine modified a pre-existing finalization routine to enable the pre-existing finalization routine to execute if all computers no longer need to refer to their corresponding object, and to disable the pre-existing finalization routine if at least one computer does not to refer to a corresponding object.

74. The system as claimed in claim 73, wherein the application program is modified in accordance with a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

75. The system as claimed in claim 71, wherein said modified application program is transferred to all said computers in accordance with a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

76. The system as claimed in claim 46, wherein said lock means includes an acquire lock routine and a release lock routine, and both said routines are included in modifications made to said application program running on all said computers.

77. The system as claimed in claim 76, wherein said lock means further includes a shared table listing said named objects in use by any said computer, a lock status for each said object, and a queue of any pending lock acquisitions.

78. The system as claimed in claim 77, wherein said lock means is located within an additional computer not running said application program and connected to said communications network.

79. The system as claimed in claim 76, wherein each said application program is modified before, during, or after loading by inserting said acquire lock routine and said release lock routine to modify each instance at which said application program acquires and releases respectively a lock on an object.

80. The system as claimed in claim 77, wherein the application program is modified in accordance with a procedure selected from the group of procedures consisting of re-compilation at loading, pre-compilation prior to loading, compilation prior to loading, just-in-time compilation, and re-compilation after loading and before execution of the relevant portion of application program.

81. The system as claimed in claim 76, wherein said modified application program is transferred to all said computers in accordance with a procedure selected from the group consisting of master/slave transfer, branched transfer and cascaded transfer.

82. The system as claimed in claim 39, further comprising a distributed runtime component adapted to provide an exchange of program and/or data over a communications link between the plurality of computers.

83-163. -163. (canceled)