Downloadable smart proxies for performing processing associated with a remote procedure call in a distributed system

Information

  • Patent Grant
  • 9183066
  • Patent Number
    9,183,066
  • Date Filed
    Monday, May 6, 2002
    22 years ago
  • Date Issued
    Tuesday, November 10, 2015
    8 years ago
Abstract
Use of a smart proxy as a wrapper around a stub in a distributed system. Instead of receiving a stub as a result of a remote procedure call, a caller receives a smart proxy including the stub as an embedded object. The smart proxy performs predefined processing associated with a remote procedure call, the processing possibly occurring before, during, or after a response to the call.
Description
FIELD OF THE INVENTION

The present invention relates to a system and method for transmitting objects between machines in a distributed system and more particularly relates to transmission of a representation of a remote object including code for local processing.


BACKGROUND OF THE INVENTION

Distributed programs which concentrate on point-to-point data transmission can often be adequately and efficiently handled using special-purpose protocols for remote terminal access and file transfer. Such protocols are tailored specifically to the one program and do not provide a foundation on which to build a variety of distributed programs (e.g., distributed operating systems, electronic mail systems, computer conferencing systems, etc.).


While conventional transport services can be used as the basis for building distributed programs, these services exhibit many organizational problems, such as the use of different data types in different machines, lack of facilities for synchronization, and no provision for a simple programming paradigm.


Distributed systems usually contain a number of different types of machines interconnected by communications networks. Each machine has its own internal data types, its own address alignment rules, and its own operating system. This heterogeneity causes problems when building distributed systems. As a result, program developers must include in programs developed for such heterogeneous distributed systems the capability of ensuring that information is handled and interpreted consistently in different machines.


However, one simplification is afforded by noting that a large proportion of programs use a request and response interaction between processes where the initiator (i.e. program initiating a communication) is blocked out until the response is returned and is thus idle during this time. This can be modeled by a procedure call mechanism between processes. One such mechanism is referred to as the remote procedure call (RPC).


RPC is a mechanism for providing synchronized communication between two processes (e.g., program, applet, etc.) running on the same machine or different machines. In a simple case, one process, e.g., a client program, sends a message to another process, e.g., a server program. In this case, it is not necessary for the processes to be synchronized either when the message is sent or received. It is possible for the client program to transmit the message and then begin a new activity, or for the server program's environment to buffer the incoming message until the server program is ready to process a new message.


RPC, however, imposes constraints on synchronism because it closely models the local procedure call, which requires passing parameters in one direction, blocking the calling process (i.e., the client program) until the called procedure of the server program is complete, and then returning a response. RPC thus involves two message transfers, and the synchronization of the two processes for the duration of the call.


The RPC mechanism is usually implemented in two processing parts using the local procedure call paradigm, one part being on the client side and the other part being on the server side. Both of these parts will be described below with reference to FIG. 1.



FIG. 1 is a diagram illustrating the flow of call information using an RPC mechanism. As shown in FIG. 1, a client program 100 issues a call (step 102). The RPC mechanism 101 then packs the call as arguments of a call packet (step 103), which the RPC mechanism 101 then transmits to a server program 109 (step 104). The call packet also contains information to identify the client program 100 that first sent the call. After the call packet is transmitted (step 104), the RPC mechanism 101 enters a wait state during which it waits for a response from the server program 109.


The RPC mechanism 108 for the server program 109 (which may be the same RPC mechanism as the RPC mechanism 101 when the server program 109 is on the same platform as the client program 100) receives the call packet (step 110), unpacks the arguments of the call from the call packet (step 111), identifies, using the call information, the server program 109 to which the call was addressed, and provides the call arguments to the server program 109.


The server program receives the call (step 112), processes the call by invoking the appropriate procedure (step 115), and returns a response to the RPC mechanism 108 (step 116). The RPC mechanism 108 then packs the response in a response packet (step 114) and transmits it to the client program 100 (step 113).


Receiving the response packet (step 107) triggers the RPC mechanism 101 to exit the wait state and unpack the response from the response packet (step 106). RPC 101 then provides the response to the client program 100 in response to the call (step 105). This is the process flow of the typical RPC mechanism modeled after the local procedure call paradigm. Since the RPC mechanism uses the local procedure call paradigm, the client program 100 is blocked at the call until a response is received. Thus, the client program 100 does not continue with its own processing after sending the call; rather, it waits for a response from the server program 109.


The Java™ programming language is an object-oriented programming language that is typically compiled into a platform-independent format, using a bytecode instruction set, which can be executed on any platform supporting the Java virtual machine (JVM). This language is described, for example, in a text entitled “The Java Language Specification” by James Gosling, Bill Joy, and Guy Steele, Addison-Wesley, 1996, which is incorporated herein by reference. The JVM is described, for example, in a text entitled “The Java Virtual Machine Specification,” by Tim Lindholm and Frank Yellin, Addison Wesley, 1996, which is incorporated herein by reference. Java and Java-based trademarks are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.


Because the JVM may be implemented on, any type of platform, implementing distributed programs using the JVM significantly reduces the difficulties associated with developing programs for heterogenous distributed systems. Moreover, the JVM uses a Java remote method invocation system (RMI) that enables communication among programs of the system. 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://wwwjavasoft.com/products/jdk/1.1/docs/guide/rmi/spec/rmiTOC.doc.html.



FIG. 2 is a diagram illustrating the flow of objects in an object-oriented distributed system 200 including machines 201 and 202 for transmitting and receiving method invocations using the JVM. In system 200, machine 201 uses RMI 205 for responding to a call for object 203 by converting the object into a byte stream 207 including an identification of the type of object transmitted and data constituting the object. While machine 201 is responding, to the call for object 203, a process running on the same or another machine in system 200 may continue operation without waiting for a response to its request.


Machine 202 receives the byte stream 207. Using RMI 206, machine 202 automatically converts it into the corresponding object 204, which is a copy of object 203 and which makes the object available for use by a program executing on machine 202. Machine 202 may also transmit the object to another machine by first converting the object into a byte stream and then sending it to the third machine, which also automatically converts the byte stream into the corresponding object.


The communication between these machines sometimes involves, for example, repeated calls for the same information. These calls are made to a local proxy, which acts as a surrogate for the remote object in the address space of the client. Such a proxy will service the call by making a network request to the server object. Repeated calls to the same server object through a proxy can generate considerable network traffic, increasing the time and expense of obtaining the information. Accordingly, a need exists for a technique that reduces the amount of network communication in, for example, such a case.


SUMMARY OF THE INVENTION

A method consistent with the present invention transmits a request for a particular object. A response to the request is received, the response including code used to construct a representation of the requested object, the construction creating an object for processing calls to the object, local to the requesting object, using the representation.


Another method consistent with the present invention receives at a machine a request for a particular object. A response to the request is transmitted, the response including first code for constructing a representation of the object and including an indication of second code for processing, such that the construction creates an object for processing calls to the object, local to the requesting object, using the representation.


An apparatus consistent with the present invention transmits a request for a particular object. The apparatus receives a response to the request, the response including code used to construct a representation of the requested object, the construction creating an object for processing calls to the object, local to the requesting object, using the representation.


Another apparatus consistent with the present invention receives at a machine a request for a particular object. The apparatus transmits a response to the request, the response including first code for constructing a representation of the object and including an indication of second code for processing, such that the construction creates an object for processing calls to the object, local to the requesting object, using the representation.





BRIEF DESCRIPTION OF THE DRAWINGS

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,



FIG. 1 is a diagram illustrating the flow of call information using an RPC mechanism;



FIG. 2 is a diagram illustrating the transmission of objects in an object-oriented distributed system;



FIG. 3 is a diagram of an exemplary distributed processing system that can be used in an implementation consistent with the present invention;



FIG. 4 is a diagram of an exemplary distributed system infrastructure;



FIG. 5 is a diagram of a computer in a distributed system infrastructure shown in FIG. 4;



FIG. 6 is a block diagram of a distributed network for use in downloading smart proxies;



FIG. 7 is a flow chart of a process for downloading smart proxies within, for example, the distributed network shown in FIG. 6; and



FIG. 8 is a flow chart of a process for changing the processing performed by a smart proxy.





DETAILED DESCRIPTION
Overview

