US 6,438,614 B2Grant
Polymorphic token based control
Issue Date:2002-08-20
•22 Claims
•4 Drawing Sheets
Abstract
The protocol for controlling a network is encapsulated within the token circulated through the token ring network. Each computer in the network that receives the token examines the token and implements the network protocol specified in the token. In this manner, the protocol of the network can be easily changed, and automatically promulgated throughout the network.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Kenneth Arnold
- James H. Waldo
Application Information
Application Number:US 09/044,934
Filing Date:1998-03-20
Priority Date:1998-03-20
Art Unit:7
Classifications
IPC:
G06F 1516G06F 15177
Field of Search:
709200709231709225709220709221709230709228709250709251707203713200713201713100717 11
Patent Drawings (4 sheets)
Description
RELATED APPLICATIONS
[0002] The following identified U.S. patent applications are relied upon and are incorporated by reference in this application.
[0003] Provisional U.S. Patent Application No. 60/076,048, entitled “Distributed Computing System,” filed on Feb. 26, 1998.
[0004] U.S. patent application Ser. No. 09/044,923, entitled “Method and System for Leasing Storage” and filed on the same date herewith.
[0005] U.S. patent application Ser. No. 09/044,838, entitled “Method, Apparatus, and Product for Leasing of Delegation Certificates in a Distributed System” and filed on the same date herewith.
[0006] U.S. patent application Ser. No. 09/044,834, entitled “Method, Apparatus and Product for Leasing of Group Membership in a Distributed System” and filed on the same date herewith.
[0007] U.S. patent application Ser. No. 09/044,916, entitled “Leasing for Failure Detection” and filed on the same date herewith.
[0008] U.S. patent application Ser. No. 09/044,933, entitled “Method for Transporting Behavior in Event Based System” and filed on the same date herewith.
[0009] U.S. patent application Ser. No. 09/044,919, entitled “Deferred Reconstruction of Objects and Remote Loading for Event Notification in a Distributed System” and filed on the same date herewith.
[0010] U.S. patent application Ser. No. 09/044,938, entitled “Method and Apparatus for Remote Method Invocation” and filed on the same date herewith.
[0011] U.S. patent application Ser. No. 09/045,652, entitled “Method and System for Deterministic Hashes to Identify Remote Methods” and filed on the same date herewith.
[0012] U.S. patent application Ser. No. 09/044,790, entitled “Method and Apparatus for Determining Status of Remote Objects in a Distributed System” and filed on the same date herewith.
[0013] U.S. patent application Ser. No. 09/044,930, entitled “Downloadable Smart Proxies for Performing Processing Associated with a Remote Procedure Call in a Distributed System” and filed on the same date herewith.
[0014] U.S. patent application Ser. No. 09/044,917, entitled “Suspension and Continuation of Remote Methods” and filed on the same date herewith.
[0015] U.S. patent application Ser. No. 09/044,835, entitled “Method and System for Multi-Entry and Multi-Template Matching in a Database” and filed on the same date herewith.
[0016] U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications in a Database” and filed on the same date herewith.
[0017] U.S. patent application Ser. No. 09/044,945, entitled “Method and System for Typesafe Attribute Matching in a Database” and filed on the same date herewith.
[0018] U.S. patent application Ser. No. 09/044,931, entitled “Dynamic Lookup Service in a Distributed System” and filed on the same date herewith.
[0019] U.S. patent application Ser. No. 09/044,939, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System” and filed on the same date herewith.
[0020] U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service” and filed on the same date herewith.
[0021] U.S. patent application Ser. No. 09/044,932, entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System” and filed on the same date herewith.
[0022] U.S. patent application Ser. No. 09/030,840, entitled “Method and Apparatus for Dynamic Distributed Computing Over a Network” and filed on Feb. 26, 1998.
[0023] U.S. patent application Ser. No. 09/044,936, entitled “An Interactive Design Tool for Persistent Shared Memory Spaces” and filed on the same date herewith.
[0024] U.S. patent application Ser. No. 09/044,915, entitled “Stack-Based Access Control” and filed on the same date herewith.
[0025] U.S. patent application Ser. No. 09/044,944, entitled “Stack-Based Security Requirements” and filed on the same date herewith.
[0026] U.S. patent application Ser. No. 09/044,837, entitled “Per-Method Designation of Security Requirements” and filed on the same date herewith.
FIELD OF THE INVENTION
[0027] This invention relates generally to local area networks and, more specifically, to token passing in a token ring local area network.
BACKGROUND OF THE INVENTION
[0028] Computers in a computer network often share a limited number of resources. One conventional method of allocating access between shared resources involves passing a “token” circularly to each computer in the network. The computers agree ahead of time that when using this token protocol, only the computer that has possession of the token may access the resource. A popular example of a network using a token passing algorithm is a token ring network.
[0029] Token ring networks are baseband networks, which means that all the transmission capacity (i.e., network bandwidth) of the network media is used by one signal. Because only one signal at a time can be transmitted over the network, multiple computers in a token ring network must not transmit simultaneously. This is accomplished using a token access protocol.
[0030] In the token access protocol, computers in the network agree to continuously circulate an information frame to all the computers in the network. When a computer wants to send a message, it waits until it possesses the empty frame, and then modifies the frame by inserting: its message, a destination identifier, and a “token.” The token may simply be, for example, a bit field in the frame that the inserting computer changes to a 1 to indicate a token is present or a 0 to indicate an empty frame.
[0031] The frame is examined by each computer as it is passed around the network. The destination computer copies the message from the frame and changes the token back to zero. The originating computer, when it receives the frame, can verify that its message was received by noticing that the token has been set to zero. The originator then removes the message from the frame and passes the empty frame to the next computer in the network.
[0032] Although conventional token ring networks are effective at preventing data collisions, they have disadvantages. In particular, in order to implement a token ring network, all the computers in the network must agree ahead of time on the appropriate protocol to use in passing the message frame. This can be difficult, if, for example, the network administrator wishes to change the protocol of the token ring, as each computer must be updated before the network is operational. It is therefore desirable to improve token ring networks.
SUMMARY OF THE INVENTION
[0033] Objects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objects and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims.
[0034] To achieve the objects and in accordance with the purpose of the invention, as embodied and broadly described herein, a first aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network including a plurality of computers, the method comprises the steps of: (1) creating a token object containing methods defining an updated version of the protocol; (2) sequentially passing the token object to each computer in the network; and (3) updating the protocol used by each of the plurality of computers with the methods defining the updated version of the protocol while the token object is present at each computer.
[0035] A second aspect consistent with the present invention is directed to a token ring network. The network comprises a plurality of computers coupled together and a token ring object. The token ring object includes methods and data that define a protocol for the token ring network, the token ring object is sequentially transferred to each of the plurality of computers, and when one of the plurality of computers has received possession of the token ring object, it adopts the protocol defined by the token ring object when the protocol defined by the token ring object is different than the protocol in use by the computer.
[0036] Further, a third aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network. The method includes the steps of: (1) receiving a token object at a first computer in the network; (2) consulting the token object, and when the token object indicates that a new protocol is to be used to transmit information on the network, updating an older version of the protocol stored at the first computer; and (3) transmitting the token object to a second computer in the network, the second computer being determined based on information in the token object.
[0037] Further, an additional aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network. The method includes the steps of: (1) receiving a token object defining a protocol of the network; and (2) sending the object using the protocol defined in the token object.
[0038] Still further, an additional aspect consistent with the present invention includes a computer readable memory device containing token including an indication of a protocol to be used when communicating in a network.
BRIEF DESCRIPTION OF THE DRAWINGS
[0039] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate several embodiments consistent with this invention and, together with the description, help explain the principles of the invention. In the drawings,
[0040] FIG. 1 is a high-level diagram of a token ring network;
[0041] FIG. 2 is a block diagram illustrating an exemplary embodiment of a computer used in the token ring network;
[0042] FIG. 3 is a diagram illustrating an embodiment of a token object consistent with the present invention; and
[0043] FIG. 4 is a flow chart illustrating methods consistent with the present invention.
DETAILED DESCRIPTION
[0044] A token ring network is disclosed in which tokens passed between computers in the network define a protocol, or at least a portion of the protocol, for the token ring network. Each computer in the network that receives the token examines the token and implements the network protocol specified in the token. Any computer having appropriate permission may change or update the protocol in the token, and thereby change the protocol for the entire network.
[0045] Reference will now be made in detail to the embodiments of the invention, examples of which are illustrated in the accompanying drawings.
System Overview
[0046] FIG. 1 is a high level diagram of a token ring network 100 made up of four distributed computers 102, 104, 106, and 108 passing a token object in the counter clockwise direction through network media 120. The token object is preferably passed between computers 102-108 using some form of remote object passing mechanism, such as the Java remote invocation system (Java RMI). Additionally, one of computers 102-108 may act as a gateway to a larger token ring network or to a non token ring network. As shown in FIG. 1, computer 106 acts as a gateway to the Internet network 110.
[0047] In exemplary distributed system 100, different computers and devices are federated into what appears to the user to be a single system. By appearing as a single system, the distributed system 100 provides the simplicity of access and the power of sharing that can be provided by a single system without giving up the flexibility and personalized response of a personal computer or workstation. Distributed system 100 may contain thousands of devices operated by users who are geographically disperse, but who agree on basic notions of trust, administration, and policy.
[0048] Within the distributed 100 system are various logical groupings of services provided by one or more devices, and each such logical grouping is known as a Djinn. A “service” refers to a resource, data, or functionality that can be accessed by a user, program, device, or another service and that can be computational, storage related, communication related, or related to providing access to another user. Examples of services provided as part of a Djinn include devices, such as printers, displays, and disks; software, such as applications or utilities; information, such as databases and files; and users of the system.
[0049] Both users and devices may join a Djinn. When joining a Djinn, the user or device adds zero or more services to the Djinn and may access, subject to security constraints, any one of the services it contains. Thus, devices and users federate into a Djinn to share access to its services. The services of the Djinn appear programmatically as objects of the Java programming environment, which may include other objects, software components written in different programming languages, or hardware devices. A service has an interface defining the operations that can be requested of that service, and the type of the service determines the interfaces that make up that service.
[0050] The Java RMI and its relationship with computers 102-108 and token ring network 100 will now briefly be described with reference to FIG. 2.
[0051] FIG. 2 depicts computer 102 in greater detail showing a number of the software components of the distributed system 100. Computer 102 includes a memory 202, a secondary storage device 204, a central processing unit (CPU) 206, an input device 208, and a video display 210. The memory 202 includes a lookup service 212, a discovery server 214, and a Java™ runtime system 216. The Java runtime system 216 includes the Java™ remote method invocation system (RMI) 218 and a Java™ virtual machine 220. The secondary storage device 204 includes a JavaSpace™ 222.
[0052] The exemplary distributed system 100 is based on the Java programming environment and thus makes use of the Java runtime system 216. The Java runtime system 216 includes the Java API, allowing programs running on top of the Java runtime system to access, in a platform-independent manner, various system functions, including windowing capabilities and networking capabilities of the host operating system. Since the Java API provides a single common API across all operating systems to which the Java runtime system is ported, the programs running on top of a Java runtime system run in a platform-independent manner, regardless of the operating system or hardware configuration of the host platform. The Java runtime system 216 is provided as part of the Java software development kit available from Sun Microsystems of Mountain View, Calif.
[0053] The Java virtual machine 220 also facilitates platform independence. The Java virtual machine 220 acts like an abstract computing machine receiving instructions from programs in the form of byte codes and interpreting these byte codes by dynamically converting them into a form for execution, such as object code, and executing them. RMI 218 facilitates remote method invocation by allowing objects executing on one computer or device to invoke methods of an object on another computer or device. Both RMI and the Java virtual machine are also provided as part of the Java software development kit.
[0054] The lookup service 212 defines the services that are available for a particular Djinn. That is, there may be more than one Djinn and, consequently, more than one lookup service within the exemplary distributed system 100. The lookup service 212 contains one object for each service within the Djinn, and each object contains various methods that facilitate access to the corresponding service. The lookup service 212 and its access are described in greater detail in co-pending U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service” which has been previously incorporated by reference.
[0055] The discovery server 214 detects when a new device is added to the exemplary distributed system 100, during a process known as boot and join or discovery, and when such a new device is detected the discovery server passes a reference to the lookup service 212 to the new device so that the new device may register its services with the lookup service and become a member of the Djinn. After registration, the new device becomes a member of the Djinn, and as a result, it may access all the services contained in the lookup service 212. The process of boot and join is described in greater detail in co-pending U.S. patent application Ser. No. 09/044,939, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” which has previously been incorporated by reference.
[0056] The JavaSpace 222 is an object repository used by programs within the exemplary distributed system 100 to store objects. Programs use the JavaSpace 222 to store objects persistently as well as to make them accessible to other devices within the exemplary distributed system. Java spaces are described in greater detail in co-pending U.S. patent application No. 08/971,529, entitled “Database System Employing Polymorphic Entry and Entry Matching” assigned to a common assignee, filed on Nov. 17, 1997, which is incorporated herein by reference. One skilled in the art will appreciate that the exemplary distributed system 100 may contain many lookup services, discovery servers, and JavaSpaces.
[0057] Although systems and methods consistent with the present invention are described as operating in the exemplary distributed system and the Java programming environment, one skilled in the art will appreciate that the present invention can be practiced in other systems and other programming environments. Additionally, although aspects of the present invention are described as being stored in memory, one skilled in the art will appreciate that these aspects can also be stored on or read from other types of computer-readable media, such as secondary storage devices, like hard disks, floppy disks, or CD-ROM; a carrier wave from the Internet; or other forms of RAM or ROM. Sun, Sun Microsystems, the SunLogo, Java, and Java-based trademarks are trademarks or registered trademarks of Sun Microsystems Inc. in the United States and other countries.
Polymorphic Token Passing
[0058] A token ring network consistent with the present invention passes a polymorphic token object around the network in place of the static token frame used in conventional token ring networks. The passing of the token object is preferably implemented using a distributed object-oriented programming environment, such as Java RMI (described above). Java RMI is especially suitable to the present invention, as it provides for the automatic management of distributed objects and the ability to easily pass objects from machine to machine on a network.
[0059] FIG. 3 is a diagram illustrating an exemplary token 302 and its relationship with a token class hierarchy 304. Token 302 is preferably implemented using an object data structure, and as such, may include functionality (e.g., methods) and data. As used throughout this specification, and as generally used in the in object-oriented programming field, a class refers to a template from which objects may be defined. An object is an instance of a particular class and can include attribute information that distinguishes objects of the same class. Objects inherit behavior from the class they depend from. Token object 302, for example, is an instance of, and inherits behavior from, “secure token” class 305, which in turn inherits behavior from “general token” class 303.
[0060] As shown, token object 302 includes method(s) 310 defining the token passing order in the network (e.g., counter clock-wise), method(s) 311 defining a distress protocol to be used by a malfunctioning computer, method(s) 312 defining network diagnostic checking routines, and method(s) 313 defining security measures to be implemented by the network. In the context of conventional token ring networks, token ring protocols that implement the functionality defined by methods 310-313 are well known, and accordingly, a detailed description of these methods is omitted.
[0061] Token 302 also includes a message data field 314, a destination data field 315, and a token data field 316, each of which is directly analogous to the message, message identifier, and token described above regarding the conventional token ring network frame.
[0062] Token class 303 defines the general functionality required by a “token.” Classes and objects defined from the general class 303 inherit this functionality. As shown, token class 303 implements, or partially implements, methods 310-312 and fields 314-316. Secure token class 305 is a subclass of class 303, and as such, class 305 inherits the functionality of class 303. Additionally, subclass 305 may define its own methods and variables, including, for example, method(s) 313 defining network security measures. Quick token 306 is also a subclass of class 303. Quick token 303 may include, for example, method(s) 317 that further define the passing order defined in method(s) 310.
[0063] In operation, each computer in network 100 examines the token object it receives and, based on this examination, modifies the protocol it uses to implement the token ring network. If a computer wishes to change the token network protocol of the network, the computer simply changes methods in the token object by either updating, overriding, or adding a new method. As the token object propagates through the network, the new protocol is implemented.
[0064] FIG. 4 is a flow chart illustrating methods consistent with the present invention. Preferably, to ensure network integrity, only authorized computers should be able to modify the token ring network protocol. If a computer wishes to modify the protocol, (step 402), and it has appropriate authority, (step 403), it modifies the protocol simply by adding or substituting, when it has control of the token object, its new methods that define the token ring protocol (step 404). Whether a computer has authorization to modify the network protocol may be indicated by, for example, a field in the token, or pre-hardwired into the computers in network 100.
[0065] Each computer in network 100 that receives the token object consults the token object and, if necessary, updates its version of the network protocol (step 405). The computer may then appropriately operate on the token and pass the token to the next computer in the network (step 406).
[0066] As an illustration of the method shown in FIG. 4, assume a computer would like to change the present token object, which is an instance of secure token class 305, to a quick token object, which is an instance of class 306. Assuming the computer was authorized to change the token object, it would wait until it receives the secure token object, substitute the secure token object with the quick token object, consult the quick token object for the appropriate protocol, and then pass the quick token object to the next computer in the network.
[0067] While there has been illustrated and described what are at present considered to be preferred embodiments and methods of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made, and equivalents may be substituted for elements thereof without departing from the true scope of the invention. For example, while the foregoing systems and methods have been described with reference to a Java-based, runtime environment, other run-time environments could conceivably be used to implement the present invention. Further, although the above-discussed embodiment was discussed in the context of a token ring network, one of ordinary skill in the art will appreciate that token objects consistent with the present invention could be applied equally as well to any token passing algorithm used by a network.
[0068] In addition, many modifications may be made to adapt a particular element, technique or implementation to the teachings of the present invention without departing from the central scope of the invention. Therefore, it is intended that this invention not be limited to the particular embodiments and methods disclosed herein, but that the invention include all embodiments falling within the scope of the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed:
1. A method of updating a resource allocation protocol for controlling a computer network including a plurality of computers, the method comprising the steps of:
creating a token object containing a method defining an updated version of the protocol;
sequentially passing the token object to each computer in the network to facilitate communication between the computers; and
updating the protocol used by each of said plurality of computers with the method defining the updated version of the protocol while the token object is present at one of the computers.
2. The method of claim 1, wherein the step of sequentially passing the token object includes the substep of transmitting a token object defined with the Java programming language.
3. The method of claim 2, wherein the step of sequentially passing the token object further includes the substep of transmitting the token object using the Java remote invocation system.
4. The method of claim 1, wherein the step of sequentially passing the token object to each computer in the network includes the substep of introducing the token object into the network by an authorized computer when the authorized computer is given control of a previous version of the token object.
5. The method of claim 1, wherein the protocol carried out by the plurality of computers in the network implements a token ring computer network.
6. The method of claim 1, wherein the step of creating the token object containing methods defining an updated version of the protocol further includes the substep of defining a new token passing order for the network.
7. A token ring network comprising:
a token ring object including methods and data that define a protocol for the token ring network,
a plurality of interconnected computers; and
the token ring object being sequentially transferred to each of the plurality of computers to facilitate communication between the plurality of computers, and when one of said plurality of computers has received possession of the token ring object, adopting the protocol defined by the token ring object when the protocol defined by the token ring object is different than the protocol in use by the computer.
8. The network of claim 7, wherein each of said plurality of computers further includes a remote object passing mechanism to transfer the token object to other of the plurality of computers.
9. The network of claim 8, wherein each of said plurality of computers further includes a virtual machine on which the remote object passing mechanism is implemented.
10. A method of updating a protocol for controlling a computer network comprising the steps of:
receiving a token object at a first computer in the network;
consulting the token object, and, when the token object indicates that a new protocol is to be used to transmit information on the network, updating an older version of the protocol stored at the first computer; and
transmitting the token object to a second computer in the network, the second computer being determined based on information in the token object.
11. The method of claim 10, further including the step of introducing an updated version of the token object into the network.
12. The method of claim 11, wherein the step of introducing an updated version of the token object further includes the substep of defining a new token transmission order for the network.
13. The method of claim 10, wherein the step of transmitting the token object includes the substep of transmitting the token object using the Java remote invocation system.
14. A computer readable medium containing instructions for causing computers to update a protocol used to control a computer network, the instructions causing the computers to perform the steps of:
creating a token object containing methods defining an updated version of the protocol;
sequentially passing the token object to each of the computers; and
updating the protocol used by each of the computers with the methods defining the updated version of the protocol while the token object is present at said each computer.
15. The computer readable medium of claim 14, wherein the instructions for causing the computers to perform the step of sequentially passing the token object to each of the computers includes the substep of introducing the token object to the computers by an authorized computer when the authorized computer is given control of a previous version of the token object.
16. The computer readable medium of claim 14, wherein the instructions for causing the computers to perform the step of sequentially passing the token object includes the substep of transmitting the token object using the Java remote invocation system.
17. The computer readable medium of claim 14, wherein the protocol carried out by the plurality of computers in the network implements a token ring computer network.
18. The computer readable medium of claim 14, wherein the instructions for causing the computers to perform the step of creating the token object containing methods defining an updated version of the protocol further includes the substep of defining a new token passing order for the network.
19. A method for updating a protocol in a network comprising the steps of:
receiving a token object containing a method defining a protocol of the network;
updating a protocol used by a computer using the protocol of the network defined in the received token object; and
sending the token object.
20. The method of claim 19, wherein the receiving step includes the substep of receiving the token object at a first computer in the network and the sending step includes the substep of transmitting the object to a second computer in the network.
21. The method of claim 19, further including the step of sequentially sending the token object to each computer in the network.
22. The method of claim 19, further including the step of introducing an updated version of the token object into the network.
Patent Citations (193)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4430699(A) | 1984-02-01 | Segarra et al. | Examiner |
| US4491946(A) | 1985-01-01 | Kryskow, Jr. et al. | Applicant |
| US4558413(A) | 1985-12-01 | Schmidt et al. | Examiner |
| US4713806(A) | 1987-12-01 | Oberlander et al. | Applicant |
| US4809160(A) | 1989-02-01 | Mahon et al. | Applicant |
| US4823122(A) | 1989-04-01 | Mann et al. | Applicant |
| US4939638(A) | 1990-07-01 | Stephenson et al. | Applicant |
| US4956773(A) | 1990-09-01 | Saito et al. | Applicant |
| US5088036(A) | 1992-02-01 | Ellis et al. | Applicant |
| US5109486(A) | 1992-04-01 | Seymour | Applicant |
| US5187787(A) | 1993-02-01 | Skeen et al. | Applicant |
| US5218699(A) | 1993-06-01 | Brandle et al. | Applicant |
| US5257369(A) | 1993-10-01 | Skeen et al. | Applicant |
| US5293614(A) | 1994-03-01 | Ferguson et al. | Applicant |
| US5297283(A) | 1994-03-01 | Kelly, Jr. et al. | Applicant |
| US5307490(A) | 1994-04-01 | Davidson et al. | Applicant |
| US5311591(A) | 1994-05-01 | Fischer | Applicant |
| US5339435(A) | 1994-08-01 | Lubkin et al. | Applicant |
| US5386568(A) | 1995-01-01 | Wold et al. | Applicant |
| US5390328(A) | 1995-02-01 | Frey et al. | Applicant |
| US5392280(A) | 1995-02-01 | Zheng | Examiner |
| US5423042(A) | 1995-06-01 | Jalili et al. | Applicant |
| US5440744(A) | 1995-08-01 | Jacobson et al. | Applicant |
| US5448740(A) | 1995-09-01 | Kiri et al. | Applicant |
| US5452459(A) | 1995-09-01 | Drury et al. | Applicant |
| US5455952(A) | 1995-10-01 | Gjovaag | Applicant |
| US5471629(A) | 1995-11-01 | Risch | Applicant |
| US5475792(A) | 1995-12-01 | Stanford et al. | Applicant |
| US5475817(A) | 1995-12-01 | Waldo et al. | Applicant |
| US5481721(A) | 1996-01-01 | Serlet et al. | Applicant |
| US5504921(A) | 1996-04-01 | Dev et al. | Applicant |
| US5511197(A) | 1996-04-01 | Hill et al. | Applicant |
| US5524244(A) | 1996-06-01 | Robinson et al. | Applicant |
| US5548726(A) | 1996-08-01 | Pettus | Applicant |
| US5553282(A) | 1996-09-01 | Parrish et al. | Applicant |
| US5555367(A) | 1996-09-01 | Premerlani et al. | Applicant |
| US5555427(A) | 1996-09-01 | Aoe et al. | Applicant |
| US5557798(A) | 1996-09-01 | Skeen et al. | Applicant |
| US5560003(A) | 1996-09-01 | Nilsen et al. | Applicant |
| US5561785(A) | 1996-10-01 | Blandy et al. | Applicant |
| US5577231(A) | 1996-11-01 | Scalzi et al. | Applicant |
| US5594921(A) | 1997-01-01 | Pettus | Applicant |
| US5603031(A) | 1997-02-01 | White et al. | Applicant |
| US5617537(A) | 1997-04-01 | Yamada et al. | Applicant |
| US5628005(A) | 1997-05-01 | Hurvig | Applicant |
| US5640564(A) | 1997-06-01 | Hamilton et al. | Applicant |
| US5644768(A) | 1997-07-01 | Periwal et al. | Applicant |
| US5652888(A) | 1997-07-01 | Burgess | Applicant |
| US5655148(A) | 1997-08-01 | Richman et al. | Applicant |
| US5659751(A) | 1997-08-01 | Heninger | Applicant |
| US5671225(A) | 1997-09-01 | Hooper et al. | Applicant |
| US5675796(A) | 1997-10-01 | Hodges et al. | Applicant |
| US5680573(A) | 1997-10-01 | Robin et al. | Applicant |
| US5680617(A) | 1997-10-01 | Gough et al. | Applicant |
| US5684955(A) | 1997-11-01 | Meyer et al. | Applicant |
| US5689709(A) | 1997-11-01 | Corbett et al. | Applicant |
| US5706435(A) | 1998-01-01 | Barbará et al. | Applicant |
| US5706502(A) | 1998-01-01 | Foley et al. | Applicant |
| US5724588(A) | 1998-03-01 | Hill et al. | Applicant |
| US5727145(A) | 1998-03-01 | Nessett et al. | Applicant |
| US5737607(A) | 1998-04-01 | Hamilton et al. | Applicant |
| US5745678(A) | 1998-04-01 | Herzberg et al. | Applicant |
| US5745695(A) | 1998-04-01 | Gilchrist et al. | Applicant |
| US5745703(A) | 1998-04-01 | Cejtin et al. | Applicant |
| US5745755(A) | 1998-04-01 | Covey | Applicant |
| US5748897(A) | 1998-05-01 | Katiyar | Applicant |
| US5754849(A) | 1998-05-01 | Dyer et al. | Applicant |
| US5757925(A) | 1998-05-01 | Faybishenko | Applicant |
| US5758344(A) | 1998-05-01 | Prasad et al. | Applicant |
| US5761656(A) | 1998-06-01 | Ben-Schachar | Applicant |
| US5764897(A) | 1998-06-01 | Khalidi | Applicant |
| US5768532(A) | 1998-06-01 | Megerian | Applicant |
| US5774551(A) | 1998-06-01 | Wu et al. | Applicant |
| US5778187(A) | 1998-07-01 | Monteiro et al. | Applicant |
| US5778228(A) | 1998-07-01 | Wei | Applicant |
| US5778368(A) | 1998-07-01 | Hogan et al. | Applicant |
| US5784560(A) | 1998-07-01 | Kingdon et al. | Applicant |
| US5787425(A) | 1998-07-01 | Bigus | Applicant |
| US5787431(A) | 1998-07-01 | Shaughnessy | Applicant |
| US5790548(A) | 1998-08-01 | Sistanizadeh et al. | Applicant |
| US5802367(A) | 1998-09-01 | Held et al. | Applicant |
| US5808911(A) | 1998-09-01 | Tucker et al. | Applicant |
| US5809507(A) | 1998-09-01 | Cavanaugh, III | Applicant |
| US5812819(A) | 1998-09-01 | Rodwin et al. | Applicant |
| US5813013(A) | 1998-09-01 | Shakib et al. | Applicant |
| US5815149(A) | 1998-09-01 | Mutschler, III et al. | Applicant |
| US5815709(A) | 1998-09-01 | Waldo et al. | Applicant |
| US5815711(A) | 1998-09-01 | Sakamoto et al. | Applicant |
| US5818448(A) | 1998-10-01 | Katiyar | Applicant |
| US5829022(A) | 1998-10-01 | Watanabe et al. | Applicant |
| US5832219(A) | 1998-11-01 | Pettus | Applicant |
| US5832529(A) | 1998-11-01 | Wollrath et al. | Applicant |
| US5832593(A) | 1998-11-01 | Wurst et al. | Applicant |
| US5835737(A) | 1998-11-01 | Sand et al. | Applicant |
| US5842018(A) | 1998-11-01 | Atkinson et al. | Applicant |
| US5844553(A) | 1998-12-01 | Hao et al. | Applicant |
| US5845090(A) | 1998-12-01 | Collins, III et al. | Examiner |
| US5845129(A) | 1998-12-01 | Wendorf et al. | Applicant |
| US5860004(A) | 1999-01-01 | Fowlow et al. | Applicant |
| US5860153(A) | 1999-01-01 | Matena et al. | Applicant |
| US5864862(A) | 1999-01-01 | Kriens et al. | Applicant |
| US5864866(A) | 1999-01-01 | Henckel et al. | Applicant |
| US5872928(A) | 1999-02-01 | Lewis et al. | Applicant |
| US5872973(A) | 1999-02-01 | Mitchell et al. | Applicant |
| US5875335(A) | 1999-02-01 | Beard | Applicant |
| US5878411(A) | 1999-03-01 | Burroughs et al. | Applicant |
| US5884024(A) | 1999-03-01 | Lim et al. | Applicant |
| US5884079(A) | 1999-03-01 | Furusawa | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5889951(A) | 1999-03-01 | Lombardi | Applicant |
| US5890158(A) | 1999-03-01 | House et al. | Applicant |
| US5892904(A) | 1999-04-01 | Atkinson et al. | Applicant |
| US5913029(A) | 1999-06-01 | Shostak | Applicant |
| US5933497(A) | 1999-08-01 | Beetcher et al. | Applicant |
| US5933647(A) | 1999-08-01 | Aronberg et al. | Examiner |
| US5935249(A) | 1999-08-01 | Stern et al. | Applicant |
| US5940827(A) | 1999-08-01 | Hapner et al. | Applicant |
| US5944793(A) | 1999-08-01 | Islam et al. | Applicant |
| US5946485(A) | 1999-08-01 | Weeren et al. | Applicant |
| US5946694(A) | 1999-08-01 | Copeland et al. | Applicant |
| US5949998(A) | 1999-09-01 | Fowlow et al. | Applicant |
| US5951652(A) | 1999-09-01 | Ingrassia, Jr. et al. | Examiner |
| US5956509(A) | 1999-09-01 | Kevner | Applicant |
| US5963947(A) | 1999-10-01 | Ford et al. | Applicant |
| US5966531(A) | 1999-10-01 | Skeen et al. | Applicant |
| US5969967(A) | 1999-10-01 | Aahlad et al. | Applicant |
| US5974201(A) | 1999-10-01 | Chang et al. | Examiner |
| US5978484(A) | 1999-11-01 | Apperson et al. | Applicant |
| US5987506(A) | 1999-11-01 | Carter et al. | Applicant |
| US5999179(A) | 1999-12-01 | Kekic et al. | Applicant |
| US5999988(A) | 1999-12-01 | Pelegri-Llopart et al. | Examiner |
| US6003763(A) | 1999-12-01 | Gallagher et al. | Applicant |
| US6009103(A) | 1999-12-01 | Woundy | Applicant |
| US6016496(A) | 2000-01-01 | Roberson | Applicant |
| US6023586(A) | 2000-02-01 | Gaisford et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6031977(A) | 2000-02-01 | Pettus | Applicant |
| US6052761(A) | 2000-04-01 | Hornung et al. | Examiner |
| US6058383(A) | 2000-05-01 | Narasimhalu et al. | Applicant |
| US6061699(A) | 2000-05-01 | DiCecco et al. | Applicant |
| US6061713(A) | 2000-05-01 | Bharadhwaj | Applicant |
| US6067575(A) | 2000-05-01 | McManis et al. | Applicant |
| US6085255(A) | 2000-07-01 | Vincent et al. | Examiner |
| US6108346(A) | 2000-08-01 | Doucette et al. | Examiner |
| US6185602(B1) | 2001-02-01 | Bayrakeri | Examiner |
| US6185611(B1) | 2001-02-01 | Waldo et al. | Examiner |
| US6216138(B1) | 2001-04-01 | Wells et al. | Applicant |
| US6226746(B1) | 2001-05-01 | Scheifler | Examiner |
| US6230160(B1) | 2001-05-01 | Chan et al. | Examiner |
| US6247091(B1) | 2001-06-01 | Lovett | Examiner |
| US6263379(B1) | 2001-07-01 | Atkinson et al. | Applicant |
| US6282295(B1) | 2001-08-01 | Young et al. | Applicant |
| US6282568(B1) | 2001-08-01 | Sondur et al. | Examiner |
| EP300516 | 1989-01-01 | Applicant | |
| EP351536 | 1990-01-01 | Applicant | |
| EP384339 | 1990-08-01 | Applicant | |
| EP472874 | 1992-03-01 | Applicant | |
| EP474340 | 1992-03-01 | Applicant | |
| EP497022 | 1992-08-01 | Applicant | |
| EP555997 | 1993-02-01 | Applicant | |
| EP565849 | 1993-10-01 | Applicant | |
| EP569195 | 1993-11-01 | Applicant | |
| EP625750 | 1994-11-01 | Applicant | |
| EP635792 | 1995-01-01 | Applicant | |
| EP651328 | 1995-05-01 | Applicant | |
| EP660231 | 1995-06-01 | Applicant | |
| EP697655 | 1996-02-01 | Applicant | |
| EP718761 | 1996-06-01 | Applicant | |
| EP767432 | 1997-04-01 | Applicant | |
| EP778520 | 1997-06-01 | Applicant | |
| EP794493 | 1997-09-01 | Applicant | |
| EP803810 | 1997-10-01 | Applicant | |
| EP803811 | 1997-10-01 | Applicant | |
| EP805393 | 1997-11-01 | Applicant | |
| EP810524 | 1997-12-01 | Applicant | |
| EP817020 | 1998-01-01 | Applicant | |
| EP817022 | 1998-01-01 | Applicant | |
| EP817025 | 1998-01-01 | Applicant | |
| EP836140 | 1998-04-01 | Applicant | |
| GB2253079 | 1992-08-01 | Applicant | |
| GB2262825 | 1993-06-01 | Applicant | |
| GB2305087 | 1997-03-01 | Applicant | |
| JP11-45187 | 1999-02-01 | Applicant | |
| WO92/07335 | 1992-04-01 | Applicant | |
| WO92/09948 | 1992-06-01 | Applicant | |
| WO93/25962 | 1993-12-01 | Applicant | |
| WO94/03855 | 1994-02-01 | Applicant | |
| WO96/3692 | 1996-02-01 | Applicant | |
| WO96/10787 | 1996-04-01 | Applicant | |
| WO96/18947 | 1996-06-01 | Applicant | |
| WO96/24099 | 1996-08-01 | Applicant | |
| WO98/02814 | 1998-01-01 | Applicant | |
| WO98/04971 | 1998-02-01 | Applicant |
Non-Patent Literature (97)
- Aldrich et al., “Providing Easier Access to Remote Objects in Client-Server Systems,” System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l. Conference, Jan. 6-9, 1998, pp. 366-375.Applicant
- Aldrich et al., “Providing Easier Access to Remote Objects in Distributed Systems,” Calif. Institute of Technology, www.cs.caltech.edu/%7Ejedi/paper/jedipaper.html, Nov. 21, 1997.Applicant
- Burns et al., “An Analytical Study of Opportunistic Lease Renewal,” Distributed Computing Systems, 21st International Conference, pp. 146-153, Apr. 2000.Applicant
- Dollimore et al., “The Design of a System for Distributing Shared Objects,” The Computer Journal, No. 6, Cambridge, GB, Dec. 1991.Applicant
- Fleisch et al., “High Performance Distributed Objects Using Distributed Shared Memory & Remote Method Invocation,” System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l. Conference, Jan. 6-9, 1998, pp. 574-578.Applicant
- Gray et al., “Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency,” Proceedings of the 12th ACM Symposium on Operating Systems Principles, pp. 202-210, 1989.Applicant
- Guyenne et al., “A New Consistency Protocol Implemented in the CAlif System,” IEEE, 1094-7256/97, pp. 82-87, 1997.Applicant
- Guyennet et al., “Distributed Shared memory Layer for Cooperative Work Applications,” IEEE, 0742-1303/97, pp. 72-78, 1997.Applicant
- Hoshi et al., “Allocation of the Cross-Connect Function in Leased Circuit Networks,” 1992, ICC'92, conference record, SUPERCOMM/ICC '92, A New World of Communications, IEEE International Conference, pp. 1408-1412.Applicant
- IBM Technical Disclosure Bulletin, “Local Network Monitoring to Populate Access Agent Directory,” vol. 36, No. 09A, pp. 403-405, Sep. 1993.Applicant
- McGrath, “Discovery and Its Discontents: Discovery Protocols for Ubiquitous Computing,” Presented at Center for Excellence in Space Data and Information Science, NASA Goddard Space Flight Center, Apr. 5, 2000.Applicant
- MUX-Elektronik, Java 1.1 Interactive Course, www.lls.se/˜mux/javaic.html, 1995.Applicant
- Stevenson, “Token-Based Consistency of Replicated Servers,” IEEE, CH2686-4/89/0000/0179, pp. 179-183, 1989.Applicant
- Venners, “Jini Technology, Out of the Box,” JAVAWORLD, 'Online!, pp. 1-4, Dec. 1998.Applicant
- Alexander, et al., “Active Bridging”, Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, 9/97.Applicant
- Anonymous: “Change-Notification Service for Shared Files”, IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, Aug. 1993, XP002108713, New York, US.Applicant
- Anonymous: “Resource Preemption for Priority Scheduling.” Nov. 1973. IBM Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931 XP002109435 New York, US.Applicant
- Beech et al., “Object Databases as Generalizations of Relational Databases,” Computer Standards & Interfaces, vol. 13, Nos. 1/3, pp. 221-230, (Jan. 1991) Amsterdam, NL.Applicant
- Bertino et al., “Object-Oriented Database Management Systems: Concepts and Issues,” Computer, vol. 24, No. 4, pp. 33-47, (Apr. 1991), Los Alamitos, CA.Applicant
- Betz, Mark; “Interoperable objects: laying the foundation for distributed object computing”, Dr. Dobb's Journal, vol. 19, No. 11, p. 18(13); (Oct. 1994).Applicant
- Bevan, D.I., “An Efficient Reference Counting Solution To The Distributed Garbage Collection Problem”, Parall Computing, NL, Elsevier Publishers, Amsterdam, vol. 9, No. 2, pp. 179-192, Jan. 1989.Applicant
- Birrell et al., “Implementing Remote Procedure Calls”, ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 39-59.Applicant
- Dave A et al: “Proxies, Application Interface, And Distributed Systems”, Proceedings International Workshop On Object Orientation In Operating Systems, Sep. 24, 1992, pp. 212-220.Applicant
- Deux O et al: “The 02 System” Communications Of The Association For Computing Machinery, vol. 34, No. 10, Oct. 1, 1991, pp. 34-48.Applicant
- Drexler, K. Eric, et al., “Incentive Engineering for Computational Resource Management,” The Ecology of Computation, Elsevier Science Publishers B.V., 1988, pp. 231-266.Applicant
- Droms, R., “RFC 1541 Dynamic Host Configuration Protocol”, HTTP://WWW.CIS.OHIO-STATE.EDU/HTBIN/RFC/RFC1541.HTML, Oct. 1993, pp. 1-33.Applicant
- Emms J: “A Definition Of An Access Control Systems Language” Computer Standards And Interfaces, vol. 6, No. 4, Jan. 1, 1987, pp. 443-454.Applicant
- Gosling et al., “The Java (TM) Language Specification”, Addison-Wesley, 1996.Applicant
- Gottlob et al., “Extending Object-Oriented Systems with Roles,” ACM Transactions on information systems, vol. 14, No. 3, pp. 268-296 (Jul. 1996).Applicant
- Guth, Rob: “JavaOne: Sun to Expand Java Distributed Computing Effort”, HTTP://WWW.SUNWORLD.COM/SWOL-02-1998/SWOL-02-SUNSPOTS.HTML; XP-002109935, P.1, Feb. 20, 1998.Applicant
- Hamilton et al., “Subcontract: a flexible base for distributed programming”; Proceedings of the 14th Symposium of Operating System Principles; (Dec. 1993).Applicant
- Hartman, J., Manber, U., et al., Liquid Software: A New Paradigm for Networked Systems, Technical Report 96-11, Department of Comp. Sci., Univ. of Arizona, 6/96.Applicant
- Hunt, N., “IDF: A Graphical Data Flow Programming Language for Image Processing and Computer Vision”, Proceedings of the International Conference on Systems, Man, and Cybernetics, Los Angeles, Nov. 4-7, pp. 351-360, (1990).Applicant
- IBM (TM) Technical Disclosure Bulletin, “Object Location Algorithm,” vol. 36, No. 09B, pp. 257-258, Sep. 1993.Applicant
- IBM (TM) Technical Disclosure Bulletin, “Retrieval of Qualified Variables Using Extendible Hashing,” vol. 36, No. 12, pp. 301-303, Dec. 1993.Applicant
- IBM: “Chapter 6—Distributed SOM (DSOM)” Somobjects Developer Toolkit Users Guide, Version 2.1, Oct. 1994 (1994-10), pp. 6-1-6-90.Applicant
- Jones, Richard, et al., “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” pp. 165-175, John Wiley & Sons, 1996.Applicant
- Kay, Michael H. et al., “An Overview of the Raleigh Object-Oriented Database System”, ICL Technical Journal, vol. 7, No. 4, pp. 780-798, (Nov. 1991), Oxford, GB.Applicant
- Kougiouris et al.; “Support for Space Efficient Object Invocation in Spring”; (Sep. 1994).Applicant
- Lindholm et al., “The Java (TM) Virtual Machine Specification,” Sun Microsystems, Inc., Addison Wesley, 1996.Applicant
- Mitchell et al.; “An Overview of the Spring System”; (Feb. 1994).Applicant
- Orfali R. et al., “The Essential Distributed Objects Survival Guide,” Chapter 11: Corba Commercial ORBs, pp. 203-215, John Wiley & Sons, Inc., (1996).Applicant
- Riggs Roger et al., “Pickling State in the Java (TM) System,” USENIX Association Conference on Object-Oriented Technologies and Systems, XP-002112719, Jun. 17-21, 1996, pp. 241-250.Applicant
- Rosenberry et al., “Understanding DCE”; Chapters 1-3, 6; (1992).Applicant
- Waldo J et al: “Events in an RPC based distributed system” Proceedings Of The 1995 Usenix Technical Conference, Proceedings Usenix Winter 1995 Technical Conference, New Orleans, LA. USA, Jan. 16-20, 1995, pp. 131-142.Applicant
- Wilson, P.R., et al., “Design of the Opportunistic Garbage Collector,” Proceedings of the Object Oriented Programming Systems Languages And Applications Conference, New Orleans, vol. 24, No. 10, Oct. 1989.Applicant
- Wu, Xuequn, “A Type System for an Object-Oriented Database System,” Proceedings of the International Computer Software and Applications Conference (COMPSAC), pp. 333-338, Sep. 11-13, 1991, Tokyo, Japan.Applicant
- Yin, J. et al., 18th International Conference on Distributed Computing Systems, “Using Leases to Support Server Driven Consistency in Large-Scale Systems,” Computer Services Department, University of Texas at Austin, pp. 285-294 (May 26-29, 1998).Applicant
- Yechiam Yemini & Sushil da Silva, “Towards Programmable Networks,” IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, pp. 1-11, Oct. 1996.Applicant
- John Hartman et al., “Liquid Software: A New Paradigm for Networked Systems,” Technical Report 96-11, Department of Computer Science, University of Arizona, pp. 1-13, Jun. 1996.Applicant
- D.Scott Alexander et al., “Active Bridging,” Proceedings of the ACM/SIGCOMM '97 Conference, Sep. 1997.Applicant
- Mullender, Distributed Systems, Second Edition, Addison-Wesley, 1993.Applicant
- Howard et al., Scale and Performance in a Distributed File System, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 51-81.Applicant
- Cardelli, Obliq, A lightweight language for network objects, Nov. 5, 1993, pp. 1-37.Applicant
- Dijkstra, Self-stabilizing Systems in Spite of Distributed Control, Communications of the ACM, vol. 17, No. 11, Nov. 1974, pp. 643-644.Applicant
- Ousterhout et al., The Sprite Network Operating System, Computer, IEEE, Feb. 1988, pp. 23-36.Applicant
- Dourish, A Divergence-Based Model of Synchrony and Distribution in Collaborative Systems, Xerox Technical Report EPC-1194-102, 1994, pp. 1-10.Applicant
- Sharrott et al., ObjectMap: Integrating High Performance Resources into a Distributed Object-oriented Environment, ICODP, 1995.Applicant
- Birrell et al., Grapevine: An Exercise in Distributed Computing, Communications of the ACM, vol. 25, No. 4, Apr. 1982, pp. 260-274.Applicant
- Transparent Network Computing, Locus Computing Corporation, Jan. 5, 1995.Applicant
- Gray et al., Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency, ACM, 1989, pp. 202-210.Applicant
- Lamport et al., The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, Jul. 1982, pp. 382-401.Applicant
- Dolev et al., On the Minimal Synchronism Needed for Distributed Consensus, Journal of the ACM, vol. 34, No. 1, Jan. 1987, pp. 77-97.Applicant
- Mummert et al., Long Term Distributed File Reference Tracing: Implementation and Experience, Carnegie Mellon University School of Computer Science, Nov. 1994, pp. 1-28.Applicant
- Gelernter et al., Parallel Programming in Linda, Yale University, Jan. 1985, pp. 1-21.Applicant
- Cannon et al., Adding Fault-Tolerant Transaction Processing to LINDA, Software-Practice and Experience, vol. 24(5), May 1994, pp. 449-466.Applicant
- Kambhatla et al., Recovery with Limited Replay: Fault-Tolerant Processes in Linda, Oregon Graduate Institute, Technical Report CSIE 90-019, Sep. 1990, pp. 1-16.Applicant
- Anderson et al., Persistent Linda: Linda + Transactions + Query Processing, Proceedings of the 13th Symposium on Fault Tolerant Systems, 1994, pp. 93-109.Applicant
- Gelernter, Generative Communication in Linda, ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, Jan. 1985, pp. 80-112.Applicant
- Carriero et al., Distributed Data Structures in Linda, Principals of Programming Language, 1986, pp. 1-16.Applicant
- Pinakis, Using Linda as the Basis of an Operating System Microkernel, University of Western Australia, Department of Computer Science, Aug. 1993, pp. 1-165.Applicant
- LINDA Database Search, Jul. 20, 1995, pp. 1-68.Applicant
- Carriero et al, Distributed Data Structures in Linda, Yale Research Report YALEU/DCS/RR-438, Nov. 1985.Applicant
- Agha et al., Actorspaces: An Open Distributed Programming Paradigm, University of Illinois, Report No. UIUCDCS-R-92-1766, Open Systems Laboratory TR No. 8, Nov. 1992, pp. 1-12.Applicant
- Ahmed et al., A Program Building Tool for Parallel Applications, Yale University, Dec. 1, 1993, pp. 1-23.Applicant
- Liskov et al., Distributed Object Management in Thor, International Workshop on Distributed Object Management, 1992, pp. 12.Applicant
- Coulouris et al., Distributed Systems Concepts and Designs, Second Edition, Addison-Wesley, 1994.Applicant
- Birrell et al., Network Objects, DEC SRC Research Report 115, Feb. 28, 1994.Applicant
- Birrell et al., Distributed Garbage Collection for Network Objects, DEC SRC Research Report 116, Dec. 15, 1993.Applicant
- Jaworski, Java 1.1 Developer's Guide, Sams.net, 1997.Applicant
- Wollrath et al., A Distributed Object Model for the Java™ System, USENIX Association, Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996.Applicant
- Harris et al., Proposal for a General Java Proxy Class for Distributed Systems and Other Uses, Netscape Communications Corp., Jun. 25, 1997.Applicant
- Hamilton, Java and the Shift to Net-Centric Computing Computer, Aug. 1996, pp. 31-39.Applicant
- Chung et al., A ‘Tiny’ Pascal Compiler: Part 1: The P-Code Interpreter, BYTE Publications, Inc., Sep. 1978.Applicant
- Chung et al., A ‘Tiny’ Pascal Compiler: Part 2: The P-Compiler, BYTE Publications, Inc., Oct. 1978.Applicant
- Thompson, Regular Expression Search Algorithm, Communications of the ACM, vol. II, No. 6, p. 149 et seq., Jun. 1968.Applicant
- Mitchell et al., Mesa Language Manual, Xerox Corporation.Applicant
- McDaniel, An Analysis of a Mesa Instruction Set, Xerox Corporation, May 1982.Applicant
- Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, Xerox Corporation, Aug. 1983.Applicant
- Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, IEEE Conference Proceedings, The 10th Annual international Symposium on Computer Architecture, 1983.Applicant
- Krasner, The Smalltalk-80 Virtual Machine, BYTE Publications Inc., Aug. 1991, pp. 300-320.Applicant
- Operating Systems Review, ACM Press, vol. 27, No. 5, Dec. 1993, pp. 217-230.Applicant
- Remote Method Invocation Specification, Sun Microsystems, Inc., (1997), http://java.sun.com/products/jdk/1.1/docs/guide/rmi/spec/rmiTOC.doc.html.Applicant
- Stevenson et al., “Token-based Consistency of Replicated Servers”, IEEE, 1989.Applicant
- Guyennet et al., “Distribution Shared Memory Layer for Cooperative Work Applications”, IEEE, 1997.Applicant
- Guyennet et al., “A New Consistency Protocol Implemented in the CALiF System”, IEEE, 1997.Applicant
- Douglas Hodges, “Managing Object Lifetimes in OLE,” http://www.scit.wlv.ac.uk, pp.1-41, Aug. 25, 1994.Applicant