Modified machine architecture with machine redundancy

• US 20080195617A1
• Filed: 01/23/2008
• Published: 08/14/2008
• Est. Priority Date: 10/25/2005
• Status: Abandoned Application

• Current Assignee: John M. Holt
• Original Assignee: John M. Holt
• Inventors: Holt, John M.
• Application Number:
  US12/011,215
• Publication Number:
  US 20080195617A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/073 in a memory management context, e.g. virtual memory or cache management memory management G06F12/00; testing of static memory units G11C29/00
• CPC Class Codes: G06F 11/0793 Remedial or corrective actions recovery from an exception in an instruction pipeline G06F9/3861; by retry G06F11/1402; for recovering from a failure of a protocol instance or entity H04L69/40
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms

Abstract

A multiple computer system in which a single application program, written to execute on only a single computer, runs on multiple computers is disclosed. Each computer (M1, . . . Mn) has a substantially identical local memory structure. Synchronizing locks are used to ensure that only one computer is able to write to a local memory location and all other computers are prohibited to writing to their corresponding memory location. In the event of failure of a computer holding such a lock, the lock is arranged to be released. The released lock can then be re-allocated to another computer which has not failed. In this way failure of one, or a sequence of, computers, does not result in failure of the whole computer system.

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, a method comprising:

acquiring (allocating) and releasing (de-allocating) replicated mutual-exclusion permission(s) in sequence by or between a plurality of computers of said multiple computer system; and

following a failure of any particular one of the plurality of computers which has acquired but not released any particular mutual-exclusion permission(s);

a. releasing or revoking or causing to be released or revoked said particular mutual-exclusion permission(s) so that an application program executing on non-failed ones of said plurality of computers can continue execution in an uninterrupted manner by acquiring (allocating) and releasing (deallocating) said particular mutual-exclusion permission(s) of said failed computer.

2. A method as in claim 1, wherein said mutual-exclusion permission(s) comprise synchronization (or synchronizing) lock operations.

3. A method as in claim 1, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including the step of:

b. allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

4. A method as in claim 2, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including the step of:

b. allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

5. A method as in claim 3, further including:

c. detecting said computer failure;

d. determining whether the failed computer held any unreleased mutual-exclusion permissions prior to said computer failure;

e. determining the identity of said other computer(s) awaiting acquisition of the same mutual-exclusion permission(s); and

f. allocating said particular mutual-exclusion permission(s) to the other computer(s) awaiting acquisition of the same mutual-exclusion permission(s) identified in step (e).

6. A method as in claim 5, further including the steps of:

g. maintaining a table of allocated mutual-exclusion permission(s) which table includes the identity of the computer to which each mutual-exclusion permission has been allocated (or acquired);

h. carrying out step (e) by consulting said table of allocated mutual-exclusion permission(s); and

i. updating said table of allocated mutual-exclusion permission(s) after carrying out the allocation of said particular mutual-exclusion permission(s) to the other computers as in step (f).

7. A method as in claim 6, further including the steps of:

j. requiring any mutual-exclusion permission(s) requesting computer to interrogate each possible mutual-exclusion permission holding computer as to whether it holds the particular mutual-exclusion permission; and

k. utilizing the absence of a positive answer to the interrogation in step (j) to trigger allocation of said particular mutual-exclusion permission to said requesting computer so that any mutual-exclusion permission holding computer which fails to communicate a positive answer is determined to be incapable of communicating said positive answer and as a result permitting allocation of said particular mutual-exclusion permission to said mutual-exclusion permission requesting computer.

8. A method as in claim 7, wherein the period of said absence of a positive answer is limited to a predetermined duration of time.

9. A method as in claim 7, wherein the period of said absence of a positive answer is limited to a dynamically determined duration of time.

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

identifying any unreleased mutual-exclusion permission(s) held by a failed computer; and

identifying any computers awaiting allocation of said unreleased mutual-exclusion permission(s).

11. A method as in claim 10, wherein:

said identifying any unreleased mutual-exclusion permissions(s) comprises querying a table of mutual-exclusion permissions allocated;

said identifying any computers awaiting allocation comprises querying a queue of computers awaiting mutual-exclusion allocation; and

said interrogation is repeated at predetermined time intervals in response to a reply thereto indicating no failure of the interrogated computer to verify the continued non-failed status of each computer.

12. A method as in claim 1, further including interrogating each possible mutual-exclusion permission holding computer from among the plurality of computers and absence of receiving a reply to said interrogation from any particular computer then detecting the non-replying computer as a failed computer.

