System and method for distributed computation based upon the movement, execution, and interaction of processes in a network

• US 5,603,031 A
• Filed: 07/08/1993
• Issued: 02/11/1997
• Est. Priority Date: 07/08/1993
• Status: Expired due to Term

• Current Assignee: Intellectual Ventures I LLC (Intellectual Ventures LLC)
• Original Assignee: General Magic, Inc.
• Inventors: White, James E., Helgeson, Christopher S., Steedman, Douglas A.
• Primary Examiner(s): Kriess, Kevin A.
• Application Number:
  US08/090,521
• Time in Patent Office: 1,314 Days
• Field of Search: 395/650, 395/700
• US Class Current: 719/317
• CPC Class Codes: G06F 9/465 Distributed object oriented systems remote method invocation [RMI] G06F9/548
• CPC Class Codes: G06F 9/4862 the task being a mobile agent, i.e. specifically designed to migrate
• CPC Class Codes: G06F 9/54 Interprogram communication

Abstract

A distributed computing environment in which agent processes direct their own movement through a computer network. Place processes provide a computing context within which agent processes are interpreted. An agent process controls its movement from one place process to another within the network by using a ticket. An agent process which moves from one place process to another transports definitions of classes of which objects included in the agent process are members. An agent process which moves from one place process to a second place process avoids unnecessary transportation of objects included in the agent process by substituting equivalent objects which are found in the second place process. An agent process sends clones of the agent process to several place processes simultaneously. If two clones travel along paths which are coextensive for an initial portion thereof, a single clone is transported along the initial portion of the paths and other clones are formed from the single clone, thereby avoiding transferring redundant information along communications media. Two agent processes, which occupy a single place process, interact by exchanging references to one another. The single place process ensures that neither agent process receives a reference to the other agent process without simultaneously giving to the other agent process a reference to the former agent process. Unauthorized or inadvertent excessive use of network resources by an agent process, or a place process, is prevented by associating with each process a permit which defines various capabilities and resource allowances of the process.

Claims

1. A method for implementing remote programming in a computer network comprising:

defining a plurality of object-oriented classes including an agent class and a place class;

forming instructions for a computer process, said instructions including said object-oriented classes, subclasses of said object-oriented classes, and a go operation; and

interpreting said instructions on a processor in said computer network wherein, in response to said go operation, an agent process is transported to a place process and further wherein said agent process is a member of said agent class and said place process is a member of said place class.

2. The method for implementing remote programming in a computer network as in claim 1 further comprising forming said go operation within said agent process.

3. The method for implementing remote programming in a computer network as in claim 1 further comprising forming a subplace of said place process wherein said subplace is a member of said place class and said place process is a superplace of said subplace.

4. The method for implementing remote programming in a computer network as in claim 1 further comprising designating said agent process as an owner of an object.

5. The method for implementing remote programming in a computer network as in claim 4 further comprising forming within said object a digest.

6. The method for implementing remote programming in a computer network as in claim 5 further comprising interchanging for said first-mentioned object a second object at said place process wherein said second object has a second digest equivalent to said first-mentioned digest and further wherein said first object is not transported to said place process.

7. The method for implementing remote programming in a computer network as in claim 1 further comprising specifying said place process by a ticket means.

8. The method for implementing remote programming in a computer network as in claim 7 further comprising forming said ticket means within said agent process.

9. The method for implementing remote programming in a computer network as in claim 7 further comprising forming within said ticket means an address of said place process.

10. The method for implementing remote programming in a computer network as in claim 9 wherein said address is a teleaddress.

11. The method for implementing remote programming in a computer network as in claim 7 further comprising forming within said ticket means a name of said place process.

12. The method for implementing remote programming in a computer network as in claim 11 wherein said name is a telename.

13. The method for implementing remote programming in a computer network as in claim 1 further comprising:

defining a class of class objects;

forming a class object, wherein said class object (i) is a member of said class of class objects, and (ii) defines a first class which is a subclass of a selected one of said object-oriented classes; and

forming an object, said object being a member of said first class;

wherein said agent process owns said object; and

transportation of said agent process to said place process comprises transporting said object and said class object to said place process.

14. A method for implementing remote programming in a computer network comprising:

defining a plurality of object-oriented classes including an agent class and a place class;

forming instructions for a computer process including said object-oriented classes, subclasses of said object-oriented classes, and a send operation; and

interpreting said instructions on a processor in said computer network wherein, in response to said send operation, a clone Of an agent process is transported to a place process and further wherein said clone and said agent process are each a member of said agent class and said place process is a member of said place class.

