Multiple machine architecture with overhead reduction

• US 20080189385A1
• Filed: 01/23/2008
• Published: 08/07/2008
• Est. Priority Date: 10/25/2005
• Status: Active Grant

• Current Assignee: Waratek Limited (Waratek Holdings Ltd.)
• Original Assignee: John M. Holt
• Inventors: Holt, John M.
• Granted Patent: US 8,209,393 B2
• Time in Patent Office: Days
• US Class Current: 709/214
• CPC Class Codes: G06F 11/2038 with a single idle spare processing component
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

A multiple computer environment is disclosed in which an application program executes simultaneously on a plurality of computers (M1, M2, . . . Mn) interconnected by a communications network (53) and in which the local memory of each computer is not maintained substantially the same by updating in due course. An address table mechanism is provided to permit access to an asset, object, or structure (ie memory location) for the purpose of updating, for example. Since not all computers have the same memory, it is not necessary for all computers to be updated and so the volume of traffic on the communications network (53) is reduced.

Claims

1. In a multiple computer system comprising a plurality of computers each including a local processor and a local memory coupled with the local processor including a first computer and a second computer interconnected via a communications link or network operating in a replicated shared memory arrangement, wherein the memory locations and/or value(s) of said local memory(ies) may be classified into a first category of memory locations each of which is replicated on two or more of said multiple computers and a second category of memory locations each of which is present only in the specific one of said multiple computers in which each said second category memory location is physically located, a method comprising:

a. maintaining a replication table listing or recording the ones of said multiple computers on which a said first category memory location is replicated.

2. A method as in claim 1, including the further step of:

a. maintaining one said replication table for each said first category memory location.

3. A method as in claim 2, including the further step of:

a. maintaining one said replication table for a plurality of first category memory locations.

4. A method as in claim 3, including the further step of:

a. maintaining one said replication table for each plurality of first category memory locations of potentially multiple pluralities.

5. A method as in claim 3, wherein said plurality of first category memory locations comprise plural memory locations of a related set of memory locations.

6. A method as in claim 5, wherein said related set of memory locations comprise an array of memory locations.

7. A method as in claim 6, wherein said array of memory locations comprise an array data structure.

8. A method as in claim 5, wherein said related set of memory locations comprise memory locations of an object or class.

9. A method as in claim 8, wherein said memory locations of an object or class comprise object fields or variables, or class fields or variables.

10. A method as in claim 1, including the further step of:

a. maintaining multiple said replication tables, one in each of said multiple computers.

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

a. maintaining multiple said replication tables, one of each said multiple tables in each of said multiple computers.

12. A method as in claim 1, including the further step of:

a. maintaining multiple said replication tables in each of said multiple computers.

13. A method as in claim 1, including the further step of:

a. maintaining one said replication table, for all said multiple computers on a further server computer.

14. A method as in claim 1, wherein said first category memory locations of a said computer do not access or refer to any second category memory locations of the same computer.

15. A method as in claim 14, wherein said access includes memory addresses of said second category memory locations.

16. A method as in claim 14, wherein said access includes pointers, references, handles, or links to or of said second category memory locations.

17. A method as in claim 1, wherein said memory locations comprise object(s).

18. A method as in claim 1, wherein said memory locations comprise class(es).

19. A method as in claim 1, wherein said memory locations comprise object field(s) or class field(s).

20. A method as in claim 1, wherein said memory locations comprise data structure(s).

21. A method as in claim 1, wherein said memory locations comprise array data structure(s).

22. A method as in claim 1, wherein said memory locations comprise elements of array data structure(s).

23. A method as in claim 1, wherein said memory locations comprise libraries, linked libraries, or dynamically linked libraries.

24. A method as in claim 1, including the further step of:

a. maintaining multiple said replication table(s) of first category memory locations, one in each of said multiple computers, where each said replication table of each one of said multiple computers lists or records first category memory locations replicated on the same one of said multiple computers.

25. A method as in claim 24, wherein each said replication table of each one of said multiple computers does not list or record first category memory locations which are not replicated on the same one of said multiple computers.

26. A method as in claim 1, including the further step of:

a. maintaining one said replication table for each said first category memory location, on each one of said multiple computers on which said first category memory location is replicated.

27. A method as in claim 1, including the further step of:

a. maintaining multiple said replication tables for each said first category memory location, one in each of said multiple computers on which said first category memory location is replicated.

28. A method as in claim 1, including the further step of:

a. maintaining one said replication table for a plurality of said first category memory locations, on each one of said multiple computers on which said plurality of first category memory locations are replicated.

29. A method as in claim 1, including the further step of:

a. maintaining multiple said replication table for a plurality of said first category memory location, one in each of said multiple computers on which said plurality of first category memory locations are replicated.

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

a. not maintaining said replication table(s) of a first category memory location on ones of said multiple computers in which said first category memory location is not replicated.

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

a. not maintaining said replication table(s) of a plurality of first category memory locations on ones of said multiple computers in which said plurality of first category memory locations are not replicated.

32. A method as in claim 28, wherein said plurality of first category memory locations comprise plural memory locations of a related set of memory locations.

33. A method as in claim 32, wherein said related set of memory locations comprise an array of memory locations.

34. A method as in claim 33, wherein said array of memory locations comprise an array data structure.

35. A method as in claim 32, wherein said replicated set of memory locations comprise memory locations of an object or class.

36. A method as in claim 35, wherein said memory locations of an object or class, comprise object fields or variables, or class fields or variables.

37. A method as in claim 1, including the further steps of:

a. substantially simultaneously updating said first category memory locations of the other ones of said computers with any changes made to a first category memory location of any one of said computers.

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

a. utilizing said replication table(s) to determine which ones of said multiple computers are to be said substantially simultaneously updated.

39. A method as in claim 1, including the further step of:

a. substantially simultaneously updating said first category memory locations of the other ones of said computers with any changes made to a first category memory location of any one of said computers;

b. utilizing said replication table(s) to determine which ones of said multiple computers are to be said substantially simultaneously updated; and

c. not updating said second category memory locations of the other ones of said computers with any changes made to a second category memory location of any one of said computers.

40. A method as in claim 39, wherein said substantially simultaneous updating includes updating a first category memory locations of the other ones of said computers on which said first category memory locations is replicated, with any changes made to said first category memory locations of any one of said computers.

41. A method as in claim 39, wherein said substantially simultaneous updating excludes updating said first category memory locations of the other ones of said computers on which said first category memory locations is not replicated.

42. A method as in claim 1, further comprising performing the classification into first and second categories including:

classifying said the memory locations and/or value(s) of said local memory(ies) into the first category of memory locations each of which is replicated on two or more computers of said multiple computers; and

classifying said local memories into a second category of memory locations each of which is present only in the specific one of said multiple computers in which each said second category of memory location is physically located.

43. A method as in claim 1, wherein said local memory(ies) of each said computer are independent of said local memory(ies) of each other computer.

44. A method as in claim 1, wherein said local processors may only access said local memory(ies) of the same computer in which the local processor is located.

45. A method as in claim 1, wherein at least a first application program written to operate on a single one of said computers, is operating substantially simultaneously on different ones of said multiple computers.

46. A method as in claim 45, wherein said application program operating substantially simultaneously on each of said different ones of said computers, may only access said local memory(ies) of the same computer.

47. A method as in claim 46, wherein said access is satisfied by said local memory(ies) of the same computer independently of (or without the aid of) said local memory(ies) of any other computer.

48. A method as in claim 46, wherein said access includes reading and/or writing content or values stored or resident within said local memory(ies) of the same computer.

49. A method as in claim 47, wherein said access includes reading and/or writing content or values stored or resident within said local memory(ies) of the same computer.

50. A method as in claim 46, wherein said access is restricted to reading and/or writing content or values stored or resident within said local memory(ies) of the same computer.

51. A method as in claim 47, wherein said access is restricted to reading and/or writing content or values stored or resident within said local memory(ies) of the same computer.

52. A method as in claim 46, wherein said access includes reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

53. A method as in claim 47, wherein said access includes reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

54. A method as in claim 48, wherein said access includes reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

55. A method as in claim 46, wherein said access is restricted to reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

56. A method as in claim 47, wherein said access is restricted to reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

57. A method as in claim 48, wherein said access is restricted to reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer.

58. A method as in claim 46, wherein at least one memory location and/or memory value of said application program is substantially similarly replicated in said local memory(ies) of said different ones of said multiple computers.