13. 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;

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

14. 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.

15. A method as in claim 14, 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.

16. A method as in claim 15, 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.

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

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

19. A method as in claim 15, 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.

20. A method as in claim 16, 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.

21. A method as in claim 15, 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.

22. A method as in claim 16, 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.

23. A method as in claim 17, 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.

24. A method as in claim 15, 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.

25. A method as in claim 16, 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.

26. A method as in claim 17, 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.

27. A method as in claim 15, 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.

28. A method as in claim 24, 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.

29. A method as in claim 25, 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).

30. A method as in claim 29, 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.

31. 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); and

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.

32. A method as in claim 11, 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); and

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.

35. A computer program product as in claim 1, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including the step of:

b. allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

36. A computer program product as in claim 2, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including the step of:

b. allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

37. A computer program product as in claim 3, further including:

c. detecting said computer failure;

d. determining whether the failed computer held any unreleased mutual-exclusion permissions prior to said computer failure;

e. determining the identity of said other computer(s) awaiting acquisition of the same mutual-exclusion permission(s); and

f. allocating said particular mutual-exclusion permission(s) to the other computer(s) awaiting acquisition of the same mutual-exclusion permission(s) identified in step (e).

38. A computer program product as in claim 5, further including the steps of:

g. maintaining a table of allocated mutual-exclusion permission(s) which table includes the identity of the computer to which each mutual-exclusion permission has been allocated (or acquired);

h. carrying out step (e) by consulting said table of allocated mutual-exclusion permission(s); and

i. updating said table of allocated mutual-exclusion permission(s) after carrying out the allocation of said particular mutual-exclusion permission(s) to the other computers as in step (f).

39. A computer program product as in claim 6, further including the steps of:

j. requiring any mutual-exclusion permission(s) requesting computer to interrogate each possible mutual-exclusion permission holding computer as to whether it holds the particular mutual-exclusion permission; and

k. utilizing the absence of a positive answer to the interrogation in step (j) to trigger allocation of said particular mutual-exclusion permission to said requesting computer so that any mutual-exclusion permission holding computer which fails to communicate a positive answer is determined to be incapable of communicating said positive answer and as a result permitting allocation of said particular mutual-exclusion permission to said mutual-exclusion permission requesting computer.

40. A computer program product as in claim 7, wherein the period of said absence of a positive answer is limited to a predetermined duration of time.

41. A computer program product as in claim 7, wherein the period of said absence of a positive answer is limited to a dynamically determined duration of time.

51. A multiple computer system as in claim 5, further including:

g. means for maintaining a table of allocated mutual-exclusion permission(s) which table includes the identity of the computer to which each mutual-exclusion permission has been allocated (or acquired);

h. means for carrying out step (e) by consulting said table of allocated mutual-exclusion permission(s); and

i. means for updating said table of allocated mutual-exclusion permission(s) after carrying out the allocation of said particular mutual-exclusion permission(s) to the other computers as in step (f).

52. A multiple computer system as in claim 51, further including:

j. means for requiring any mutual-exclusion permission(s) requesting computer to interrogate each possible mutual-exclusion permission holding computer as to whether it holds the particular mutual-exclusion permission; and

k. means for utilizing the absence of a positive answer to the interrogation in step (j) to trigger allocation of said particular mutual-exclusion permission to said requesting computer so that any mutual-exclusion permission holding computer which fails to communicate a positive answer is determined to be incapable of communicating said positive answer and as a result permitting allocation of said particular mutual-exclusion permission to said mutual-exclusion permission requesting computer.

53. A multiple computer system as in claim 52, wherein the period of said absence of a positive answer is limited to a predetermined duration of time.

54. A multiple computer system as in claim 52, wherein the period of said absence of a positive answer is limited to a dynamically determined duration of time.

55. A multiple computer system as in claim 54, further including:

means for identifying any unreleased mutual-exclusion permission(s) held by a failed computer; and

means for identifying any computers awaiting allocation of said unreleased mutual-exclusion permission(s).

56. A multiple computer system as in claim 55, wherein:

said identifying any unreleased mutual-exclusion permissions(s) comprises querying a table of mutual-exclusion permissions allocated; and

said identifying any computers awaiting allocation comprises querying a queue of computers awaiting mutual-exclusion allocation.

57. A multiple computer system as in claim 56, further including means for interrogating each possible mutual-exclusion permission holding computer from among the plurality of computers and absence of receiving a reply to said interrogation from any particular computer then detecting the non-replying computer as a failed computer.