Instead of receiving a proxy that only makes network requests to the object for which it is a surrogate, a machine in a distributed system receives a smart proxy. Such a proxy can respond to calls on the object for which it is a surrogate without making any network calls to increase program efficiency, or perform processing before making a network call or after the completion of the network call to increase program functionality. The term proxy generally refers to code or other mechanism used to act as a surrogate for a remote object in the address space of a machine,


Systems transferring stubs and associated smart proxies may use a variant of an RPC or RMI, passing arguments and return values from one process to another process each of which may be on different machines. The term “machine” is used in this context to refer to a physical machine or a virtual machine. Multiple virtual machines may exist on the same physical machine. Examples of RPC systems include distributed computed environment (DCE) RPC and Microsoft distributed common object model (DCOM) RPC. A memory stores the stub and associated smart proxy, and this memory may include secondary sources such as a disk or receiving objects from the Internet.


Distributed Processing System


FIG. 3 illustrates an exemplary distributed processing system 300 which can be used in an implementation consistent with the present invention. In FIG. 3, distributed processing system 300 contains three independent and heterogeneous platforms 301, 302, and 303 connected in a network configuration represented by network cloud 319. The composition and protocol of the network configuration represented by cloud 319 is not important as long as it allows for communication of the information between platforms 301, 302 and 303. 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 this 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.


In the implementation of distributed processing system 300, platforms 301, 302 and 303 each include a processor 316, 317, and 318 respectively, and a memory, 304, 305, and 306, respectively. Included within each memory 304, 305, and 306, are applications 307, 308, and 309, respectively, operating systems 310, 311, and 312, respectively, and RMI components 313, 314, and 315, respectively.


Applications 307, 308, and 309 can be applications or 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 307, 308, and 309 invoke operations to be performed in accordance with an implementation consistent with this invention.


Operating systems 310, 311, and 312 are typically standard operating systems tied to the corresponding processors 316, 317, and 318, respectively. The platforms 301, 302, and 303 can be heterogenous. For example, platform 301 has an UltraSparc® microprocessor manufactured by Sun Microsystems, Inc. as processor 316 and uses a Solaris® operating system 310. Platform 302 has a MIPS microprocessor manufactured by Silicon Graphics Corp. as processor 317 and uses a Unix operating system 311. Finally, platform 303 has a Pentium microprocessor manufactured by Intel Corp. as processor 318 and uses a Microsoft Windows 95 operating system 312. An implementation consistent with the present invention is not so limited and could accommodate homogenous platforms as well.


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.


Memories 304, 305, and 306 serve several functions, such as general storage for the associated platform. Another function is to store applications 307, 308, and 309, RMI components 313, 314, and 315, and operating systems 310, 311, and 312 during execution by the respective processor 316, 317, and 318. In addition, portions of memories 304, 305, and 306 may constitute shared memory available to all of the platforms 301, 302, and 303 in network 319. Note that RMI components 313, 314, and 315 operate in conjunction with a JVM, which is not shown for the purpose of simplifying the figure.


Distributed System Infrastructure

Systems and methods consistent with the present invention may also operate within a particular distributed system 400, which will be described with reference to FIGS. 4 and 5. This distributed system 400 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) provide programmers with tools and programming patterns that allow development of robust, 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 400 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.


In distributed system 400 of FIGS. 4 and 5, 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 400 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 400 may contain thousands of devices operated by users who are geographically disperse, but who agree on basic notions of trust, administration, and policy.


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.


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.


Distributed system 400 is comprised of computer 402, a computer 404, and a device 406 interconnected by a network 408. Device 406 may be any of a number of devices, such as a printer, fax machine, storage device, computer, or other devices. Network 408 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 400, one skilled in the art will appreciate that distributed system 400 may include additional computers or devices.



FIG. 5 depicts computer 402 in greater detail to show a number of the software components of distributed system 400. One skilled in the art will appreciate that computer 404 or device 406 may be similarly configured. Computer 402 includes a memory 502, a secondary storage device 504, a central processing unit (CPU) 506, an input device 508, and a video display 510. Memory 502 includes a lookup service 512, a discovery server 514, and a Java runtime system 516. The Java runtime system 516 includes the Java RMI system 518 and a JVM 520. Secondary storage device 504 includes a Java space 522.


As mentioned above, distributed system 400 is based on the Java programming environment and thus makes use of the Java runtime system 516. The Java runtime system 516 includes the Java API libraries, 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 libraries provide 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 516 is provided as part of the Java software development kit available from Sun Microsystems, Inc. of Mountain View, Calif.


JVM 520 also facilitates platform independence. JVM 520 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 518 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.


Lookup service 512 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 400. Lookup service 512 contains one object for each service within the Djinn, and each object contains various methods that facilitate access to the corresponding service. Lookup service 512 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.


Discovery server 514 detects when a new device is added to distributed system 400, 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 512 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 512. 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.


A Java space 522 is an object repository used by programs within distributed system 400 to store objects. Programs use a Java space 522 to store objects persistently as well as to make them accessible to other devices within distributed system 400. 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 400 may contain many lookup services, discovery servers, and Java spaces.


Data Flow in a Distributed Processing System


FIG. 6 is a block diagram of an object-oriented distributed network 600 connecting machines 601 and 606, such as computers or virtual machines executing on one or more computers, or the machines described with reference to FIGS. 3, 4, and 5. Network 600 transmits proxies, some of which may be smart proxies. A smart proxy includes code for performing processing associated with a call. For example, a smart proxy may perform a caching operation for read-only data for later reference. When a call is made for that data, the smart proxy may obtain it locally and provide it to a user without making another call for the data, which may occur transparent to the user. An example of such read-only data is a particular installation time. The first time a call is made for the installation time, for example, a smart proxy locally caches that value, and when a subsequent call is made for the installation time, the smart proxy locally retrieves the value.


Another example of smart proxy processing involves use of a serialized object for transmitting data to a data bank storing information. In this example, a call is made to a smart proxy, which receives an object, serializes the object on the client machine into an array of bytes, and transmits the array of bytes to a server. The server only stores the serialized object, avoiding the requirement to download code, and it provides a key for the object to the client machine. When the client machine wants to retrieve the data, the smart proxy transmits the key to the server, receives in response the serialized object, reconstructs the object, and provides it to the user.


Other examples of uses of smart proxies include processing for debugging, call logging, and monitoring system performance. Another example involves the use of a smart proxy for local data verification, as explained in U.S. patent application Ser. No. 09/044,932, filed on Mar. 20, 1998, assigned to a common assignee, and entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System,” which is incorporated herein by reference. Many other uses for smart proxies are possible for performing processing associated with a call.


Network 600 includes a client machine 601 containing RMI 602 and associated code 603. A server machine 606 includes RMI 607 and remote object 608. In operation, RMI 602 transmits a call or request 609 to RMI 607, requesting a particular stub object. RMI 607 returns a response 610 including requested stub 605 embedded within a smart proxy 604. The response may be transmitted as a stream. 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.


The response may include information so that client machine 601 can reconstruct the stub object in smart proxy 604. When a set of object types is limited and is the same on machines 601 and 606, a receiving machine typically requires the object's state and a description of its type because the object's code is already present on all network machines. Alternatively, machine 606 uses RMI 607 to provide more flexibility, allowing code to be moved when necessary along with information or the object's state and type. Additionally, a transmitting machine may include in the object 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. 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.


When client machine 601 receives response 610, it identifies the type of transmitted object. Machine 601 contains its own RMI 602 and code 603 for processing of objects, and it may create stub object 605 using the object type, the state information, and code for the object. If code for the object is not resident or available on machine 601 and the stub object does not contain the code, RMI 602 may use a URL from the object to locate the code and transfer a copy of the code to client machine 601. Because the code is bytecodes and is therefore portable, client machine 601 can load the code into RMI 602 to reconstruct the object. Thus, client machine 601 can reconstruct an object of the appropriate type even if that kind of object has not been present on the machine before.


When creating stub object 605, RMI 602 does not necessarily know that the stub is itself a smart proxy 604. Smart proxy 604 may perform processing at client machine 601 before or after response 610 and may supply all processing without resorting to call 609 to the object for which the proxy acts. Therefore, smart proxy 604 may perform all processing locally when client machine 601 makes a call or request 611 to invoke a method on smart proxy 604. These proxies are downloadable by the same methods as disclosed 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.


Transmission of Smart Proxies


