US 6,560,656 B1Grant
Apparatus and method for providing downloadable code for use in communicating with a device in a distributed system
Issue Date:2003-05-06
•12 Claims
•5 Drawing Sheets
Abstract
Downloading code for communicating with a device that joins a network. When the device joins the network, it transmits a multicast packet including a reference to code for use in communicating with the device. Receivers in the network use the reference to download the code for constructing objects to communicate with the device, and the receivers respond with a reference to a lookup service in the network. Using the reference from the receivers, the device registers with the lookup service.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Bryan O'Sullivan
- Robert Scheifler
- Peter C. Jones
- Ann M. Wollrath
- Kenneth C. R. C. Arnold
- James H. Waldo
Application Information
Application Number:US 09/044,939
Filing Date:1998-03-20
Priority Date:1998-02-26
Art Unit:7
Classifications
IPC:
G06F 1516G06F 15177
Field of Search:
709225709223709229709315709317709204709205709206709220709250713200713201713202707 10
Patent Drawings (5 sheets)
Description
REFERENCE TO RELATED APPLICATIONS
[0002] The following identified U.S. patent applications are relied upon and are incorporated by reference in this application as if fully set forth.
[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 “Methods 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,826, entitled “Method and System for Facilitating Access to a Lookup Service,” and filed on the same date herewith.
[0020] 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.
[0021] 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.
[0022] 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.
[0023] U.S. patent application Ser. No. 09/044,934, entitled “Polymorphic Token-Based Control,” 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] The present invention relates to a system and method for transmitting objects between machines in a distributed system and more particularly to transmission of downloadable code for use in communicating with a device in a distributed system.
BACKGROUND OF THE INVENTION
[0028] Machines in a distributed system may communicate and access each other. When a device wants to join the distributed system, the machines already in the system typically must know how to communicate with the device. This requirement means that, for example, the machines must store code, drivers, and port information for any device that may join the system. In addition, they may be required to store stubs for communicating with any device that may join the system. A proxy stub is a reference to a remote object for use in reconstructing an object, and stubs facilitate communication between machines in a distributed system. These requirements may result in inefficiencies and increase memory or storage requirements due to the amount of prestored information required to communicate with devices that may join the system. Accordingly, a need exists for increased flexibility in transmitting code for communication between machines in a distributed system.
SUMMARY OF THE INVENTION
[0029] A first method consistent with the present invention transmits from a machine a multicast packet including a request to join a distributed system and including an indication of code for communicating with the machine. A response is received, the response including a reference to an entity for registration with the system, and a message is transmitted to the entity to register with the system.
[0030] A second method consistent with the present invention receives from a machine a multicast packet including a request to join a distributed system and including indication of code for communicating with the machine. The code is used to construct a response including a reference to an entity for registration with the system, and the response is transmitted to the machine.
[0031] A third method consistent with the present invention transmits from a first machine a first object including indication of code for communicating with the first machine, and a second machine receives the first object. The code is used for constructing a second object for communicating with the first machine, and the second object is transmitted from the second machine to the first machine.
[0032] A first apparatus consistent with the present invention transmits from a machine a multicast packet including a request to join a distributed system and including indication of code for communicating with the machine. The apparatus receives a response including a reference to an entity for registration with the system and transmits a message to the entity to register with the system.
[0033] A second apparatus consistent with the present invention receives from a machine a multicast packet including a request to join a distributed system and including indication of code for communicating with the machine. The apparatus uses the code to construct a response including a reference to an entity for registration with the system and transmits the response to the machine.
[0034] A third apparatus consistent with the present invention transmits from a first machine a first object including indication of code for communicating with the first machine. The apparatus receives at a second machine the first object and uses the code for constructing a second object for communicating with the first machine. The second object is transmitted from the second machine to the first machine.
BRIEF DESCRIPTION OF THE DRAWINGS
[0035] The accompanying drawings are incorporated in and constitute a part of this specification and, together with the description, explain the advantages and principles of the invention. In the drawings,
[0036] FIG. 1 is a diagram of an exemplary distributed processing system that can be used in an implementation consistent with the present invention;
[0037] FIG. 2 is a diagram of an exemplary distributed system infrastructure;
[0038] FIG. 3 is a diagram of a computer in a distributed system infrastructure shown in FIG. 2;
[0039] FIG. 4 is a diagram of an exemplary distributed network illustrating a device joining the network; and
[0040] FIG. 5 is a flow chart of a process for a device to join a distributed network.
DETAILED DESCRIPTION
Overview
[0041] Methods and systems consistent with the present invention provide a technique for joining a device to a distributed network. When the device joins the network, it transmits a multicast packet that includes code or a reference to code for use in communicating with the device. Receivers in the network use the reference to download the code to communicate with the device. The receivers thus need not have prestored code or other information required to communicate with the device, which may enhance network efficiency.
[0042] The receivers respond to the multicast packet by transmitting to the device a reference to a lookup service in the network. Using the reference from at least one of the receivers, the device registers itself with the lookup service. A lookup service is described in U.S. patent application filed on even date herewith, assigned to a common assignee, and entitled “Method and System for Facilitating Access to a Lookup Service,” which is incorporated herein by reference.
Distributed Processing System
[0043] FIG. 1 illustrates an exemplary distributed processing system 100 which can be used in an implementation consistent with the present invention. In FIG. 1, distributed processing system 100 contains three independent and heterogeneous platforms 101, 102, and 103 connected in a network configuration represented by network cloud 119. The composition and protocol of the network configuration represented by cloud 119 is not important as long as it allows for communication of the information between platforms 101, 102 and 103. In addition, the use of just three platforms is merely for illustration and does not limit an implementation consistent with the present invention to the use of a particular number of platforms. Further, the specific network architecture is not crucial to embodiments consistent with the present invention. For example, another network architecture that could be used in an implementation consistent with this invention would employ one platform as a network controller to which all the other platforms would be connected.
[0044] In the implementation of distributed processing system 100, platforms 101, 102 and 103 each include a processor 116, 117, and 118 respectively, and a memory, 104, 105 and 106, respectively. Included within each memory 104, 105, and 106, are applications 107, 108, and 109, respectively, operating systems 110, 111, and 112, respectively, and Java™ remote method invocation components (RMI) components 113, 114, and 115, respectively. RMI is explained in, for example, the following document, which is incorporated herein by reference: Remote Method Invocation Specification, Sun Microsystems, Inc. (1997), which is available via universal resource locator (URL) http://www javasoft.com/products/jdk/1.1/docs/guide/rmi/spec/rmiTOC.doc.html.
[0045] Applications 107, 108, and 109 can be programs that are either previously written and modified to work with, or that are specially written to take advantage of, the services offered by an implementation consistent with the present invention. Applications 107, 108, and 109 invoke operations to be performed in accordance with an implementation consistent with this invention.
[0046] Operating systems 110, 111, and 112 are typically standard operating systems tied to the corresponding processors 116, 117, and 118, respectively. The platforms 101, 102, and 103 can be heterogenous. For example, platform 101 has an UltraSparc® microprocessor manufactured by Sun Microsystems, Inc. as processor 116 and uses a Solaris® operating system 110. Platform 102 has a MIPS microprocessor manufactured by Silicon Graphics Corp. as processor 117 and uses a Unix operating system 111. Finally, platform 103 has a Pentium microprocessor manufactured by Intel Corp. as processor 118 and uses a Microsoft Windows 95 operating system 112. An implementation consistent with the present invention is not so limited and could accommodate homogenous platforms as well.
[0047] Sun, Sun Microsystems, Solaris, Java, and the Sun Logo are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries. UltraSparc and all other SPARC trademarks are used under license and are trademarks of SPARC International, Inc. in the United States and other countries. Products bearing SPARC trademarks are based upon an architecture developed by Sun Microsystems, Inc.
[0048] Memories 103, 104, and 105 serve several functions, such as general storage for the associated platform. Another function is to store applications 107, 108, and 109, RMI components 113, 114, and 115, and operating systems 110, 111, and 112 during execution by the respective processor 116, 117, and 118. In addition, portions of memories 103, 104, and 105 may constitute shared memory available to all of the platforms 101, 102, and 103 in network 119. Note that RMI components 113, 114, and 115 operate in conjunction with a JVM, which is not shown for the purpose of simplifying the figure.
Distributed System Infrastructure
[0049] Systems and methods consistent with the present invention may also operate within a particular distributed system 200, which will be described with reference to FIGS. 2 and 3. This distributed system 200 is comprised of various components, including hardware and software, to (1) allow users of the system to share services and resources over a network of many devices; (2) secured distributed systems; and (3) simplify the task of administering the distributed system. To accomplish these goals, distributed system 400 utilizes the Java programming environment to allow both code and data to be moved from device to device in a seamless manner. Accordingly, distributed system 200 is layered on top of the Java programming environment and exploits the characteristics of this environment, including the security offered by it and the strong typing provided by it.
[0050] In distributed system 200 of FIGS. 2 and 3, different computers and devices are federated into what appears to the user to be a single system. By appearing as a single system, distributed system 200 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 200 may contain thousands of devices operated by users who are geographically disperse, but who agree on basic notions of trust, administration, and policy.
[0051] Within an exemplary distributed 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 programs or utilities; information, such as databases and files; and users of the system.
[0052] 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.
[0053] Distributed system 200 is comprised of computer 202, a computer 204, and a device 206 interconnected by a network 208. Device 206 may be any of a number of devices, such as a printer, fax machine, storage device, computer, or other devices. Network 208 may be a local area network, wide area network, or the Internet. Although only two computers and one device are depicted as comprising distributed system 200, one skilled in the art will appreciate that distributed system 200 may include additional computers or devices.
[0054] FIG. 3 depicts computer 202 in greater detail to show a number of the software components of distributed system 200. One skilled in the art will appreciate that computer 204 or device 206 may be similarly configured. Computer 202 includes a memory 302, a secondary storage device 304, a central processing unit (CPU) 306, an input device 308, and a video display 310. Memory 302 includes a lookup service 312, a discovery server 314, and a Java runtime system 316. The Java runtime system 316 includes the Java RMI system 318 and a JVM 320. Secondary storage device 304 includes a Java space 322.
[0055] As mentioned above, distributed system 200 is based on the Java programming environment and thus makes use of the Java runtime system 316. The Java runtime system 316 includes the Java API libraries, allowing programs running on top of the Java runtime system to acess, in a plateform-independent manner, various system functions, including windowing capabilities and networking capabilities of the host operating system. Since the Java API libraries 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 316 is provided as part of the Java software development kit available from Sun Microsystems, Inc. of Mountain View, Calif.
[0056] JVM 320 also facilitates platform independence. JVM 320 acts like an abstract computing machine, receiving instructions from programs in the form of bytecodes and interpreting these bytecodes by dynamically converting them into a form for execution, such as object code, and executing them. RMI 318 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 JVM are also provided as part of the Java software development kit.
[0057] Lookup service 312 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 distributed system 200. Lookup service 312 contains one object for each service within the Djinn, and each object contains various methods that facilitate access to the corresponding service. Lookup service 312 is described in U.S. patent application entitled “Method and System for Facilitating Access to a Lookup Service,” which was previously incorporated herein by reference.
[0058] Discovery server 314 detects when a new device is added to distributed system 200, 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 lookup service 312 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 lookup service 312. The process of boot and join is described in U.S. patent application entitled “Apparatus and Method for providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” which was previously incorporated herein by reference.
[0059] A Java space 322 is an object repository used by programs within distributed system 200 to store objects. Programs use a Java space 322 to store objects persistently as well as to make them accessible to other devices within distributed system 200. Java spaces are described in U.S. patent application Ser. No. 08/971,529, entitled “Database System Employing Polymorphic Entry and Entry Matching,” assigned to a common assignee, and filed on Nov. 17, 1997, which is incorporated herein by reference. One skilled in the art will appreciate that an exemplary distributed system 200 may contain many lookup services, discovery servers, and Java spaces.
Data Flow in a Distributed Processing System
[0060] FIG. 4 is a diagram of an exemplary object-oriented distributed network or system 400 connecting machines 401, 408, 411, and 414, such as computers or virtual machines executing on one or more computers, or the machines described with reference to FIGS. 1, 2, and 3. As shown in FIG. 4, transmitting machine or device 401 includes an object 402 and RMI 403 for performing processing on objects. Device 401 intends to join distributed network 400 including other devices or machines, referred to as receivers. Network 400 includes a host 406 containing a lookup service 407 and also includes receivers 408, 411, and 414. Only three receivers are shown for illustrative purposes only; network 400 may include fewer or more receivers and would usually include many receivers. Each receiver shown contains RMI, shown by RMIs 409, 412, and 415. Each of the RMIs for the receivers constructs a remote reference to object 402. These remote references include objects 410, 413, and 416 for, respectively, receivers 408, 411, and 414.
[0061] In order to join network 400, device 401 transmits a multicast packet 417 including a an indication of code 404, such as a reference to the code or the code itself, required to communicate with device 401. A multicast packet is a message sent to a plurality of devices in a network. Device 401 uses RMI 403 to provide flexibility, allowing code to be moved when necessary along with information or the object's state and type. Additionally, device 401 may include in multicast packet 417 an identification of the type of object transmitted, the data constituting the state of the object, and a network-accessible location in the form of a URL for code that is associated with the object. Multicast packet 417 may also include a stub for communicating with the booting device. URLs are known in the art and an explanation, which is incorporated herein by reference, appears in, for example, a text entitled “The Java Tutorial: Object-Oriented Programming for the Internet,” pp. 494-507, by Mary Campione and Kathy Walrath, Addison-Wesley, 1996.
[0062] In response to multicast packet 417, receivers 408, 411, and 414 transmit responses 418, 421, and 422, each response including a reference for use in communicating with lookup service 407. When receiving machine 408 receives multicast packet 417, it identifies the type of transmitted object. In order to send the response and communicate with device 401, receivers 408, 411, and 414 use the reference from device 401 to transmit calls 419, 423, and 424 to code server 405 in order to obtain code 404 for communicating with device 401. A code server is an entity and process that has access to code and responds to requests for a particular type or class of object and returns code for that object. A code server may be located within device 401 or on another machine. Also, the code may be resident on the same platform as the code server or on a separate platform.
[0063] RMI 409, for example, may use a URL from multicast packet 417 to locate the code and transfer a copy of the code to receiver 408. Because the code is bytecodes and is therefore portable, a receiving machine can load the code into its RMI to reconstruct the object. Thus, receivers 408, 411, and 414 can reconstruct an object of the appropriate type even if that kind of object has not been present on the machines before.
[0064] Receivers 408, 411, and 414 use code 404 to construct an object for transmitting responses 418, 421, and 422. Alternatively, device 401 may transmit the code instead of a reference to the code. Device 401 receives the responses and, using at least one of the transmitted references, registers itself with lookup service 407 via call 420. These calls may be remote procedure calls, and the objects may be transmitted as byte streams. Device 401 may transmit a message to register with a lookup service, the message containing information identifying the device so that machines using the lookup service may access or communicate with the device. Remote procedure calls, and methods for downloading code, are described in U.S. patent application Ser. No. 08/950,756, filed on Oct. 15, 1997, and entitled “Deferred Reconstruction of Objects and Remote Loading in a Distributed System,” which is incorporated herein by reference. Streams used in the Java programming language, including input and output streams, are known in the art and an explanation, which is incorporated herein by reference, appears in, for example, a text entitled “The Java™ Tutorial: Object-Oriented Programming for the Internet,” pp. 325-53, by Mary Campione and Kathy Walrath, Addison-Wesley, 1996.
Process for a Device to Join a Network
[0065] FIG. 5 is a flow chart of a process 500 for device to join a network, such as distributed network 400. A device wishing to join a network transmits a multicast packet to the network, the packet including an indication of code, such as a reference to code or the code itself, for use in communicating with the device (step 501). Table 1 shows in pseudocode an example of information in a multicast packet. This packet may be transmitted from what is referred to as a bootstrap or discovery request service, which runs on the discovery server identified above with reference to FIG. 3 and accepts requests for references to a lookup service. Therefore, when a device joins a network in this example, referred to as “boot” into a Djinn, it may use the bootstrap request service to boot into the network.
| TABLE 1 | |
|---|---|
| bootstrap protocol version | int protoVersion; |
| transport-specific endpoint info | Object endpoint; |
| device ID | String id = DeviceID.getDevice ID (); |
| URL from which to load stub | java.net.URL codebase; |
| name of the stub class | String stubType; |
| ByteArrayOutputStream byteStr = new | |
| ByteArrayOutputStream (); | |
| ObjectOutputStream objStr = new | |
| ObjectOutputStream | |
| (byteStr); | |
| objStr.writeInt (protoVersion); | |
| objStr.writeObject (endpoint); | |
| objStr.writeUTF (id); | |
| objStr.writeUTF | |
| (codebase.toExternalForm ()); | |
| objStr.writeUTF (stubType); | |
| the final product | byte [] packetBody = |
| byteStr.toByteArray (); | |
[0066] The following is an explanation of the fields of the exemplary packet shown in Table 1. The “protoVersion” field contains an integer which indicates the version of the bootstrap protocol in operation for a device to join a network. The “endpoint” field encapsulates transport-dependent endpoint information which allows instances of the bootstrap request service to construct valid references to the bootstrap response service on the booting entity. The “id” field contains a “Device ID” string, which identifies the booting device. The “codebase” field provides a URL from which instances of the bootstrap request service can download stub code for the bootstrap response service. The “stubType” field provides a fully-qualified name of the stub class for the bootstrap response service.
[0067] Upon receiving the multicast packet receivers in the network download the code to construct an object for communicating with the device. The receivers each transmit the object to the device, the object including a reference to a lookup service in the network (step 502). The receivers may use what is referred to as a bootstrap or discovery response service, which runs on a discovering (booting) entity and accepts references to the lookup service. Table 2 illustrates an exemplary Java interface for a bootstrap response service.
| TABLE 2 | ||
|---|---|---|
| public interface | ResponseService extends java.rmi.Remote |
[0068] The receivers, through the bootstrap response service, provide a reference to an object that implements a service registrar, which may correspond to the lookup service explained in U.S. patent application filed on even date herewith, assigned to a common assignee, and entitled “Dynamic Lookup Service for a Distributed System,” which is incorporated herein by reference. If the device received no response to the multicast packet, it may continue sending multicast packets at regular intervals.
[0069] Upon receiving the object, the device uses at least one of the reference transmitted by the receivers in order to register with the lookup service (step 503) through the service registrar. After registration, the lookup service subsequently contains an identification of the device, and it is thus accessible to other entities in the network. In addition to registering with the lookup service, the device may optionally respond, providing notification of its registration or other information, to each of the receivers from which it received a response to the multicast packet (step 504).
[0070] The protocol and method described above may also be used for providing an object containing all behavior necessary to communicate with a particular device. Thus, devices do not necessarily require that they maintain an indication of code for communicating with the particular device, as they may obtain that information from the particular device using the method described above.
[0071] Machines implementing the steps shown in FIG. 5 may include computer processors for performing the functions, as shown in FIGS. 1, 2, 3, and 4. They may include modules or programs configured to cause the processors to perform the above functions. They may also include computer program products stored in a memory. The computer program products may include a computer-readable medium or media having computer-readable code embodied therein for causing the machines to perform functions described above. The media may include a computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause the processor to securely address a peripheral device at an absolute address by performing the method described in this specification. The media may also include data structures for use in performing the method described in this specification.
[0072] Although the illustrative embodiments of the systems consistent with the present invention are described with reference to a computer system implementing the Java programming language on the JVM specification, the invention is equally applicable to other computer systems processing code from different programming languages. Specifically, the invention may be implemented with both object-oriented and nonobject-oriented programming systems. In addition, although an embodiment consistent with the present invention has been described as operating in the Java programming environment, one skilled in the art will appreciate that the present invention can be used in other programming environments as well.
[0073] While the present invention has been described in connection with an exemplary embodiment, it will be understood that many modifications will be readily apparent to those skilled in the art, and this application is intended to cover any adaptations or variations thereof. For example, different labels or definitions for the multicast packet may be used without departing from the scope of the invention. This invention should be limited only by the claims and equivalents thereof.
Claims
What is claimed is:
1. A method for processing downloadable code for use in communicating with a machine in a distributed system comprised of multiple machines, the method comprising:
receiving from a machine a multicast packet including a request to join the distributed system and including an indication of code for communicating with the machine;
using the indication of code to download the code;
constructing an object using the downloaded code to communicate with the machine;
constructing a response to the machine including a reference to an entity for registration with the system; and
transmitting the response to the machine.
2. The method of claim 1, wherein using the indication of code to access and download the code further comprises:
using a universal resource locator to download the code.
3. The method of claim 1, wherein receiving from the machine the multicast packet further comprises:
including in the multicast packet an identification of at least one of the type and state of the object to be downloaded.
4. The method of claim 1, wherein the multicast packet includes a stub for communicating with a booting device.
5. An apparatus for processing downloadable code for use in communicating with a machine in a distributed system comprised of multiple machines comprising:
a receiving module for receiving from a machine a multicast packet including a request to join the distributed system and including an indication of code for communicating with the machine;
a use module for using the indication of code to download the code;
a constructing module for constructing an object using the downloaded code to communicate with the machine;
a constructing module for constructing a response to the machine including a reference to an entity for registration with the system; and
a transmitting module for transmitting the response to the machine.
6. The apparatus of claim 5, wherein the use module for using the indication of code to access and download the code further comprises:
a use module for using a universal resource locator to download the code.
7. The apparatus of claim 5, wherein the receiving module for receiving from the machine the multicast packet further comprises:
an including module for including in the multicast packet an identification of at least one of the type and state of the object to be downloaded.
8. The apparatus of claim 5, wherein the multicast packet includes a stub for communicating with a booting device.
9. A computer-readable medium containing instructions for processing downloadable code for use in communicating with a machine in a distributed system comprised of multiple machines comprising:
receiving from a machine a multicast packet including a request to join the distributed system and including an indication of code for communicating with the machine;
using the indication of code to download the code;
constructing an object using the downloaded code to communicate with the machine;
constructing a response to the machine including a reference to an entity for registration with the system; and
transmitting the response to the machine.
10. The computer-readable medium of claim 9, wherein using the indication of code to access and download the code further comprises:
using a universal resource locator to download the code.
11. The computer-readable medium of claim 9, wherein receiving from the machine the multicast packet further comprises:
including in the multicast packet an identification of at least one of the type and state of the object to be downloaded.
12. The computer-readable medium of claim 9, wherein the multicast packet includes a stub for communicating with a booting device.
Patent Citations (216)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4430699(A) | 1984-02-01 | Segarra et al. | Applicant |
| US4491946(A) | 1985-01-01 | Kryskow, Jr. et al. | Applicant |
| US4558413(A) | 1985-12-01 | Schmidt et al. | Applicant |
| 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 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 | Applicant |
| 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 | Scaizi 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 |
| US5675797(A) | 1997-10-01 | Chung et al. | Applicant |
| US5680573(A) | 1997-10-01 | Rubin 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 | Barbara | 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 | Cetjin 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 |
| US5805805(A) | 1998-09-01 | Civanlar et al. | Examiner |
| 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 | Malik 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. | Applicant |
| 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 |
| US5867653(A) | 1999-02-01 | Aras et al. | Examiner |
| 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 | Borroughs et al. | Applicant |
| US5884024(A) | 1999-03-01 | Lim et al. | Applicant |
| US5884079(A) | 1999-03-01 | Furusawa | Applicant |
| US5886707(A) | 1999-03-01 | Berg | Examiner |
| 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. | Applicant |
| US5935249(A) | 1999-08-01 | Stern et al. | Applicant |
| US5940391(A) | 1999-08-01 | Malkin et al. | Examiner |
| 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. | Applicant |
| US5956509(A) | 1999-09-01 | Kevner | Applicant |
| US5963947(A) | 1999-10-01 | Ford et al. | Applicant |
| US5964836(A) | 1999-10-01 | Rowe et al. | Examiner |
| US5966531(A) | 1999-10-01 | Skeen et al. | Applicant |
| US5969967(A) | 1999-10-01 | Aahlad et al. | Applicant |
| US5973696(A) | 1999-10-01 | Agranat et al. | Examiner |
| US5974201(A) | 1999-10-01 | Chang et al. | Applicant |
| US5978484(A) | 1999-11-01 | Apperson et al. | Applicant |
| US5982773(A) | 1999-11-01 | Nishimura et al. | Examiner |
| 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. | Applicant |
| US6003763(A) | 1999-12-01 | Gallagher et al. | Applicant |
| US6006253(A) | 1999-12-01 | Kumar et al. | Examiner |
| US6009103(A) | 1999-12-01 | Woundy | Applicant |
| US6016496(A) | 2000-01-01 | Roberson | Applicant |
| US6016516(A) | 2000-01-01 | Horikiri | Applicant |
| US6023586(A) | 2000-02-01 | Gaisford et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6031977(A) | 2000-02-01 | Pettus | Applicant |
| US6032151(A) | 2000-02-01 | Arnold et al. | Applicant |
| US6044381(A) | 2000-03-01 | Boothby et al. | Applicant |
| US6049878(A) | 2000-04-01 | Caronni et al. | Examiner |
| US6052761(A) | 2000-04-01 | Hornung et al. | Applicant |
| 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 |
| US6075863(A) | 2000-06-01 | Krishnan et al. | Examiner |
| US6085255(A) | 2000-07-01 | Vincent et al. | Applicant |
| US6108346(A) | 2000-08-01 | Doucette et al. | Applicant |
| US6134581(A) | 2000-10-01 | Ismael et al. | Examiner |
| US6134603(A) | 2000-10-01 | Jones et al. | Applicant |
| US6138144(A) | 2000-10-01 | DeSimone et al. | Examiner |
| US6154463(A) | 2000-11-01 | Aggarwal et al. | Examiner |
| US6161137(A) | 2000-12-01 | Ogdon et al. | Examiner |
| US6173314(B1) | 2001-01-01 | Kurashima et al. | Examiner |
| US6182083(B1) | 2001-01-01 | Scheifler et al. | Applicant |
| US6185602(B1) | 2001-02-01 | Bayrakeri | Applicant |
| US6185611(B1) | 2001-02-01 | Waldo et al. | Applicant |
| US6199116(B1) | 2001-03-01 | May et al. | Examiner |
| US6212676(B1) | 2001-04-01 | Seaman et al. | Examiner |
| US6216138(B1) | 2001-04-01 | Wells et al. | Applicant |
| US6226746(B1) | 2001-05-01 | Scheifler | Applicant |
| US6247091(B1) | 2001-06-01 | Lovett | Applicant |
| 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. | Applicant |
| US6339783(B1) | 2002-01-01 | Horikiri | Applicant |
| EP300516 | 1989-01-01 | Applicant | |
| EP351536 | 1990-01-01 | Applicant | |
| EP384339 | 1990-02-01 | Applicant | |
| EP472874 | 1992-03-01 | Applicant | |
| EP474340 | 1992-03-01 | Applicant | |
| EP497022 | 1992-08-01 | Applicant | |
| EP555997 | 1993-08-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 | |
| EP718761 | 1995-12-01 | Applicant | |
| EP697655 | 1996-02-01 | Applicant | |
| EP810524 | 1997-05-01 | Applicant | |
| EP778520 | 1997-06-01 | Applicant | |
| EP767432 | 1997-09-01 | Applicant | |
| EP794493 | 1997-09-01 | Applicant | |
| EP803810 | 1997-10-01 | Applicant | |
| EP803811 | 1997-10-01 | Applicant | |
| EP805393 | 1997-11-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 | |
| GB262825 | 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/03692 | 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 (123)
- Hodges, Douglas, “Managing Object Lifetimes in OLE,” Aug. 25, 1994, p. 1-41.Applicant
- 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
- 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
- Guyennet 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
- Yin et al., “Volume Leases for Consistency in Large-Scale Systems,” IEEE Transactions on Knowledge & Data Engineering, vol. 11, No. 4, pp. 563-576, Jul./Aug. 1999.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, 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.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
- Hamilton et al., “Subcontract: a flexible base for distributed programming”; Proceedings of 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, 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”, 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 Commerical 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
- Venners, B., “Jini Technology, Out of the Box”, Javaworld, Online!, pp 1-4, Dec. 1998.Applicant
- Waldo J et al: “Events in an RPC based distributed system” Processing 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
- Yemini, Y. and S. da silva, “Towards Programmable Networks”, IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, L'Aquila, Italy, 10/96.Applicant
- Yin J. et al., “Using Leases to Support Server Driven Consistency in Large-Scale Systems”, Computer Services Department, University of Texas at Austin, p. 285-294.Applicant
- Guth, Rob: “JavaOne: Sun to Exapnd Java Distributed Computing Effort”, http://www.sunworld.com/swol-02-1998/swol-02-sunspots.html, XP-002109935, p. 1 (1998).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
- 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
- “Eden Project Proposal,” Department of Computer Science, University of Washington, Oct. 1980, Technical Report#80-10-01, cover and Foreword.Applicant
- Almes et al., “Edmas: A Locally Distributed Mail System,” Department of Computer Science, University of Washington, Technical Report 83-07-01, Jul. 7, 1983, Abstract & pp. 1-17.Applicant
- Almes et al., “Research in Integrated Distributed Computing,” Department of Computer Science, University of Washington, Oct. 1979, pp. 1-42.Applicant
- Almes et al., “The Eden System: A Technical Review,” Department of Computer Science, University of Washington, Technical Report 83-10-05, Oct. 1983, pp. 1-25.Applicant
- Almes, “Integration and Distribution in the Eden System,” Department of Computer Science, University of Washington, Technical Report 83-01-02, Jan. 19, 1983, pp. 1-18 & Abstract.Applicant
- Almes, “The Evolution of the Eden Invocation Mechanism,” Department of Computer Science, University of Washington, Technical Report 83-01-03, Jan. 19, 1983, pp. 1-14 & Abstract.Applicant
- Arnold, Ken, “The Jini Architecture: Dynamic Services in a Flexible Network,” Sun Microsytems, Inc., Proceedings of the 36th ACM IEEE Design Automation Conference, Jun. 1999, pp. 157-162.Applicant
- Begole et al., “Transparent Sharing of Java Applets: A Replicated Approach,” Oct. 1997, pp. 55-65.Applicant
- Black et al,. “A Language for Distributed Programming,” Department of Computer Science, University of Washington, Technical Report 86-02-03, Feb. 1986, p. 10.Applicant
- Black et al., “Distribution and Abstract Types in Emerald,” University of Washington, Technical Report No. 85-08-05, Aug. 1985, pp. 1-10.Applicant
- Black et al., “Object Structure in the Emerald System,” University of Washington, Technical Report 86-04-03, Apr. 1986, pp. 1-14.Applicant
- Black et al., “The Eden Project: A Final Report,” Department of Computer Science, University of Washington, Technical Report 86-11-01, Nov. 1986, pp. 1-28.Applicant
- Black, “Supporting Distributed Applications: Experience wtih Eden,” Department of Computer Science, University of Washington, Technical Report 85-03-02, Mar. 1985, pp. 1-21.Applicant
- Black, “The Eden Programming Language,” Department of Computer Science, FR-35, University of Washington, Technical Report 85-09-01, Sep. 1985 (Revised Dec. 1985), pp. 1-19.Applicant
- Black, “The Eden Project: Overview and Experiences,” Department of Computer Science, University of Washington, EUUG, Autumn '86 Conference Proceedings, Manchester, UK, Sep. 22-25, 1986, pp. 177-189.Applicant
- Braine et al., “Object-Flow,” 1997, pp. 418-419.Applicant
- Ciancarini et al., “Coordinating Distributed Applets with Shade/Java,” Feb. 1998, pp. 130-138.Applicant
- Delcambre et al., “Simulation of the Object Flow Model: A Conceptual Modeling Language for Object-Driven Applications,” 1993, pp. 216-225.Applicant
- Goldberg et al., “Smalltalk-80—The Language and its Implementation,” Xerox Palo Alto Research Center, 1983 (reprinted with corrections, Jul. 1985), pp. 1-720.Applicant
- Holman et al., “The Eden Shared Calendar System,” Department of Computer Science, FR-35, University of Washington, Technical Report 85-05-02, Jun. 22, 1985, pp. 1-14.Applicant
- Hsu, “Reimplementing Remote Procedure Calls,” University of Washington, Thesis, Mar. 22, 1985, pp. 1-106.Applicant
- Hutchinson, “Emerald: An Object-Based Language for Distributed Programming,” a Dissertation, University of Washington, 1987, pp. 1-107.Applicant
- Jacob, “The Use of Distributed Objects and Dynamic Interfaces in a Wide-Area Transaction Environment,” SIGCOMMn '95 Workshop on Middleware: Cambridge, Mass., Aug. 1995, pp. 1-3.Applicant
- Jul et al., “Fine-Grained Mobility in the Emerald System,” University of Washington, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 109-133.Applicant
- Jul, “Object Mobility in a Distributed Object-Oriented System,” a Dissertation, University of Washington, 1989, pp. 1-154 (1 page Vita).Applicant
- Koshizuka et al., “Window Real-Objects: A Distributed Shared Memory for Distributed Implementation of GUI Applications,” Nov. 1993, pp. 237-247.Applicant
- Krasner et al., “Smalltalk-80: Bits of History, Words of Advice,” 1983, Xerox Corporation, pp. 1-344.Applicant
- Lavana et al., “Executable Workflows: A Paradigm for Collaborative Design on the Internet,” Jun. 1997, 6 pages.Applicant
- Proceedings of the Eighth Symposium on Operating Systems Principles, Dec. 14-16, 1981, ACM, Special Interest Group on Operating Systems, Association for Computing Machinery, vol. 15, No. 5, Dec. 1981, ACM Order No. 534810.Applicant
- Proudfoot, “Replects: Data Replication in the Eden System,” Department of Computer Science, University of Washington, Technical Report No. TR-85-12-04, Dec. 1985, pp. 1-156.Applicant
- Pu, “Replication and Nested Transaction in the Eden Distributed System,” Doctoral Dissertation, University of Washington, Aug. 6, 1986, pp. 1-179 (1 page Vita).Applicant
- Trehan et al., “Toolkit for Shared Hypermedia on a Distributed Object Oriented Architecture,” 1993, pp. 1-8.Applicant