15. The method for implementing remote programming in a computer network as in claim 14 further comprising forming said send operation within said agent process.

16. The method for implementing remote programming in a computer network as in claim 14 further comprising forming a subplace of said place process wherein said subplace is a member of said place class and said place process is a superplace of said subplace.

17. The method for implementing remote programming in a computer network as in claim 14 further comprising designating said agent process as an owner of an object.

18. The method for implementing remote programming in a computer network as in claim 17 wherein transportation of said clone comprises transporting a copy of said object to said place process.

19. The method for implementing remote programming in a computer network as in claim 18 further comprising forming within said object a digest.

20. The method for implementing remote programming in a computer network as in claim 19 further comprising interchanging for said copy a second object, which is different from said first-mentioned object, at said place process wherein said second object has a second digest equivalent to said first-mentioned digest and further wherein said copy is not transported to said place process.

21. The method for implementing remote programming in a computer network as in claim 14 further comprising specifying said place process by a ticket means.

22. The method for implementing remote programming in a computer network as in claim 21 further comprising forming said ticket means within said agent process.

23. The method for implementing remote programming in a computer network as in claim 21 further comprising forming within said ticket means an address of said place process.

24. The method for implementing remote programming in a computer network as in claim 23 wherein said address is a teleaddress.

25. The method for implementing remote programming in a computer network as in claim 21 further comprising forming within said ticket means a name of said place process.

26. The method for implementing remote programming in a computer network as in claim 25 wherein said name is a telename.

27. The method for implementing remote programming in a computer network as in claim 14 further wherein, in response to said send operation, a second clone of said agent process is transported to a second place process wherein said second clone is a member of said agent class and is distinct from said first-mentioned clone and further wherein said second place process is a member of said place class.

28. The method for implementing remote programming in a computer network as in claim 27 further comprising:

determining that transportation of said first clone to said first place process and of said second clone to said second place process requires transportation of said first and second clones to a single computer of a plurality of computers of said computer network;

transporting said first clone to said single computer; and

forming, in said single computer, said second clone from said first clone.

29. The method for implementing remote programming in a computer network as in claim 28 further comprising:

transporting said first clone from said single computer to said first-mentioned place process; and

transporting said second clone from said single computer to said second place process.

30. A method for interprocess communication in a computer comprising:

defining a plurality of object-oriented classes including an agent class;

forming instructions for a computer process including said object-oriented classes, subclasses of said object-oriented classes, and a meet operation; and

interpreting said instructions on a processor in said computer network wherein, in response to said meet operation, a meeting place process provides a first agent process access to a second agent process and provides said second agent process access to said first agent process and further wherein said first and second agent processes are members of said agent class.

31. The method for interprocess communication in a computer as in claim 30 wherein said meeting place process is a member of a place class in said plurality of object-oriented classes and further wherein said first and second agent processes occupy said meeting place process.

32. The method for interprocess communication in a computer as in claim 31 further comprising forming a second place process wherein:

said second place process is a member of said place class;

said second place process is a subplace of said meeting place process; and

said meeting place is a superplace of said second place.

33. A method for controlling movement of processes in a computer network, said method comprising:

defining a plurality of object-oriented classes including an agent class, a place class, and a ticket class;

forming a plurality of place processes in said computer network wherein each of said plurality of place process is a member of said place class;

forming an agent process wherein said agent process is a member of said agent class and occupies a first place process in said plurality of place processes; and

forming a ticket wherein said ticket is a member of said ticket class and defines a trip involving the movement of said agent process from said first place process to a second place process in said plurality of place processes.

34. A method for limiting capabilities of processes in a computer network, said method comprising:

defining a plurality of object-oriented classes including a process class and a permit class;

forming a process wherein said process is a member of said process class; and

forming a permit wherein said permit is a member of said permit class and specifies one or more capabilities of said process.

35. The method as in claim 34 further comprising:

defining within said process class a go operation; and

specifying within said permit whether said process is capable of performing said go operation.

36. The method as in claim 34 further comprising:

defining within said process class a send operation; and

specifying within said permit whether said process is capable of performing said send operation.

37. The method as in claim 34 further comprising:

defining within said process class a charge operation; and

specifying within said permit whether said process is capable of performing said charge operation.

38. The method as in claim 34 further comprising:

defining within said process class a terminate operation; and

specifying within said permit whether said process is capable of performing said terminate operation.

39. The method as in claim 34 further comprising specifying within said permit whether said process is capable of creating a second process, different from said first-mentioned process, wherein said second process is a member of said process class.