FIG. 7 is a flow chart of a process 700 for downloading and using smart proxies within, for example, the distributed network shown in FIG. 6. A client machine transmits a call or request for a particular object (step 701), and a server machine receives the call (step 702). In response, the server machine returns a smart proxy with an embedded stub (step 703), and the proxy acts as a representation of the requested object. After receiving the smart proxy, the client machine invokes a method on it (step 704). According to the code within the smart proxy, the client machine containing the smart proxy determines if preprocessing is required (step 705). If so, the processing is performed locally by the client machine using the smart proxy (step 706).


The client machine then determines if the method called on the smart proxy may be serviced locally (step 707). If so, the client machine performs the local processing for the call (step 711). If not, the client machine calls the remote object (step 708). The remote processing is performed (step 709), and the result of the remote processing is returned to the client machine (step 710).


The client machine determines, according to code in the smart proxy, if post-processing as a result of the call is required (step 712). If so, it locally performs the post-processing using code in the smart proxy (step 713). The smart proxy then returns the method call result (step 714) in response to the call on the smart proxy in step 704.



FIG. 8 is a flow chart of a process 800 for changing the processing performed by a smart proxy. When processing is invoked (step 801), a client machine determines if updated processing is required (step 802). Such information may be contained within the smart proxy itself in that it may determine when or under what particular circumstances it requires updated processing code. If updated processing is required, the code for that processing is downloaded and the smart proxy is updated at the client machine to perform that processing (step 803). The smart proxy then performs at the client machine the processing according to the updated code (step 804).


Machines implementing the steps shown in FIGS. 7 and 8 may include computer processors for performing the functions, as shown in FIGS. 3, 4, 5, and 6. 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 computer readable media may include 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 a data structure for use in performing the method described in this specification.


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.


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 smart proxies may be used without departing from the scope of the invention. This invention should be limited only by the claims and equivalents thereof.

Claims
  • 1. A method for processing calls to a server object locally by a processor at a smart proxy residing in a memory at a client machine, the method comprising: obtaining the smart proxy at the client machine, the smart proxy including stub code corresponding to a stub object for the server object that is used to construct a representation of the stub object for the server object in the smart proxy in the memory at the client machine and the smart proxy including processing code executable by a processor at the client machine for processing calls to the server object locally at the stub object in the smart proxy as a representation of the server object at the client machine;constructing the representation of the stub object for the server object in the smart proxy in the memory at the client machine using the stub code; andprocessing one or more calls to the server object locally at the stub object in the smart proxy using the processor at the client machine using the processing code of the smart proxy at the client machine to generate a response to the one or more calls without communicating the one or more calls to a server machine having the server object.
  • 2. The method of claim 1, further including: processing additional calls to the server object at a server machine when processing said additional calls cannot be completed locally using the processor at the client machine using the stub object in the smart proxy as a representation of the server object at the client machine.
  • 3. The method of claim 1, further including: downloading, to the client machine, update code to update the processing code.
  • 4. A method for sharing objects between a client machine and a server machine in a distributed system for processing calls to the server machine locally at the client machine, comprising: sending a request for a server object from the client machine to the server machine; andresponsive to the request, sending a smart proxy from the server machine to the client machine, the smart proxy including: stub code used to construct a stub object corresponding to the server object in the smart proxy in a memory at the client machine, andan indication of processing code for processing calls to the server object in the smart proxy using a processor at the client machine;wherein when the stub object in the memory at the client machine is constructed and the processing code is executed in the smart proxy by the processor on the client machine, the stub object in the smart proxy at the client machine intercepts at least one call to the server object without transmitting the at least one call to the server object residing on the server and processes the at least one call locally in the smart proxy using the processor at the client machine to generate a response to the at least one call using the stub object in the memory at the client machine and the processing code.
  • 5. The method of claim 4, further including: using the stub code by the smart proxy at the client machine to construct the stub object in the smart proxy at the client machine.
  • 6. The method of claim 4, further including: downloading processing code to the client machine using the indication to update the processing code executed in the smart proxy at the client machine for processing the at least one call to the server object locally in the smart proxy at the client machine using the stub object at the client machine.
  • 7. The method of claim 4, further including: sending additional calls to the server object at the server machine when processing of the additional calls cannot be completed locally in the smart proxy at the client machine; andprocessing the additional calls to the server object at the server machine when processing of the additional calls cannot be completed locally at the client machine using the stub object at the client machine.
  • 8. The method of claim 4, further including: receiving the request for the server object at the server machine; andreceiving the response from the server machine at the client machine after processing the request to the server object at the server machine.
  • 9. A system for processing calls to a server object locally at a smart proxy residing at a client machine, comprising: a server machine having the server object in a server memory of the server machine for processing calls at a server processor at the server machine and generating a response;wherein the client machine: (i) obtains a smart proxy from the server machine, the smart proxy including stub code for constructing a stub object in the smart proxy for storage in a client memory at the client machine that is a representation of the server object and processing code for configuration of a client processor at the client machine for processing calls to the server object locally in the smart proxy using the client processor at the client machine,(ii) constructs the stub object in the smart proxy in the client memory at the client machine using the stub code, and(iii) processes at least one call to the server object locally in the smart proxy using the client processor at the client machine using the processing code to generate a response to the at least one call locally at the client machine without communicating the at least one call to the server machine; anda network connecting the client machine and the server machine.
  • 10. The system of claim 9, wherein the server machine is configured to process additional calls to the server object when processing of the additional calls cannot be completed locally in the smart proxy at the client machine using the stub object in the smart proxy at the client machine.
  • 11. The system of claim 9, wherein the client machine is further configured to download update code to update the processing code.
  • 12. A system for sharing objects in a distributed system for processing calls to a server machine locally at a client machine, comprising: the client machine configured to send a request for a server object to the server machine;the server machine configured to send, responsive to the request, a smart proxy to the client machine, the smart proxy including: stub code for constructing a stub object corresponding to the server object in the smart proxy in a memory at the client machine, andan indication of processing code for configuration of a processor at the client machine for processing calls to the server object in the smart proxy using the stub object at the processor at the client machine such that the stub object in the smart proxy at the client machine processes one or more calls to the server object locally in the smart proxy using the processor at the client machine to generate a response to the one or more calls without sending the one or more calls to the server machine, anda network connecting the client machine and the server machine.
  • 13. The system of claim 12, wherein the client machine is further configured to construct the stub object from the stub code.
  • 14. The system of claim 12, wherein the client machine is further configured to download code to update the processing code.
  • 15. The system of claim 12, wherein the server machine is further configured to process additional calls to the server object at the server machine when processing the additional calls cannot be completed locally in the smart proxy at the client machine using the stub object.
  • 16. The system of claim 12, wherein the client machine is further configured to send the request from the client machine to the server machine, and to receive the smart proxy from the server machine; and wherein, the server machine is further configured to receive the request for the server object.
REFERENCE TO RELATED APPLICATIONS

The following identified U.S. patent applications are relied upon and are incorporated by reference in this application as if fully set forth. Provisional U.S. Patent Application No. 60/076,048, entitled “Distributed Computing System,” filed on Feb. 26, 1998. U.S. Pat. No. 6,263,350, entitled “Method and System for Leasing Storage.” U.S. Pat. No. 6,247,026, entitled “Method, Apparatus, and Product for Leasing of Delegation Certificates in a Distributed System.” U.S. Pat. No. 6,421,704, entitled “Method, Apparatus and Product for Leasing of Group Membership in a Distributed System,” filed on Mar. 20, 1998. U.S. Pat. No. 6,016,500, entitled “Leasing for Failure Detection.” U.S. patent application Ser. No. 09/144,933, entitled “Method for Transporting Behavior in Event Based System,” filed on Mar. 20, 1998. U.S. Pat. No. 6,272,559 entitled “Deferred Reconstruction of Objects and Remote Loading for Event Notification in a Distributed System.” U.S. Pat. No. 6,487,607, entitled “Methods and Apparatus for Remote Method Invocation,” filed on Mar. 20, 1998. U.S. Pat. No. 6,134,603, entitled “Method and System for Deterministic Hashes to Identify Remote Methods.” U.S. Pat. No. 6,598,094, entitled “Method and Apparatus for Determining Status of Remote Objects in a Distributed System,” filed on Mar. 20, 1998. U.S. Pat. No. 6,237,024, entitled “Suspension and Continuation of Remote Methods.” U.S. Pat. No. 6,182,083, entitled “Method and System for Multi-Entry and Multi-Template Matching in a Database.” U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications in a Database,” filed on Mar. 20, 1998. U.S. Pat. No. 6,578,044, entitled “Method and System for Typesafe Attribute Matching in a Database,” filed on Mar. 20, 1998. U.S. Pat. No. 6,185,611, entitled “Dynamic Lookup Service in a Distributed System,” filed on Mar. 20, 1998. U.S. Pat. No. 6,560,656, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” filed on Mar. 20, 1998. U.S. Pat. No. 6,832,223, entitled “Method and System for Facilitating Access to a Lookup Service,” filed on Mar. 20, 1998. U.S. Pat. No. 6,466,947, entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System,” filed on Mar. 20, 1998. U.S. patent application Ser. No. 09/044,936, entitled “An Interactive Design Tool for Persistent Shared Memory Spaces,” filed on Mar. 20, 1998. U.S. Pat. No. 6,438,614, entitled “Polymorphic Token-Based Control,” filed on Mar. 20, 1998. U.S. Pat. No. 6,138,238, entitled “Stack-Based Access Control.” U.S. Pat. No. 6,226,746, entitled “Stack-Based Security Requirements.” U.S. Pat. No. 6,282,652, entitled “Per-Method Designation of Security Requirements.”