58. A multiple computer system as in claim 55, wherein said interrogation is repeated at predetermined time intervals in response to a reply thereto indicating no failure of the interrogated computer to verify the continued non-failed status of each computer.

79. A multiple computer system as in claim 56, 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); and

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.

33. 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 comprising the steps of:

acquiring (allocating) and releasing (de-allocating) replicated mutual-exclusion permission(s) in sequence by or between a plurality of computers of said multiple computer system; and

following a failure of any particular one of the plurality of computers which has acquired but not released any particular mutual-exclusion permission(s);

a. releasing or revoking or causing to be released or revoked said particular mutual-exclusion permission(s) so that an application program executing on non-failed ones of said plurality of computers can continue execution in an uninterrupted manner by acquiring (allocating) and releasing (deallocating) said particular mutual-exclusion permission(s) of said failed computer.

34. A computer program product as in claim 33, wherein said mutual-exclusion permission(s) comprise synchronization (or synchronizing) lock operations.

42. A computer program product as in claims 33-41, further including the steps of:

identifying any unreleased mutual-exclusion permission(s) held by a failed computer; and

identifying any computers awaiting allocation of said unreleased mutual-exclusion permission(s).

43. A computer program product as in claim 42, wherein:

said identifying any unreleased mutual-exclusion permissions(s) comprises querying a table of mutual-exclusion permissions allocated; and

said identifying any computers awaiting allocation comprises querying a queue of computers awaiting mutual-exclusion allocation.

44. A computer program product as in claims 33-43, further including interrogating each possible mutual-exclusion permission holding computer from among the plurality of computers and absence of receiving a reply to said interrogation from any particular computer then detecting the non-replying computer as a failed computer.

45. A computer program product as in claim 44, wherein said interrogation is repeated at predetermined time intervals in response to a reply thereto indicating no failure of the interrogated computer to verify the continued non-failed status of each computer.

46. 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;

means for acquiring (allocating) and releasing (de-allocating) replicated mutual-exclusion permission(s) in sequence by or between a plurality of computers of said multiple computer system; and

means for releasing or revoking or causing to be released or revoked said particular mutual-exclusion permission(s) following a failure of any particular one of the plurality of computers which has acquired but not released any particular mutual-exclusion permission(s) so that an application program executing on non-failed ones of said plurality of computers can continue execution in an uninterrupted manner by acquiring (allocating) and releasing (deallocating) said particular mutual-exclusion permission(s) of said failed computer.

47. A multiple computer system as in claim 46, wherein said mutual-exclusion permission(s) comprise synchronization (or synchronizing) lock operations.

48. A multiple computer system as in claim 46, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including:

b. means for allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

49. A multiple computer system as in claim 47, wherein at the time of said computer failure at least one other of the plurality of computers is awaiting allocation of said particular mutual-exclusion permission(s), and further including:

b. means for allocating said specific mutual-exclusion permission(s) to the, or one of, said at least one other of the plurality of computers awaiting allocation of said particular mutual-exclusion permission(s).

50. A multiple computer system as in claim 48, further including:

c. means for detecting said computer failure;

d. means for determining whether the failed computer held any unreleased mutual-exclusion permissions prior to said computer failure;

e. means for determining the identity of said other computer(s) awaiting acquisition of the same mutual-exclusion permission(s); and

f. means for allocating said particular mutual-exclusion permission(s) to the other computer(s) awaiting acquisition of the same mutual-exclusion permission(s) identified in step (e).

59. A multiple computer system as in claim 46, wherein said local memory(ies) of each said computer are independent of said local memory(ies) of each other computer.

60. A multiple computer system as in claim 46, wherein said local processors may only access said local memory(ies) of the same computer in which the local processor is located.

61. A multiple computer system as in claim 46, 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.

62. A multiple computer system as in claim 61, 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.

63. A multiple computer system as in claim 62, 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.

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

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

66. A multiple computer system as in claim 62, 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.

67. A multiple computer system as in claim 63, 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.

68. A multiple computer system as in claim 62, 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.

69. A multiple computer system as in claim 63, 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.

70. A multiple computer system as in claim 64, 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.

71. A multiple computer system as in claim 62, 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.

72. A multiple computer system as in claim 63, 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.

73. A multiple computer system as in claim 64, 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.

74. A multiple computer system as in claim 62, 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.

75. A multiple computer system as in claim 71, 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.

76. A multiple computer system as in claim 72, 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).

77. A multiple computer system as in claim 76, 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.

78. A multiple computer system as in claim 46, 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); and

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.