40. The method as in claim 34 further comprising:

defining an object-oriented place class; and

specifying within said permit whether said process is capable of creating members of said place class.

41. The method as in claim 34 further comprising specifying within said permit whether said process is restarted upon failure of said process.

42. The method as in claim 34 further comprising specifying within said permit an amount of processing that is allotted to said process.

43. The method as in claim 34 further comprising specifying within said permit a time at which said process is terminated.

44. The method as in claim 34 further comprising:

defining within said process class a restrict operation;

forming instructions for a computer process, said instructions including said classes, subclasses of said classes, and said restrict operation;

interpreting said instructions on a processor in said computer network wherein, in response to said restrict operation, a second permit, which is different from said first-mentioned permit, is formed and further wherein said second permit is a member of said permit class and specifies a group of one or more capabilities of said one or more capabilities of said process; and

restricting said process to said group of one or more capabilities specified by said second permit.

45. In a computer, a method of interpreting processes of various versions of an instruction set, said method comprising:

defining a plurality of object-oriented classes including a class of classes and a class of citations;

forming one or more class objects wherein said class objects are members of said class of classes;

forming within a first of said class objects a citation wherein said citation specifies said first class object and specifies which of said class objects are backward compatible with said first class object.

46. In a computer network having a plurality of computers, a communication process comprising:

providing a plurality of place processes within said computer network wherein each place process is a locale in one of said computers for zero or more agent processes;

specifying, by a ticket means, a trip for an agent process to a destination place process in said plurality of place processes; and

transporting, in response to a send operation within said agent process, a clone of said agent process to said destination place process.

47. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, by a second ticket means, a second trip, which is different from said first-mentioned trip, for said agent process to a second destination place process in said plurality of place processes.

48. In a computer network having a plurality of computers, the communication process as in claim 47 further comprising:

determining that said first-mentioned clone, in taking said first trip, and a second clone, in taking said second trip, are both to be transported to a single computer of said computers;

moving to said single computer said first clone; and

forming within said single computer said second clone from said first clone.

49. In a computer network having a plurality of computers, the communication process as in claim 48 further comprising transporting said first clone to said first-mentioned destination place process.

50. In a computer network having a plurality of computers, the communication process as in claim 48 further comprising transporting said second clone to said second destination place process.

51. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising transporting, in response to a go operation within said agent process, said agent process to said destination place process specified by said ticket means.

52. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying said destination place process by a name within said ticket means.

53. In a computer network having a plurality of computers, the communication process as in claim 52 wherein said name is a telename.

54. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying said destination place process by an address within said ticket means.

55. In a computer network having a plurality of computers, the communication process as in claim 54 wherein said address is a teleaddress.

56. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, within said ticket means, said destination place process by a Citation of a class of which said destination place process is a member.

57. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, within said ticket means, said destination place process by any combination of an address of said destination place process, a name of said destination place process, and a citation of a class of which said destination place process is a member.

58. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, within said ticket means, a maximum time period for said trip.

59. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, within said ticket means, a desired time period for said trip.

60. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, within said ticket means, a transportation means wherein said transportation means specifies a type of intercomputer communications means by which said clone is transported.

61. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising controlling, with a destination permit contained in said ticket means, a deadline for said agent process at said destination place process.

62. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising controlling, with a destination permit contained in said ticket means, operations that said agent process is allowed to perform at said destination place process.

63. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising controlling, with a destination permit contained in said ticket means, resources that said agent process is allowed to consume at said destination place process.

64. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising specifying, with a destination permit contained in said ticket means, a priority for said agent process at said destination place process relative to other processes at said destination place process.

65. In a computer network having a plurality of computers, the communication process as in claim 46 further comprising controlling, via a permit means, a capability that a process is allowed to have.

66. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said permit means is a native permit.

67. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said permit means is a local permit.

68. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said permit means is a temporary permit.

69. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said capability comprises resources that said process can consume.

70. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said capability comprises a deadline after which the process can not proceed.

71. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said capability comprises a priority for said process relative to other processes.

72. In a computer network having a plurality of computers, the communication process as in claim 65 wherein said capability comprises permission for said process to perform selected operations.

73. In a computer network having a plurality of computers, the communication process as in claim 46 wherein said agent process owns an object.

74. In a computer network having a plurality of computers, the communication process as is claim 73 wherein said object has a digest.

75. In a computer network having a plurality of computers, the communication process as is claim 74 wherein said transporting a clone of said agent process comprises transporting a copy of said object.