US Referenced Citations (293)
Number Name Date Kind
3449669 Carl-Erik Granqvist Jun 1969 A
4430699 Segarra et al. Feb 1984 A
4491946 Kryskow, Jr. et al. Jan 1985 A
4558413 Schmidt et al. Dec 1985 A
4567359 Lockwood Jan 1986 A
4713806 Oberlander et al. Dec 1987 A
4800488 Agrawal et al. Jan 1989 A
4809160 Mahon et al. Feb 1989 A
4819233 Delucia et al. Apr 1989 A
4823122 Mann et al. Apr 1989 A
4939638 Stephenson et al. Jul 1990 A
4956773 Saito et al. Sep 1990 A
4992940 Dworkin Feb 1991 A
5088036 Ellis et al. Feb 1992 A
5101346 Ohtsuki Mar 1992 A
5109486 Seymour Apr 1992 A
5187787 Skeen et al. Feb 1993 A
5218699 Brandle et al. Jun 1993 A
5253165 Leiseca et al. Oct 1993 A
5257369 Skeen et al. Oct 1993 A
5293614 Ferguson et al. Mar 1994 A
5297283 Kelly, Jr. et al. Mar 1994 A
5303042 Lewis et al. Apr 1994 A
5307490 Davidson et al. Apr 1994 A
5311591 Fischer May 1994 A
5319542 King, Jr. et al. Jun 1994 A
5327559 Priven et al. Jul 1994 A
5339430 Lundin et al. Aug 1994 A
5339435 Lubkin et al. Aug 1994 A
5341477 Pitkin et al. Aug 1994 A
5386568 Wold et al. Jan 1995 A
5390328 Frey et al. Feb 1995 A
5392280 Zheng Feb 1995 A
5423042 Jalili et al. Jun 1995 A
5440744 Jacobson et al. Aug 1995 A
5446901 Owicki et al. Aug 1995 A
5448740 Kiri et al. Sep 1995 A
5452459 Drury et al. Sep 1995 A
5455952 Gjovaag Oct 1995 A
5459837 Caccavale Oct 1995 A
5471629 Risch Nov 1995 A
5475792 Stanford et al. Dec 1995 A
5475817 Waldo et al. Dec 1995 A
5475840 Nelson et al. Dec 1995 A
5481721 Serlet et al. Jan 1996 A
5491791 Glowny et al. Feb 1996 A
5504921 Dev et al. Apr 1996 A
5506984 Miller Apr 1996 A
5511196 Shackelford et al. Apr 1996 A
5511197 Hill et al. Apr 1996 A
5524244 Robinson et al. Jun 1996 A
5544040 Gerbaulet Aug 1996 A
5548724 Akizawa et al. Aug 1996 A
5548726 Pettus Aug 1996 A
5553282 Parrish et al. Sep 1996 A
5555367 Premerlani et al. Sep 1996 A
5555427 Aoe et al. Sep 1996 A
5557798 Skeen et al. Sep 1996 A
5560003 Nilsen et al. Sep 1996 A
5561785 Blandy et al. Oct 1996 A
5577231 Scalzi et al. Nov 1996 A
5592375 Salmon et al. Jan 1997 A
5594921 Pettus Jan 1997 A
5603031 White et al. Feb 1997 A
5617537 Yamada et al. Apr 1997 A
5628005 Hurvig May 1997 A
5640564 Hamilton et al. Jun 1997 A
5644720 Boll et al. Jul 1997 A
5644768 Periwal et al. Jul 1997 A
5652888 Burgess Jul 1997 A
5655148 Richman et al. Aug 1997 A
5659751 Heninger Aug 1997 A
5664110 Green et al. Sep 1997 A
5664111 Nahan et al. Sep 1997 A
5664191 Davidson et al. Sep 1997 A
5666493 Wojcik et al. Sep 1997 A
5671225 Hooper et al. Sep 1997 A
5671279 Elgamal Sep 1997 A
5674982 Greve et al. Oct 1997 A
5675796 Hodges et al. Oct 1997 A
5675797 Chung et al. Oct 1997 A
5680573 Rubin et al. Oct 1997 A
5680617 Gough et al. Oct 1997 A
5682534 Kapoor et al. Oct 1997 A
5684955 Meyer et al. Nov 1997 A
5689709 Corbett et al. Nov 1997 A
5694551 Doyle et al. Dec 1997 A
5706435 Barbará et al. Jan 1998 A
5706502 Foley et al. Jan 1998 A
5710887 Chelliah et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5721825 Lawson et al. Feb 1998 A
5721832 Westrope et al. Feb 1998 A
5724540 Kametani Mar 1998 A
5724588 Hill et al. Mar 1998 A
5727048 Hiroshima et al. Mar 1998 A
5727145 Nessett et al. Mar 1998 A
5729594 Klingman Mar 1998 A
5734706 Windsor et al. Mar 1998 A
5737607 Hamilton et al. Apr 1998 A
5742768 Gennaro et al. Apr 1998 A
5745678 Herzberg et al. Apr 1998 A
5745695 Gilchrist et al. Apr 1998 A
5745703 Cejtin et al. Apr 1998 A
5745755 Covey Apr 1998 A
5748897 Katiyar May 1998 A
5754849 Dyer et al. May 1998 A
5754977 Gardner et al. May 1998 A
5757925 Faybishenko May 1998 A
5758077 Danahy et al. May 1998 A
5758328 Giovannoli May 1998 A
5758344 Prasad et al. May 1998 A
5761507 Govett Jun 1998 A
5761656 Ben-Shachar Jun 1998 A
5764897 Khalidi Jun 1998 A
5764915 Heimsoth et al. Jun 1998 A
5764982 Madduri Jun 1998 A
5768532 Megerian Jun 1998 A
5774551 Wu et al. Jun 1998 A
5774729 Carney et al. Jun 1998 A
5778179 Kanai et al. Jul 1998 A
5778187 Monteiro et al. Jul 1998 A
5778228 Wei Jul 1998 A
5778368 Hogan et al. Jul 1998 A
5784560 Kingdon et al. Jul 1998 A
5787425 Bigus Jul 1998 A
5787431 Shaughnessy Jul 1998 A
5790548 Sistanizadeh et al. Aug 1998 A
5790677 Fox et al. Aug 1998 A
5794207 Walker et al. Aug 1998 A
5799173 Gossler et al. Aug 1998 A
5802367 Held et al. Sep 1998 A
5805805 Civanlar et al. Sep 1998 A
5806042 Kelly et al. Sep 1998 A
5808911 Tucker et al. Sep 1998 A
5809144 Sirbu et al. Sep 1998 A
5809507 Cavanaugh, III Sep 1998 A
5812819 Rodwin et al. Sep 1998 A
5813013 Shakib et al. Sep 1998 A
5815149 Mutschler, III et al. Sep 1998 A
5815709 Waldo et al. Sep 1998 A
5815711 Sakamoto et al. Sep 1998 A
5818448 Katiyar Oct 1998 A
5829022 Watanabe et al. Oct 1998 A
5832219 Pettus Nov 1998 A
5832529 Wollrath et al. Nov 1998 A
5832593 Wurst et al. Nov 1998 A
5835737 Sand et al. Nov 1998 A
5842018 Atkinson et al. Nov 1998 A
5844553 Hao et al. Dec 1998 A
5845090 Collins, III et al. Dec 1998 A
5845129 Wendorf et al. Dec 1998 A
5850442 Muftic Dec 1998 A
5860004 Fowlow et al. Jan 1999 A
5860153 Matena et al. Jan 1999 A
5864862 Kriens et al. Jan 1999 A
5864866 Henckel et al. Jan 1999 A
5872928 Lewis et al. Feb 1999 A
5872973 Mitchell et al. Feb 1999 A
5875335 Beard Feb 1999 A
5878411 Burroughs et al. Mar 1999 A
5884024 Lim et al. Mar 1999 A
5884079 Furusawa Mar 1999 A
5887134 Ebrahim Mar 1999 A
5887172 Vasudevan et al. Mar 1999 A
5889951 Lombardi Mar 1999 A
5889988 Held Mar 1999 A
5890158 House et al. Mar 1999 A
5892904 Atkinson et al. Apr 1999 A
5905868 Baghai et al. May 1999 A
5913029 Shostak Jun 1999 A
5915112 Boutcher Jun 1999 A
5925108 Johnson et al. Jul 1999 A
5933497 Beetcher et al. Aug 1999 A
5933647 Aronberg et al. Aug 1999 A
5935249 Stern et al. Aug 1999 A
5940827 Hapner et al. Aug 1999 A
5944793 Islam et al. Aug 1999 A
5946485 Weeren et al. Aug 1999 A
5946694 Copeland et al. Aug 1999 A
5949998 Fowlow et al. Sep 1999 A
5951652 Ingrassia, Jr. et al. Sep 1999 A
5956509 Kevner Sep 1999 A
5960404 Chaar et al. Sep 1999 A
5961582 Gaines Oct 1999 A
5963924 Williams et al. Oct 1999 A
5963947 Ford et al. Oct 1999 A
5966435 Pino Oct 1999 A
5966531 Skeen et al. Oct 1999 A
5969967 Aahlad et al. Oct 1999 A
5974201 Chang et al. Oct 1999 A
5978484 Apperson et al. Nov 1999 A
5978773 Hudetz et al. Nov 1999 A
5982773 Nishimura et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
5991808 Broder et al. Nov 1999 A
5996075 Matena Nov 1999 A
5999179 Kekic et al. Dec 1999 A
5999988 Pelegri-Llopart et al. Dec 1999 A
6003050 Silver et al. Dec 1999 A
6003065 Yan et al. Dec 1999 A
6003763 Gallagher et al. Dec 1999 A
6009103 Woundy Dec 1999 A
6009413 Webber et al. Dec 1999 A
6009464 Hamilton et al. Dec 1999 A
6014686 Elnozahy et al. Jan 2000 A
6016496 Roberson Jan 2000 A
6016516 Horikiri Jan 2000 A
6018619 Allard et al. Jan 2000 A
6023586 Gaisford et al. Feb 2000 A
6026414 Anglin Feb 2000 A
6031977 Pettus Feb 2000 A
6032151 Arnold et al. Feb 2000 A
6034925 Wehmeyer Mar 2000 A
6041351 Kho Mar 2000 A
6044381 Boothby et al. Mar 2000 A
6052761 Hornung et al. Apr 2000 A
6055562 Devarakonda et al. Apr 2000 A
6058381 Nelson May 2000 A
6058383 Narasimhalu et al. May 2000 A
6061699 DiCecco et al. May 2000 A
6061713 Bharadhwaj May 2000 A
6067575 McManis et al. May 2000 A
6078655 Fahrer et al. Jun 2000 A
6085030 Whitehead et al. Jul 2000 A
6085255 Vincent et al. Jul 2000 A
6092194 Touboul Jul 2000 A
6093216 Adl-Tabatabai et al. Jul 2000 A
6101528 Butt Aug 2000 A
6104716 Crichton et al. Aug 2000 A
6108346 Doucette et al. Aug 2000 A
6134603 Jones et al. Oct 2000 A
6154844 Touboul et al. Nov 2000 A
6157960 Kaminsky et al. Dec 2000 A
6182083 Scheifler et al. Jan 2001 B1
6185602 Bayrakeri Feb 2001 B1
6185611 Waldo et al. Feb 2001 B1
6189046 Moore et al. Feb 2001 B1
6192044 Mack Feb 2001 B1
6199068 Carpenter Mar 2001 B1
6199116 May et al. Mar 2001 B1
6212578 Racicot et al. Apr 2001 B1
6216138 Wells et al. Apr 2001 B1
6216158 Luo et al. Apr 2001 B1
6219675 Pal et al. Apr 2001 B1
6226746 Scheifler May 2001 B1
6243716 Waldo et al. Jun 2001 B1
6243814 Matena Jun 2001 B1
6247091 Lovett Jun 2001 B1
6253256 Wollrath et al. Jun 2001 B1
6263350 Wollrath et al. Jul 2001 B1
6263379 Atkinson et al. Jul 2001 B1
6269401 Fletcher et al. Jul 2001 B1
6272559 Jones et al. Aug 2001 B1
6282295 Young et al. Aug 2001 B1
6282568 Sondur et al. Aug 2001 B1
6282581 Moore et al. Aug 2001 B1
6292934 Davidson et al. Sep 2001 B1
6301613 Ahlstrom et al. Oct 2001 B1
6321275 McQuistan et al. Nov 2001 B1
6327677 Garg et al. Dec 2001 B1
6339783 Horikiri Jan 2002 B1
6343308 Marchesseault Jan 2002 B1
6351735 Deaton et al. Feb 2002 B1
6360266 Pettus Mar 2002 B1
6363409 Hart et al. Mar 2002 B1
6378001 Aditham et al. Apr 2002 B1
6385643 Jacobs et al. May 2002 B1
6408342 Moore et al. Jun 2002 B1
6418468 Ahlstrom et al. Jul 2002 B1
6505248 Casper et al. Jan 2003 B1
6564174 Ding et al. May 2003 B1
6578074 Bahlmann Jun 2003 B1
6603772 Moussavi et al. Aug 2003 B1
6604127 Murphy et al. Aug 2003 B2
6604140 Beck et al. Aug 2003 B1
6654793 Wollrath et al. Nov 2003 B1
6704803 Wilson et al. Mar 2004 B2
6757262 Weisshaar et al. Jun 2004 B1
6757729 Devarakonda et al. Jun 2004 B1
6801940 Moran et al. Oct 2004 B1
6801949 Bruck et al. Oct 2004 B1
6804711 Dugan et al. Oct 2004 B1
6804714 Tummalapalli Oct 2004 B1
20010003824 Schnier Jun 2001 A1
20010011350 Zabetian Aug 2001 A1
20020032803 Marcos et al. Mar 2002 A1
20020059212 Takagi May 2002 A1
20020073019 Deaton Jun 2002 A1
20020111814 Barnett et al. Aug 2002 A1
20030005132 Nguyen et al. Jan 2003 A1
20030084204 Wollrath et al. May 2003 A1
20030191842 Murphy et al. Oct 2003 A1
Foreign Referenced Citations (44)
Number Date Country
0 300 516 Jan 1989 EP
0 351 536 Jan 1990 EP
0 384 339 Aug 1990 EP
0 472 874 Mar 1992 EP
0 474 340 Mar 1992 EP
497 022 Aug 1992 EP
0 555 997 Aug 1993 EP
0 565 849 Oct 1993 EP
0 569 195 Nov 1993 EP
0 625 750 Nov 1994 EP
0 635 792 Jan 1995 EP
0 651 328 May 1995 EP
0 660 231 Jun 1995 EP
0 697 655 Feb 1996 EP
0 718 761 Jun 1996 EP
0 767 432 Apr 1997 EP
0 778 520 Jun 1997 EP
0 794 493 Sep 1997 EP
0 803 810 Oct 1997 EP
0 803 811 Oct 1997 EP
0 805 393 Nov 1997 EP
0 810 524 Dec 1997 EP
0 817 020 Jan 1998 EP
0 817 022 Jan 1998 EP
0 817 025 Jan 1998 EP
0 836 140 Apr 1998 EP
2 253 079 Aug 1992 GB
2 262 825 Jun 1993 GB
2 305 087 Mar 1997 GB
11-45187 Feb 1999 JP
WO 9207335 Apr 1992 WO
WO 9209948 Jun 1992 WO
WO9325962 Dec 1993 WO
WO 9403855 Feb 1994 WO
WO 9603692 Feb 1996 WO
WO 9610787 Apr 1996 WO
WO 9618947 Jun 1996 WO
WO 9624099 Aug 1996 WO
WO 9802814 Jan 1998 WO
WO 9804971 Feb 1998 WO
WO9917194 Apr 1999 WO
WO0113228 Feb 2001 WO
WO0186394 Nov 2001 WO
WO0190903 Nov 2001 WO
Non-Patent Literature Citations (203)
Entry
“Consumers Can View, Share Picture On-Line as Kodak Picture Network Goes ‘Live’,” Business Wire, Aug. 25, 1997, pp. 18-19.
“Eden Project Proposal,” Department of Computer Science, University of Washington, Oct. 1980, Technical Report #80-10-01, cover and Foreword.
“ISN Dataweb Sells Software, Hardware,” Datamation, Apr. 1, 1996, p. 40.
“Kodak DC220 and DC260 Digital Cameras Are Shipping to Retailers Across the Country Cameras Are Optimized for USB Interface Supported in Windows 98,” Business Wire, Jun. 24, 1998, pp. 42-44.
“Kodak demonstrates leadership across entire photographic category,” M2 Presswire, Feb. 13, 1998, pp. 31-35.
“Kodak PhotoNet Online Makes It a Snap to Share Summer Photos,” PR Newswire, Jul. 2, 1998, pp. 63-64.
“Kodak Picture Network Sends Prints Home From the Holidays,” Business Wire, Dec. 29, 1997, pp. 58-60.
“Photo processing made easy on the Internet; Storm Software and PictureVision team up with Konica Corp.,” Business Wire, Feb. 22, 1996, pp. 3-4.
“Seeing your photos a whole new way,” Business Wire, Dec. 12, 1996, pp. 9-10.
“Webwatch: MCI Announces Internet Access,” Boardwatch Magazine, Jan. 1995.
Administrator's Guide, Netscape Enterprise Server, Version 3.0, Netscape Communications Corp., 1998.
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.
Almes et al., “Research in Integrated Distributed Computing,” Department of Computer Science, University of Washington, Oct. 1979, pp. 1-42.
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.
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.
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.
Arnold, Ken, “The Jini Architecture: Dynamic Services in a Flexible Network,” Sun Microsystems, Inc., Proceedings of the 36th ACM IEEE Design Automation Conference, Jun. 1999, pp. 157-162.
Bandrowski, “Stores Without Doors: Kiosks Generate New Profits,” Corporate Computing, Oct. 1992, pp. 193-195.
Begole et al., “Transparent Sharing of Java Applets: A Replicated Approach,” Oct. 1997, pp. 55-65.
Black et al., “A Language for Distributed Programming,” Department of Computer Science, University of Washington, Technical Report 86-02-03, Feb. 1986, p. 10.
Black et al., “Distribution and Abstract Types in Emerald,” University of Washington, Technical Report No. 85-08-05, Aug. 1985, pp. 1-10.
Black et al., “Object Structure in the Emerald System,” University of Washington, Technical Report 86-04-03, Apr. 1986, pp. 1-14.
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.
Black, “Supporting Distributed Applications: Experience with Eden,” Department of Computer Science, University of Washington, Technical Report 85-03-02, Mar. 1985, pp. 1-21.
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.
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.
Braine et al., “Object-Flow,” 1997, pp. 418-419.
Bruno, “Working the Web,” Data Communications, Apr. 1997, pp. 50-60.
Ciancarini et al., “Coordinating Distributed Applets with Shade/Java,” Feb. 1998, pp. 130-138.
Cohen, “Electronic Commerce,” USC/Information Sciences Institute, Oct. 1989.
Conhaim, “Online shopping: a beginner's guide; includes related listing of videotex services,” Link-Up, vol. 5, No. 6, p. 32, Nov. 1988.
Coulouris et al., “Distributed Systems Concepts and Designs,” Second Edition, Addison-Wesley, 1994.
Delcambre et al., “Simulation of the Object Flow Model: A Conceptual Modeling Language for Object-Driven Applications,” 1993, pp. 216-225.
Design Project #2, Electronic Shopping at MIT, MIT Class 6.033 Handout 23, Massachusetts Institute of Technology, http://web.mit.edu/6.033/1995/handouts/html/h23.html, Spring 1995, pp. 1-6.
Ellsworth, “Boom Town,” Internet World, Jun. 1995, pp. 33-35.
Estrin, “Inter-Organization Networks: Implications of Access Control Requirements for Interconnection Protocols,” ACM, 1986, pp. 254-263.
Fleischer, “SkyMall's ‘Supplier Network’ Takes Flight”, Retailtech, The Technology Magazine for Retail Executives, Apr. 1997.
Foley, “Managing Campus-Wide Information Systems: Issues and Problems,” Capitalizing on Communication, ACM SIGUCCS XVII, 1989, pp. 169-174.
Fryxell, “eaasySABRE,” Link-Up, May/Jun. 1996, pp. 10-11.
Gardner, “Kodak Follows Startup Into Online Photo Processing Business,” Internet World, Sep. 8, 1997, pp. 5-6.
Gogan et al., “Open Market, Inc.: Managing in a Turbulent Environment,” Harvard Business School Publishing, Aug. 29, 1996, pp. 1-30.
Goldberg et al., “Smalltalk-80—The Language and its Implementation,” Xerox Palo Alto Research Center, 1983 (reprinted with corrections, Jul. 1985), pp. 1-720.
Hodges, Douglas, “Managing Object Lifetimes in OLE,” Aug. 25, 1994, pp. 1-41.
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.
Hsu, “Reimplementing Remote Procedure Calls,” University of Washington, Thesis, Mar. 22, 1985, pp. 1-106.
Hutchinson, “Emerald: An Object-Based Language for Distributed Programming,” a Dissertation, University of Washington, 1987, pp. 1-107.
Israel et al., “Authentication in Office System Internetworks,” ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 193-210.
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.
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.
Jul, “Object Mobility in a Distributed Object-Oriented System,” a Dissertation, University of Washington, 1989, pp. 1-154 (1 page Vita).
Keller, “Smart Catalogs and Virtual Catalogs,” Proceedings of the First USENIX Workshop of Electronic Commerce, USENIX Association, Jul. 11-12, 1995, pp. 125-131.
Klein et al., “TRADE'ex: The Stock Exchange of the Computer Industry,” Harvard Business School Publishing, 1996, pp. 1-14.
Kodak PhotoNet FAQ, PhotoNet Online, Jun. 14, 2002, pp. 1-3.
Kolodner et al., “Atomic Garbage Collection: Managing a Stable Heap,” ACM, 1989, pp. 15-25.
Koshizuka et al., “Window Real-Objects: A Distributed Shared Memory for Distributed Implementation of GUI Applications,” Nov. 1993, pp. 237-247.
Kramer, “NETWATCH; The AJC's Daily Online Guide; Get the picture: Kodak will send photos to Web,” The Atlanta Journal and Constitution, Sec. Features, p. 08C, Jun. 5, 1997.
Krasner et al., “Smalltalk-80: Bits of History, Words of Advice,” 1983, Xerox Corporation, pp. 1-344.
Lampson et al., “Authentication in Distributed Systems: Theory and Practice,” ACM Transactions n Computer Systems, vol. 10, No. 4, Nov. 1992, pp. 265-310.
Lansky, “Without APS, Photo Life Goes on Via Internet,” Photographic Trade News, Aug. 1996, pp. 19-23.
Lavana et al., “Executable Workflows: A Paradigm for Collaborative Design on the Internet,” Jun. 1997, 6 pages.
Lewis, “Pacific Bell, MCI to Expand Internet Service,” The New York Times, sec. D, col. 1 at 3, Mar. 28, 1995.
LightSurf Instant Imaging—Press Releases, “Kodak and LightSurf Collaborate on Kodak Picture Center Online,” LifeSurf Technologies Inc., Jun. 14, 2002, pp. 1-3.
Louwerse et al., “Data Protection Aspects in an Integrated Hospital Information System,” North-Holland Computers & Security 3, 1984, pp. 286-294.
McEnaney, “Point-and-Click Memory Sharing; Launches PhotoNet online digital photography and imaging services,” Photographic Trade News, Sec. p. 23, Jan. 1997.
Miller, “Web posting as a photo processing option,” USA Today, Section: Life, p. 17D, Dec. 13, 1996.
Morris et al., “Andrew: A Distributed Personal Computing Environment,” Communications of the ACM, vol. 29, No. 3, Mar. 1986, pp. 184-201.
O'Mahony, “Security Considerations in a Network Management Environment,” IEEE Network, May/Jun. 1994, pp. 12-17.
Oppen et al., “The Clearinghouse: A Decentralized Agent for Locating Names Objects in a Distributed Environment,” ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 230-253.
Osborn, “The Role of Polymorphism in Schema Evolution in an Object-Oriented Database,” IEEE Transactions on Knowledge and Data Engineering, vol. 1, No. 3, Sep. 1989, pp. 310-317.
Petersen, “New but Not Improved,” Direct Magazine, Nov. 1995.
Press Release, “Sun Goes Live With the Kodak Picture Network,” Sun Microsystems, Inc., Jun. 14, 2002, pp. 1-2.
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.
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.
Pu, “Replication and Nested Transaction in the Eden Distributed System,” Doctoral Dissertation, University of Washington, Aug. 6, 1986, pp. 1-179 (1 page Vita).
Raeder, “Is there a Prodigy in your future?,” Database Searcher, vol. 5, No. 6, p. 18, Jun. 1989.
Ramm et al., “Exu—A System for Secure Delegation of Authority on an Insecure Network,” Ninth System Administration Conference, 1995 LISA IX, Sep. 17-22, 1995, pp. 89-93.
Satyanarayanan, “Integrating Security in a Large Distributed System,” ACM Transactions on Computer Systems, vol. 7, No. 3, Aug. 1989, pp. 247-280.
Schroeder et al., “Experience with Grapevine: The Growth of a Distributed System,” ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 3-23.
Senn, “Capitalizing on Electronic Commerce: The Role of the Internet in Electronic Markets,” Information Systems Management, Summer 1996, pp. 15-24.
Steinke, “Design Aspects of Access Control in a Knowledge Base System,” Computers & Security, 10, 1991, pp. 612-625.
Stern, “Industry Net,” Link-Up, Mar./Apr. 1995, p. 10.
Tanenbaum et al., “Distributed Operating Systems,” Computing Surveys, vol. 17, No. 4, Dec. 1985, pp. 419-470.
The Wall Street Journal, “Barclays Is Opening an ‘Electronic Mall’ for Internet Shopping,” Tech. & Health Section at B2, Jun. 1, 1995.
The Wall Street Journal, “Prodigy Plans to Announce Internet ‘Electronic Mail’,” Tech. Section at B5, Nov. 27, 1995.
Trehan et al., “Toolkit for Shared Hypermedia on a Distributed Object Oriented Architecture,” 1993, pp. 1-8.
Trommer, “Thomas Unveils Online Purchasing Network—Eases Product Sourcing and Ordering Through EDI,” Electronic Buyers' News at 60, Dec. 11, 1995.
Van Den Berg et al., “Advanced Topics of a Computer Center Audit,” North-Holland Computers & Security 3, 1984, pp. 171-185.
Van Der Lans, “Data Security in a Relational Database Environment,” North-Holland Computers & Security 5, 1986, pp. 128-134.
Welz, “New Deals: A ripening Internet market, secure systems and digital currency are reshaping global commerce,” Internet World, Jun. 1995, pp. 36-41.
Wobber et al., “Authentication in the Taos Operating System,” ACM, 1993, pp. 256-269.
Wyatt, “Netscape Enterprise Server,” Prima Publishing, 1996.
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.
“Java (TM) Object Serialization Specification,” Sun Microsystems, Inc., XP-002242372, <www.dei.estg.iplei.pt/P3/N/material/extra/serial-spec-JDK1—2.pdf>, Nov. 30, 1998 (76 pages).
Chan, P. et al., The Java Class Libraries, 2nd Edition, vol. 1, “Java.io ObjectInputStream,” XP-002243027, pp. 1230-1232, 1262-1264, and 1283, Mar. 9, 1998 (7 pages).
Opyrchal et al., “Efficient Object Serialization in Java,” Department of Electrical Engineering and Computer Science, University of Michigan, XP-002242373, May 31, 1999 (6 pages).
Auto-ID Center, “Auto-ID Savant Specification 1.0,” Version of Oct. 13, 2003 (58 pages).
H.A. Smith and J.D. McKeen, “Object-Oriented Technology: Getting Beyond the Hype,” ACM, Spring 1996, vol. 27, pp. 20-29.
Java Remote Method Invocation Specification, JDK 1.1 FCS, Sun Microsystems, Inc. Feb. 1997, chapters 5 and 7.
Jennings, N.R. et al., “Using Intelligent Agents to Manage Business Processes,” Dept. Electronic Engineering, Queen Mary & Westfield College, Mile End Road, London, E1 4NS, U.K., XP-002254546, 1996 16 pages.
Wollrath et al., “JAVA-Centric Distributed Computing,” IEEE Mirco May/Jun. 1997, pp. 44-53.
Amitabh, D., et al., Proxies, Application Interfaces, and Distributed Systems, IEEE, pp. 212-220, 1992.
Li, Sing et al., “Professional Jini”, Chapter 7, Aug. 2000.
Spiteri, M.D., et al., “An architecture to support storage and retrieval of events”, 1998.
“Dynamic code downloading using RMI”, http://java.sun.com/j2se/1.4.2/docs/guide/mi/codebase.html, 2003. (9 pages).
“Passing Proxies as Parameters to Methods and Return Values from Methods,” IBM Technical Disclosure Bulletin, vol. 41, No. 1, Jan. 1998, pp. 89-92.
“Jini Distributed Leasing Specification,” Sun Microsystems, Jan. 1999, XP-002209076. (26 pages).
Subramanian, Sakthi et al., “Automatic Verification of Object Code Against Source Code,” IEEE, 1996, pp. 46-55.
Wollrath, A., et al., “Simple Activation for Distributed Objects,” USENIX Association, Conference on Object-Oriented Technologies (COOTS), Jun. 26-29, 1995. (11 pages).
Stoyenko, A.D. “SUPRA-RPC: SUbprogram PaRAmeters in Remote Procedure Calls,” Software-Practice and Experience, vol. 24(1), pp. 27-49, 1994.
Black et al., “The Eden Report: A Final Report,” Department of Computer Science, University of Washington, Technical Report 86-11-01, Nov. 1986, pp. 1-28.
Foley, “Managing Campus-Wide Information Systems: Issues and Problems,” Capitalizing on Communication, ACM SIGUCCS XVII; 1989, pp. 169-174.
Mullender, Distributed Systems, Second Edition, Addison-Wesley, 1993.
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.
Cardelli, Obliq, A lightweight language for network obiects, Nov. 5, 1993, pp. 1-37.
Dijkstra, Self-stabilizing Systems in Spite of Distributed Control, Communications of the ACM, vol. 17, No. 11, Nov. 1974, pp. 643-644.
Ousterhout et al., The Sprite Network Operating System, Computer, IEEE, Feb. 1988, pp. 23-36.
Dourish, A Divergence-Based Model of Synchrony and Distribution in Collaborative Systems, Xerox Technical Report EPC-1194-102, 1994, pp. 1-10.
Sharrott et al., ObjectMap: Integrating High Performance Resources into a Distributed Obiect-oriented Environment, ICODP, 1995.
Birrell et al., Grapevine: An Exercise in Distributed Computing, Communications of the ACM, vol. 25, No. 4, Apr. 1982, pp. 260-274.
Transparent Network Computing, Locus Computing Corporation, Jan. 5, 1995.
Gray et al., Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency, ACM, 1989, pp. 202-210.
Lamport et al., The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, Jul. 1982, pp. 382-401.
Dolev et al., On the Minimal Synchronism Needed for Distributed Consensus, Journal of the ACM, vol. 34, No. 1, Jan. 1987, pp. 77-97.
Mummert et al., Long Term Distributed File Reference Tracing: Implementation and Experience, Carnegie Mellon University School of Computer Science, Nov. 1994, pp. 1-28.
Gelernter et al., Parallel Programming in Linda, Yale University, Jan. 1985, pp. 1-21.
Cannon et al., Adding Fault-Tolerant Transaction Processing to LINDA, Software-Practice and Experience, vol. 24(5), May 1994, pp. 449-466.
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.
Anderson et al., Persistent Linda: Linda + Transactions + Query Processing, Proceedings of the 13th Symposium on Fault Tolerant Systems, 1994, pp. 93-109.
Gelernter, Generative Communication in Linda, ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, Jan. 1985, pp. 80-112.
Carriero et al., Distributed Data Structures in Linda, Principals of Programming Language, 1986, pp. 1-16.
Pinakis, Using Linda as the Basis of an Operating System Microkernel, University of Western Australia, Department of Computer Science, Aug. 1993, pp. 1-165.
LINDA Database Search, Jul. 20, 1995, pp. 1-68.
Carriero et al, Distributed Data Structures in Linda, Yale Research Report YALEU/DCS/RR-438, Nov. 1985.
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.
Ahmed et al., A Program Building Tool for Parallel Applications, Yale University, Dec. 1, 1993, pp. 1-23.
Liskov et al., Distributed Object Management in Thor, International Workshop on Distributed Object Management, 1992, pp. 12.
Coulouris et al., Distributed Systems Concepts and Designs, Second Edition, Addison-Wesley, 1994.
Birrell et al., Network Obiects, DEC SRC Research Report 115, Feb. 28, 1994.
Birrell et al., Distributed Garbage Collection for Network Objects, DEC SRC Research Report 116, Dec. 15, 1993.
Jaworski, Java 1.1 Developer's Guide, Sams.net, 1997.
Wollrath et al., A Distributed Obiect Model for the JavaJ System, USENIX Association, Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996.
Harris et al., Proposal for a General Java Proxy Class for Distributed Systems and Other Uses, Netscape Communications Corp., Jun. 25, 1997.
Hamilton, Java and the Shift to Net-Centric Computing Computer, Aug. 1996, pp. 31-39.
Chung et al., A ‘Tiny’ Pascal Compiler: Part 1: The P-Code Interpreter, BYTE Publications, Inc., Sep. 1978.
Chung et al., A ‘Tiny’ Pascal Compiler: Part 2: The P-Compiler, BYTE Publications, Inc., Oct. 1978.
Thompson, Regular Expression Search Algorithm, Communications of the ACM, vol. II, No. 6, p. 149 et seq., Jun. 1968.
Mitchell et al., Mesa Language Manual, Xerox Corporation.
McDaniel, An Analysis of a Mesa Instruction Set, Xerox Corporation, May 1982.
Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, Xerox Corporation, Aug. 1983.
Pier, A Retrospective on the Dorado, A High-Performance Personal Computer, IEEE Conference Proceedings, The 10th Annual international Symposium on Computer Architecture, 1983.
Krasner, The Smalltalk-80 Virtual Machine, BYTE Publications Inc., Aug. 1991, pp. 300-320.
Operating Systems Review, ACM Press, vol. 27, No. 5, Dec. 1993, pp. 217-230.
Remote Method Invocation Specification, Sun Microsystems, Inc., (1997), http://java.sun.com/products/jdk/1.1/docs/guide/rmi/spec/rmiTOC.doc.html.
Birrell et al., Implementing Remote Procedure Calls, ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 39-59.
IBM: SOMObjects Developer Toolkit Users Guide, Version 2.1, “Chapter 6—Distributed SOM (DSOM),” pp. 6-1-6-90, Oct. 1994.
Orfali R. et al., “The Essential Distributed Objects Survival Guide,” Chapter 11: Corba Commercial ORBs, John Wiley & Sons, Inc., (1996).
Venners, B., “Jini Technology, Out of the Box”, JAVAWORLD, ′Online!, pp. 1-4, Dec. 1998.
Alexander, et al., “Active Bridging”, Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, Sep. 1997.
Anonymous: “Change-Notification Service for Shared Files”, IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, Aug. 1993, XP002108713, New York, US.
Anonymous: “Resource Preemption for Priority Scheduling.” Nov. 1973. IBM Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931 XP002109435 New York, US.
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.
Bertino et al., “Object-Oriented Database Management Systems: Concepts and Issues,” Computer, vol. 24, No. 4, pp. 33-47, (Apr. 1991), Los Alamitos, CA.
Betz, Mark; “Interoperable objects: laying the foundation for distributed object computing”; Dr. Dobb's Journal, vol. 19, No. 11, p. 18(13); (Oct. 1994).
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.
Birrell et al., “Implementing Remote Procedure Calls”, ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 39-59.
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.
Deux O et al: “The 02 System” Communications of the Association for Computing Machinery, vol. 34, No. 10, Oct. 1, 1991, pp. 34-48.
Drexler, K. Eric, et al., “Incentive Engineering for Computational Resource Management,” The Ecology of Computation, Elsevier Science Publishers B.V., 1988, pp. 231-266.
Droms, R., “RFC 1541 Dynamic Host Configuration Protocol”, http://www.cis.ohio-state.edu/htbin/rfc/rfc1541.html, Oct. 1993, pp. 1-33.
Emms J: “A Definition of an Access Control Systems Language” Computer Standards and Interfaces, vol. 6, No. 4, Jan. 1, 1987, pp. 443-454.
Gosling et al., “The Java (TM) Language Specification”, Addison-Wesley, 1996.
Gottlob et al., “Extending Object-Oriented Systems with Roles,” ACM Transactions on information systems, vol. 14, No. 3, pp. 268-296 (Jul. 1996).
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.
Hamilton et al., “Subcontract: a flexible base for distributed programming”; Proceedings of 14th Symposium of Operating System Principles; (Dec. 1993).
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, Jun. 1996.
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).
IBM (TM) Technical Disclosure Bulletin, “Object Location Algorithm,” vol. 36, No. 09B, pp. 257-258, Sep. 1993.
IBM (TM) Technical Disclosure Bulletin, “Retrieval of Qualified Variables Using Extendible Hashing,” vol. 36, No. pp. 301-303, Dec. 1993.
Jones, Richard, et al., “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” pp. 165-175, John Wiley & Sons, 1996.
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.
Kougiouris et al.; “Support for Space Efficient Object Invocation in Spring”; (Sep. 1994).
Lindholm et al., “The Java (TM) Virtual Machine Specification”, Addison Wesley, 1996.
Mitchell et al.; “An Overview of the Spring System”; (Feb. 1994).
Riggs Roger et al., “Pickling State in the Java (TM) System,” USENIX Association Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996, pp. 241-250.
Rosenberry et al., “Understanding DCE”; Chapters 1-3, 6; (1992).
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.
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.
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.
Yemini, Y. and S. da silva, “Towards Programmable Networks”, IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, L'Aquila, Italy, Oct. 1996.
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.
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.
Burns et al., “An Analytical Study of Opportunistic Lease Renewal,” Distributed Computing Systems, 21st International Conference, pp. 146-153, Apr. 2000.
Dollimore et al., “The Design of a System for Distributing Shared Objects,” The Computer Journal, No. 6, Cambridge, GB, Dec. 1991.
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.
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.
Guyennet et al., “A New Consistency Protocol Implemented in the CAliF System,” IEEE, 1094-7256/97, pp. 82-87, 1997.
Guyennet et al., “Distributed Shared Memory Layer for Cooperative Work Applications,” IEEE, 0742-1303/97, pp. 72-78, 1997.
Hoshi et al., “Allocation of the Cross-Connect Function in Leased Circuit Networks,” 1992, ICC'92, conference record, SUPERCOMM/ICC '02, D a New World of Communications, IEEE International Conference, pp. 1408-1412.
IBM Technical Disclosure Bulletin, “Local Network Monitoring to Populate Access Agent Directory,” vol. 36, No. 09A, pp. 403-405, Sep. 1993.
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.
MUX-Elektronik, Java 1.1 Interactive Course, www.lls.se/˜mux/javaic.html, 1995.
Stevenson, “Token-Based Consistency of Replicated Servers,” IEEE, CH2686-4/89/0000/0179, pp. 179-183, 1989.
Yin et al., “Using Leases to Support Server Driven Consistency in Large-Scale Systems,” Computer Services Department, University of Texas at Austin, p. 285-294, May 26-28, 1998.
Related Publications (1)
Number Date Country
20020199036 A1 Dec 2002 US
Continuations (1)
Number Date Country
Parent 09044930 Mar 1998 US
Child 10138424 US