Modified computer architecture with finalization of objects

• US 20060095483A1
• Filed: 04/22/2005
• Published: 05/04/2006
• Est. Priority Date: 04/23/2004
• Status: Abandoned Application

• Current Assignee: Waratek Pty Limited
• Original Assignee: Waratek Pty Limited
• Inventors: Holt, John M.
• Application Number:
  US11/111,778
• Publication Number:
  US 20060095483A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 12/00 Accessing, addressing or allocating within memory systems or architectures digital input from, or digital output to record carriers, e.g. to disk storage units, G06F3/06
• CPC Class Codes: G06F 3/038 Control and interface arrangements therefor, e.g. drivers or device-embedded control circuitry
• CPC Class Codes: G06F 3/0486 Drag-and-drop
• CPC Class Codes: G06F 3/1454 involving copying of the display data of a local workstation or window to a remote workstation or window so that an actual copy of the data is displayed simultaneously on two or more displays, e.g. teledisplay
• CPC Class Codes: G06F 9/445 Program loading or initiating bootstrapping G06F9/4401; security arrangements for program loading or initiating G06F21/57
• CPC Class Codes: G06F 9/44594 Unloading
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements

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 particular, the finalization of JAVA language classes and objects is disclosed (162, 163) so finalization only occurs when the last class or object present on all machines is no longer required.

Claims

1. A multiple computer system having at least one application program running simultaneously on a plurality of computers interconnected by a communications network, wherein a like plurality of substantially identical objects are created, each in the corresponding computer and each having a substantially identical name, and 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.

2. The system as claimed in claim 1 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.

3. The system as claimed in claim 2 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.

4. The system as claimed in claim 3 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.

5. The system as claimed in claim 2 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.

6. A plurality of computers interconnected via a communications link and operating at least one application program simultaneously wherein each said computer in operating said at least one application program needs, or no longer needs to refer to an object only in local memory physically located in each said computer, the contents of the local memory utilized by each said computer is fundamentally similar but not, at each instant, identical, and every one of said computers has a finalization routine which deletes a non-referenced object only if each one of said plurality of computers no longer needs to refer to their corresponding object.

7. The plurality of computers as claimed in claim 6 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.

8. The plurality of computers as claimed in claim 6 wherein all said distribution update means communicate via said communications link at a data transfer rate which is substantially less than the local memory read rate.

9. The plurality of computers as claimed in claim 6 wherein at least some of said computers are manufactured by different manufacturers and/or have different operating systems.

10. A method of running at least one application program on a plurality of computers simultaneously, said computers being interconnected by means of a communications network, said method comprising the steps of:

(i) creating a like plurality of substantially identical objects each in the corresponding computer and each having a substantially identical name, and

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

11. A method as claimed in claim 10 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.

12. A method as claimed in claim 11 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.

13. A method as claimed in claim 12 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.

14. A method as claimed in claim 13 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.

27. A computer program product comprising a set of program instructions stored in a storage medium and operable to permit a plurality of computers to carry out the method as claimed in claim 10 or 15.

28. A plurality of computers interconnected via a communication network and operable to ensure consistent initialization of an application program running simultaneously of said computers, said computers being programmed to carry out the method as claimed in claim 10 or 15 or being loaded with the computer program product as claimed in claim 26.

15. A method of ensuring consistent finalization of an application program to be run simultaneously on a plurality of computers interconnected via a communications network, said method comprising the steps of:

(i) scrutinizing said application program at, or prior to, or after loading to detect each program step defining an finalization routine, and

(ii) modifying said finalization routine to ensure collective deletion of corresponding objects in all said computers only when each one of said computers no longer needs to refer to their corresponding object.

16. The method claimed in claim 15 wherein step (ii) comprises the steps of:

(iii) loading and executing said finalization routine on one of said computers,

(iv) modifying said finalization routine by said one computer, and

(v) transferring said modified finalization routine to each of the remaining computers.

17. The method as claimed in claim 16 wherein said modified finalization routine is supplied by said one computer direct to each of said remaining computers.

18. The method as claimed in claim 16 wherein said modified finalization routine is supplied in cascade fashion from said one computer sequentially to each of said remaining computers.

19. The method claimed in claim 15 wherein step (ii) comprises the steps of:

(vi) loading and modifying said finalization routine on one of said computers,

(vii) said one computer sending said unmodified finalization routine to each of the remaining computers, and

(viii) each of said remaining computers modifying said finalization routine after receipt of same.

20. The method claimed in claim 19 wherein said unmodified finalization routine is supplied by said one computer directly to each of said remaining computers.

21. The method claimed in claim 19 wherein said unmodified finalization routine is supplied in cascade fashion from said one computer sequentially to each of said remaining computers.

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

(ix) 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.

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

(x) 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.

24. In a multiple thread processing computer operation in which individual threads of a single application program are simultaneously being processed each on a corresponding one of a plurality of computers interconnected via a communications link, and in which objects in local memory physically associated with the computer processing each thread have corresponding objects in the local memory of each other said computer, the improvement comprising collectively deleting all said corresponding objects when each one of said plurality of computers no longer needs to refer to their corresponding object.

25. The improvement as claimed in claim 24 wherein an object residing in the memory associated with one said thread and to be deleted has its identity communicated by the computer of said one thread to a shared table accessable by all other said computers.

26. The improvement as claimed in claim 24 wherein an object residing in the memory associated with one said thread and to be deleted has its identity transmitted to the computer associated with another said thread and is transmitted thereby to a shared table accessable by all said other computers.