76. In a computer network having a plurality of computers, the communication process as is claim 75 further comprising interchanging for said copy a second object at said destination place process wherein said second object has a digest equivalent to said first-mentioned digest and further wherein said copy is not transported to said destination place process.

77. In a computer network having a plurality of computers, the communication process as in claim 73 further comprising using an interchanged object for said object at said destination place process thereby eliminating the need to transport said object to said destination place process.

78. In a computer network having a plurality of computers, the communication process as in claim 46 wherein said transporting a clone of said agent process further comprises entering said destination place process.

79. In a computer network having a plurality of computers, the communication process as in claim 46 wherein said transporting a clone of said agent process further comprises exiting a source place process.

80. In a computer network having a plurality of computers, the communication process as in claim 46 wherein said destination place process is a meeting place process and said meeting place process arranges a meeting between a requestor agent process and a petitioned agent process.

81. In a computer, a communication process comprising:

providing a first agent process and a second agent process;

specifying a meeting between said first and second agent processes by a petition means; and

arranging said meeting between said first and second agent processes as defined by said petition means.

82. In a computer, the communication process as in claim 81 further comprising forming said petition means within said first agent process.

83. In a computer, the communication process as in claim 81 wherein said specifying a meeting comprises specifying, within said petition means, said second agent process.

84. In a computer, the communication process as in claim 83 wherein said specifying said second agent process comprises specifying, within said petition means, said second agent by a name.

85. In a computer, the communication process as in claim 84 wherein said name is a telename.

86. In a computer, the communication process as in claim 83 wherein said specifying said second agent process comprises specifying, within said petition means, a class of which said second agent process is a member.

87. In a computer, the communication process as in claim 83 wherein said specifying said second agent process comprises specifying, within said petition means, a citation of a class of which said second agent process is a member.

88. In a computer, the communication process as in claim 81 wherein said specifying a meeting comprises specifying, within said petition means, a maximum time period for arranging said meeting.

89. In a computer, the communication process as in claim 81 wherein said arranging said meeting comprises providing to said first agent process a reference to said second agent process.

90. In a computer, the communication process as in claim 89 wherein said arranging said meeting further comprises providing to said second agent process a reference to said first agent process.

91. In a computer, the communication process as in claim 81 further comprising causing, in response to an instruction within said first agent process, performance of an operation within said second agent process.

92. In a computer, the communication process as in claim 91 wherein said first agent process owns an object.

93. In a computer, the communication process as in claim 92 further comprising providing to said second agent process a reference to said object.

94. In a computer, the communication process as in claim 93 wherein said reference is a protected reference.

95. In a computer, the communication process as in claim 92 further comprising providing to said second agent process a reference to a copy of said object.

96. In a computer, the communication process as in claim 91 wherein said second agent process owns an object.

97. In a computer, the communication process as in claim 96 further comprising providing to said first agent process a reference to said object.

98. In a computer, the communication process as in claim 97 wherein said reference is a protected reference.

99. In a computer, the communication process as in claim 96 further comprising providing to said first agent process a reference to a copy of said object.

100. In a computer network having a plurality of computers, a communication system comprising:

an agent means having a ticket means and a send operation; and

a plurality of place means wherein each place means is operative in one of said plurality of computers;

wherein said agent means is at a first place means in said plurality of place means;

said ticket means specifies a trip for said agent means to a destination place means in said plurality of place means; and

said send operation transports a clone of said agent means to said destination place means.

101. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said agent means further comprises a second ticket means, different from said first-mentioned ticket means, that specifies a second trip to a second destination place means for said agent means.

102. In a computer network having a plurality of computers, the communication system as in claim 101 wherein performance of said send operation transports a second clone of said agent means to said second destination place means.

103. In a computer network having a plurality of computers, the communication system as in claim 102 wherein:

said first-mentioned trip and said second trip both include transportation to a single computer in said plurality of computers; and

further wherein, in transporting said first

mentioned clone to said first-mentioned destination place means and said second clone to said second destination place means, performance of said send operation;

(a) transports said first clone to said single computer and

(b) forms said second clone from said first clone within said single computer.

104. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said agent means further comprises a go operation wherein said go operation transports said agent means to a third destination place means specified by a third ticket means.

105. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a name which identifies said destination place means.

106. In a computer network having a plurality of computers, the communication system as in claim 105 wherein said name is a telename.

107. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises an address for said destination place means.

108. In a computer network having a plurality of computers, the communication system as in claim 107 wherein said address is a teleaddress.

109. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a citation means which specifies a class of which said destination place means is a member.

110. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises any combination selecting from the group consisting of an address of said destination place means, a name of said destination place means, and a citation means which specifies a class of which said destination place means is a member.

111. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises means for specifying a maximum time period for said trip.

112. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises means for specifying a desired time period for said trip.

113. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a way means for specifying a type of intercomputer communications means by which said trip is to be accomplished.

114. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a permit means for controlling a deadline for said agent means at said destination place means.

115. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a permit means for controlling operations that said agent means is allowed to perform at said destination place means.

116. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a permit means for controlling resources that said agent means is allowed to consume at said destination place means.

117. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said ticket means further comprises a permit means for specifying a priority for said agent means at said destination place means relative to other agent means at said destination place means.

118. In a computer network having a plurality of computers, the communication system as in claim 100 further comprising a permit means for controlling a capability that an agent means is allowed to have.

119. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said permit means is a native permit.

120. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said permit means is a local permit.

121. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said permit means is a temporary permit.

122. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said capability comprises resources that said agent means can consume.

123. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said capability comprises a deadline after which the agent means can not proceed.

124. In a computer network having a plurality of computers, the communication system as in claim 118 further comprising other agent means wherein said capability comprises a priority for said agent means relative to said other agent means.

125. In a computer network having a plurality of computers, the communication system as in claim 118 wherein said capability comprises permission for said agent means to perform selected operations.

126. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said agent means owns an object.

127. In a computer network having a plurality of computers, the communication system as is claim 126 wherein said object has a digest.

128. In a computer network having a plurality of computers, the communication system as is claim 127 wherein a copy of said object is transported with said clone by performance of said send operation.

129. In a computer network having a plurality of computers, the communication system as is claim 128 wherein a second object at said destination place means is interchanged for said copy;

and

further wherein said second object has a digest equivalent to said first-mentioned digest, thereby obviating transportation of said copy to said destination place means.

130. In a computer network having a plurality of computers, the communication system as in claim 128 wherein said send operation uses an interchanged object for said copy at said destination place means thereby eliminating the need to transport said copy of said object to said destination place means.

131. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said place means further comprises means for entering said place means.

132. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said place means further comprises means for exiting said place means.

133. In a computer network having a plurality of computers, the communication system as in claim 100 wherein said place means further comprises meeting place means wherein said meeting place means arranges a meeting between a requestor agent means and a responder agent means.

134. In a computer, a communication system comprising:

meeting place means having a meet operation wherein said meeting place means is a locale for a plurality of agent means;

a petition means;

a first agent means in said plurality of agent means; and

a second agent means in said plurality agent means wherein;

said first and second agent means can meet with any of said plurality of agent means;

said petition means specifies a meeting between said first and second agent means; and

in response to said meet operation, said meeting place means arranges said meeting.

135. In a computer, the communication system as in claim 134 wherein said first agent means contains said petition means.

136. In a computer, the communication system as in claim 135 wherein said petition means specifies said meeting by specifying said second agent process.

137. In a computer, the communication system as in claim 136 wherein said petition means comprises a name which specifies said second agent.

138. In a computer, the communication system as in claim 137 wherein said name is a telename.

139. In a computer, the communication system as in claim 136 wherein said petition means specifies said second agent by specifying a class of which said second agent process is a member.

140. In a computer, the communication system as in claim 136 wherein said petition means comprises a citation, said citation specifying a class of which said second agent process is a member.

141. In a computer, the communication system as in claim 134 wherein said petition means defines a maximum time period for arranging said meeting.

142. In a computer, the communication system as in claim 134 further wherein said meet operation provides to said first agent means a reference to said second agent means.

143. In a computer, the communication system as in claim 142 further wherein said meet operation provides to said second agent means a reference to said first agent means.

144. In a computer, the communication system as in claim 134 further wherein said first agent means can cause performance of an operation within said second agent means.

145. In a computer, the communication system as in claim 144 wherein said first agent means owns an object.

146. In a computer, the communication system as in claim 145 further wherein said first agent means can provide to said second agent means a reference to said object.

147. In a computer, the communication system as in claim 146 wherein said reference is a protected reference.

148. In a computer, the communication means as in claim 145 further wherein said first agent means can provide to said second agent means a reference to a copy of said object.

149. In a computer, the communication system as in claim 144 wherein said second agent means owns an object.

150. In a computer, the communication system as in claim 149 further wherein said second agent means can provide to said first agent means a reference to said object.