59. A method as in claim 55, wherein said substantially similarly replicated memory location(s) and/or value(s) are stored non-identically in said local memory(ies) of said different ones of said multiple computers.

60. A method as in claim 56, wherein said substantially similarly replicated memory location(s) and/or memory value(s) are updated through in-due-course updating to remain substantially similar upon occasion of any one of said plurality of computers simultaneously operating said application program modifying, or causing to be modified, the value(s) or content(s) of said substantially similarly replicated memory location(s) and/or memory value(s).

61. A method as in claim 60, wherein said in-due-course updating provides that said replicated memory locations are updated to remain substantially similar upon occasion of any one of said computers simultaneously operating said application program causing modification of the contents of said replicated memory location.

62. A method as in claim 60, wherein each said substantially similarly replicated memory location(s) and/or value(s) of each one of said multiple computers is identified with a substantially similar identifier.

63. A method as in claim 1, wherein:

said local memory(ies) of each said computer are independent of said local memory(ies) of each other computer;

said local processors may only access said local memory(ies) of the same computer in which the local processor is located;

at least a first application program written to operate on a single one of said computers, is operating substantially simultaneously on different ones of said multiple computers;

said application program operating substantially simultaneously on each of said different ones of said computers, may only access said local memory(ies) of the same computer;

said access is satisfied by said local memory(ies) of the same computer independently of (or without the aid of) said local memory(ies) of any other computer;

said access includes reading and/or writing content or values stored or resident within said local memory(ies) of the same computer, or said access is restricted to reading and/or writing content or values stored or resident within said local memory(ies) of the same computer;

said access includes reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer, or said access is restricted to reading and/or writing content or values of real or virtual memory addresses of or resident within said local memory(ies) of the same computer;

at least one memory location and/or memory value of said application program is substantially similarly replicated in said local memory(ies) of said different ones of said multiple computers;

said substantially similarly replicated memory location(s) and/or value(s) are stored non-identically in said local memory(ies) of said different ones of said multiple computers;

said substantially similarly replicated memory location(s) and/or memory value(s) are updated through in-due-course updating to remain substantially similar upon occasion of any one of said plurality of computers simultaneously operating said application program modifying, or causing to be modified, the value(s) or content(s) of said substantially similarly replicated memory location(s) and/or memory value(s);

said in-due-course updating provides that said replicated memory locations are updated to remain substantially similar upon occasion of any one of said computers simultaneously operating said application program causing modification of the contents of said replicated memory location; and

wherein each said substantially similarly replicated memory location(s) and/or value(s) of each one of said multiple computers is identified with a substantially similar identifier.

64. A method as in claim 1, further comprising:

maintaining multiple said replication table(s) of first category memory locations, one in each of said multiple computers, where each said replication table of each one of said multiple computers lists or records first category memory locations replicated on the same one of said multiple computers; and

substantially simultaneously updating said first category memory locations of the other ones of said computers with any changes made to a first category memory location of any one of said computers.

65. A computer program stored on a computer readable memory device comprising instructions which, when executed on a computer, perform in at least one single computer capable of interoperating with at least one other computer coupled to at least one said single computer at least intermittently via a communications network to form a multiple computer system having a plurality of computers wherein each computer has a local memory and the multiple computer system operating in a replicated shared memory arrangement, a method of classifying said local memory(ies) comprising the steps of:

classifying said the memory locations and/or value(s) of said local memory(ies) into the first category of memory locations each of which is replicated on two or more computers of said multiple computers;

classifying said local memories into a second category of memory locations each of which is present only in the specific one of said multiple computers in which each said second category of memory location is physically located; and

maintaining a replication table listing or recording the ones of said multiple computers on which a said first category memory location is replicated.

66. A multiple computer system comprising:

a plurality of computers each including a local processor and a local memory coupled with the local processor including a first computer and a second computer interconnected via a communications link or network operating in a replicated shared memory arrangement;

first means for classifying said memory locations and/or value(s) of said local memory(ies) into the first category of memory locations each of which is replicated on two or more computers of said multiple computers; and

second means for classifying said local memories into a second category of memory locations each of which is present only in the specific one of said multiple computers in which each said second category of memory location is physically located; and

means for maintaining a replication table listing or recording the ones of said multiple computers on which a said first category memory location is replicated.