151. In a computer, the communication system as in claim 150 wherein said reference is a protected reference.

152. In a computer, the communication system as in claim 149 further wherein said second agent means can provide to said first agent means a reference to a copy of said object.

153. In a computer network having one or more computers, a method for transferring data from a first engine process to a second engine process, said method comprising the steps of:

(a) providing means for executing one or more agent processes wherein said executing means comprises said first and second engine processes and further wherein each said agent process comprises instructions from a computer instruction set and has an execution state;

(b) providing within said computer instruction set a go instruction wherein said go instruction is contained within a first agent process executing within said first engine process and further wherein performance of said go instruction causes;

(i) suspension of execution of said first agent process by said first engine process;

(ii) representation of said first agent process such that said execution state of said first agent process is preserved;

(iii) transfer of said representation of said first agent process from said first engine process to said second engine process; and

(iv) resumption of execution of said first agent process by said second engine process;

(c) causing execution of said agent process by said first engine process, thereby causing performance of said go instruction.

154. The method of claim 153 wherein said computer instruction set is object-oriented.

155. The method of claim 154 wherein said plurality of agent processes are objects of said object-oriented computer instruction set.

156. The method of claim 153 further comprising adding data to said first agent process prior to causing performance of said go instruction;

wherein said representation of said first agent process includes said data; and

further wherein transfer of said representation of said first agent process to said second engine process includes transfer of said data.

157. The method of claim 153 wherein said first agent process comprises data representing a message to be transported from said first engine process to said second engine process;

and

further wherein transfer of said first agent process resulting from execution of said go instruction causes transfer of said data from said first engine process to said second engine process.

158. The method of claim 153 wherein said first engine process executes on a first computer and said second engine process executes on a second computer wherein said first and second computers are part of said computer network.

159. A method for transferring data from a first engine process to one or more engine processes, said method comprising:

(a) providing means for executing a plurality of agent processes which comprise instructions from a computer instruction set wherein said agent process execution means comprises said first and one or more engine processes and further wherein each said agent process has an execution state;

(b) providing within said computer instruction set a send instruction wherein said send instruction is contained within a first agent process in said plurality of agent processes and further wherein, execution of said send instruction, includes;

(i) forming one or more copies of said first agent process wherein said copies preserve and include said execution state of said first agent process;

(ii) transferring each of said copies of said first agent process from said first engine process to a respective one of said one or more engine processes; and

(iii) effectuating execution of each of said copies of said first agent process by said respective one of said one or more engine processes so as to simulate the resumed execution of said first agent process.

160. The method of claim 159 wherein, upon a condition wherein two or more of said copies of said first agent process are to be transferred from said first engine process to a single second engine process, the transfer of said two or more copies of said first agent process comprises:

transferring to said second engine process a single copy of said first agent process; and

forming within said second engine process from said single copy said two or more copies of said first agent process.

161. A method of transferring data from a first agent process which is executing within a computer system to a second agent process which is executing within said computer system wherein said first and second agent processes are occupants of a place process, said method comprising:

causing, in response to a meet instruction issued by said first agent process, execution of a procedure by said second agent process wherein said procedure is a portion of said second agent process and comprises a collection of computer instructions contained within said second agent process; and

providing to said first agent process, in response to a second instruction which is issued by said second agent process and which is part of said procedure, means for accessing said second agent process.

162. The method of claim 161 wherein said causing execution of a procedure by said second agent process comprises:

causing, in response to said meet instruction issued by said first agent process, execution of a second procedure by said place process wherein execution of said second procedure by said place process issues an instruction which causes said second agent process to execute said first-mentioned procedure.

163. The method of claim 161 wherein said means for accessing said second agent process is provided to said first agent process by said place process.

164. The method of claim 163 wherein, at approximately the time said place process provides to said first agent process said means for accessing said second agent process, said place process provides to said second agent process means for accessing said first agent process.

165. A method for transferring a first computer process from a first computer system to a second computer system, said first computer system comprising a first CPU and a first memory and said second computer system comprising a second CPU and a second memory, said method comprising:

initiating execution of said first computer process within said first CPU wherein said computer process has an execution state;

suspending execution of said first computer process within said first CPU;

representing said first computer process as data in said first memory wherein said data includes said execution state of said first computer process at the time execution of said first computer process is suspended;

transferring said data from said first memory to said second memory;

forming a second computer process on said second computer system from said data wherein said second computer process has said state of execution represented in said data; and

causing execution of said second computer process, thereby effectively simulating resumption of execution of said first computer process, within said second CPU.