US 6,237,009 B1Grant
Lease renewal service
Issue Date:2001-05-22
•29 Claims
•18 Drawing Sheets
Abstract
In accordance with methods and systems consistent with the present invention, a lease manager is provided for managing leases between clients and other network services. To use the lease manager, a client enters into a management lease with the lease manager, specifying an amount of time during which the lease manager can manage preexisting leases between the client and network services on behalf of the client. This management includes renewing the preexisting leases with the other network services. Further, the lease manager notifies the client when a lease between the lease manager and the client is near expiration. The lease manager also notifies the client of failed attempts to renew the preexisting leases, as well as the management lease, either with a network service or with the lease manager.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- James H. Waldo
- John W. F. McClain
Application Information
Application Number:US 09/332,512
Filing Date:1999-06-14
Priority Date:1996-10-11
Art Unit:7
Classifications
IPC:
G06F 1730
Field of Search:
707206707201707 10709104709203
Patent Drawings (18 sheets)
Description
RELATED APPLICATIONS
[0002] This is a continuation-in-part of U.S. patent application Ser. No. 09/152,062, filed on Sep. 11, 1998, pending which is a continuation-in-part of U.S. patent application Ser. No. 08/729,421, filed on Oct. 11, 1996, U.S. Pat. No. 5,832,529 which are both incorporated herein by reference.
[0003] The following identified U.S. patent applications are relied upon and are incorporated by reference in this application.
[0004] Provisional U.S. Patent Application No. 60/076,048, entitled “Distributed Computing System,” filed on Feb. 26, 1998, incorporated herein by reference.
[0005] U.S. patent application Ser. No. 09/044,923, entitled “Method and System for Leasing Storage,” and filed on Mar. 20, 1998, pending, which is a continuation-in-part of U.S. patent application Ser. No. 08/729,421, filed on Oct. 11, 1996, U.S. Pat. No. 5,832,529 incorporated herein by reference.
[0006] 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 March 20, 1998, pending which is a continuation-in-part of U.S. patent application Ser. No. 08/729,421, filed on Oct. 11, 1996, U.S. Pat. No. 5,832,529 incorporated herein by reference.
[0007] 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 Mar. 20, 1998, pending, which is a continuation-in-part of U.S. patent application Ser. No. 08/729,421, filed on Oct. 11, 1996, U.S. Pat. No. 5,832,929 incorporated herein by reference.
[0008] U.S. patent application Ser. No. 09/044,916, entitled “Leasing for Failure Detection,” and filed on Mar. 20, 1998, U.S. Pat. No. 6,016,500 which is a continuation-in-part of U.S. patent application Ser. No. 08/729,421, filed on Oct. 11, 1996, U.S. Pat. No. 5,832,529 incorporated herein by reference.
[0009] U.S. patent application Ser. No. 09/044,933, entitled “Method for Transporting Behavior in Event Based System,” and filed on Mar. 20, 1998, pending.
[0010] 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 Mar. 20, 1998, pending.
[0011] U.S. patent application Ser. No. 09/044,938, entitled “Methods and Apparatus for Remote Method Invocation,” and filed on Mar. 20, 1998, pending.
[0012] U.S. patent application Ser. No. 09/045,652, entitled “Method and System for Deterministic Hashes to Identify Remote Methods,” and filed on Mar. 20, 1998, pending.
[0013] 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 Mar. 20, 1998, pending.
[0014] 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 Mar. 20, 1998, pending.
[0015] U.S. patent application Ser. No. 09/044,917, entitled “Suspension and Continuation of Remote Methods,” and filed on Mar. 20, 1998, pending.
[0016] 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 Mar. 20, 1998, pending.
[0017] U.S. patent application Ser. No. 09/044,839, entitled “Method and System for In-Place Modifications in a Database,” and filed on Mar. 20, 1998, abandoned.
[0018] U.S. patent application Ser. No. 09/044,945, entitled “Method and System for Typesafe Attribute Matching in a Database,” and filed on Mar. 20, 1998, pending.
[0019] U.S. patent application Ser. No. 09/044,931, entitled “Dynamic Lookup Service in a Distributed System,” and filed on Mar. 20, 1998, pending.
[0020] U.S. patent application Ser. No. 09/044,939, entitled “Apparatus and Method for Providing Downloadable Code for Use in Communicating with a Device in a Distributed System,” and filed on Mar. 20, 1998, pending.
[0021] U.S. patent application Ser. No. 09/044,826, entitled “Method and System for Facilitating Access to a Lookup Service,” and filed on Mar. 20, 1998, pending.
[0022] U.S. patent application Ser. No. 09/044,932, entitled “Apparatus and Method for Dynamically Verifying Information in a Distributed System,” and filed on Mar. 20, 1998, pending.
[0023] 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, pending.
[0024] U.S. patent application Ser. No. 09/044,936, entitled “An Interactive Design Tool for Persistent Shared Memory Spaces,” and filed on Mar. 20, 1998, pending.
[0025] U.S. patent application Ser. No. 09/044,934, entitled “Polymorphic Token-Based Control,” and filed on Mar. 20, 1998, pending.
[0026] U.S. patent application Ser. No. 09/044.915, entitled “Stack-Based Access Control,” and filed on Mar. 20, 1998, pending.
[0027] U.S. patent application Ser. No. 09/044,944, entitled “Stack-Based Security Requirements,” and filed on Mar. 20, 1998, pending.
[0028] U.S. patent application Ser. No. 09/044,837, entitled “Per-Method Designation of Security Requirements,” and filed on Mar. 20, 1998, pending.
BACKGROUND OF THE INVENTION
[0029] A. Field of the Invention
[0030] This invention generally relates to data processing systems and, more particularly, to a lease renewal service.
[0031] B. Description of the Related Art
[0032] Proper resource management is an important aspect to efficient and effective use of computers. In general, resource management involves allocating resources (e.g., memory) in response to requests as well as deallocating resources at appropriate times, for example, when the requesters no longer require the resources. In general, the resources contain data referenced by computational entities (e.g., applications, programs, applets, etc.) executing in the computers.
[0033] In practice, when applications executing on computers seek to refer to resources, the computers must first allocate or designate resources so that the applications can properly refer to them. When the applications no longer refer to a resource, the computers can deallocate or reclaim the resource for reuse. In computers each resource has a unique “handle” by which the resource can be referenced. The handle may be implemented in various ways, such as an address, array index, unique value, pointer, etc.
[0034] Resource management is relatively simple for a single computer because the events indicating when resources can be reclaimed, such as when applications no longer refer to them or after a power failure, are easy to determine. Resource management for distributed systems connecting multiple computers is more difficult because applications in several different computers may be using the same resource.
[0035] Disconnects in distributed systems can lead to the improper and premature reclamation of resources or to the failure to reclaim resources. For example, multiple applications operating on different computers in a distributed system may refer to resources located on other machines. If connections between the computers on which resources are located and the applications referring to those resources are interrupted, then the computers may reclaim the resources prematurely. Alternatively, the computers may maintain the resources in perpetuity, despite the extended period of time that applications failed to access the resources.
[0036] These difficulties have led to the development of systems to manage network resources, one of which is known as “distributed garbage collection.” That term describes a facility provided by a language or runtime system for distributed systems that automatically manages resources used by an application or group of applications running on different computers in a network.
[0037] In general, garbage collection uses the notion that resources can be freed for future use when they are no longer referenced by any part of an application. Distributed garbage collection extends this notion to the realm of distributed computing, reclaiming resources when no application on any computer refers to them.
[0038] Distributed garbage collection must maintain integrity between allocated resources and the references to those resources. In other words, the system must not be permitted to deallocate or free a resource when an application running on any computer in the network continues to refer to that resource. This reference-to-resource binding, referred to as “referential integrity,” does not guarantee that the reference will always grant access to the resource to which it refers. For example, network failures can make such access impossible. The integrity, however, guarantees that if the reference can be used to gain access to any resource, it will be the same resource to which the reference was first given.
[0039] Distributed systems using garbage collection must also reclaim resources no longer being referenced at some time in the finite future. In other words, the system must provide a guarantee against “memory leaks.” A memory leak can occur when all applications drop references to a resource, but the system fails to reclaim the resource for reuse because, for example, of an incorrect determination that some application still refers to the resource.
[0040] Referential integrity failures and memory leaks often result from disconnections between applications referencing the resources and the garbage collection system managing the allocation and deallocation of those resources. For example, a disconnection in a network connection between an application referring to a resource and a garbage collection system managing that resource may prevent the garbage collection system from determining whether and when to reclaim the resource. Alternatively, the garbage collection system might mistakenly determine that, since an application has not accessed a resource within a predetermined time, it may collect that resource. A number of techniques have been used to improve the distributed garbage collection mechanism by attempting to ensure that such mechanisms maintain referential integrity without memory leaks. One conventional approach uses a form of reference counting, in which a count is maintained of the number of applications referring to each resource. When a resource's count goes to zero, the garbage collection system may reclaim the resource. Such a reference counting scheme only works, however, if the resource is created with a corresponding reference counter. The garbage collection system in this case increments the resource's reference count as additional applications refer to the resource, and decrements the count when an application no longer refers to the resource.
[0041] Reference counting schemes, however, especially encounter problems in the face of failures that can occur in distributed systems. Such failures can take the form of a computer or application failure or network failure that prevent the delivery of messages notifying the garbage collection system that a resource is no longer being referenced. If messages go undelivered because of a network disconnect, the garbage collection system does not know when to reclaim the resource.
[0042] To prevent such failures, some conventional reference counting schemes include “keep-alive” messages, which are also referred to as “ping back.” According to this scheme, applications in the network send messages to the garbage collection system overseeing resources and indicate that the applications can still communicate. These messages prevent the garbage collection system from dropping references to resources. Failure to receive such a “keep-alive” message indicates that the garbage collection system can decrement the reference count for a resource and, thus, when the count reaches zero, the garbage collection system may reclaim the resource. This, however, can still result in the premature reclamation of resources following reference counts reaching zero from a failure to receive “keep-alive” messages because of network failures. This violates the referential integrity requirement.
[0043] Another proposed method for resolving referential integrity problems in garbage collection systems is to maintain not only a reference count but also an identifier corresponding to each computational entity referring to a resource. See A. Birrell, et al., “Distributed Garbage Collection for Network Objects,” No. 116, digital Systems Research Center, Dec. 15, 1993. This method suffers from the same problems as the reference counting schemes. Further, this method requires the addition of unique identifiers for each computational entity referring to each resource, adding overhead that would unnecessarily increase communication within distributed systems and add storage requirements (i.e., the list of identifiers corresponding to applications referring to each resource).
SUMMARY OF THE INVENTION
[0044] In accordance with the present invention, referential integrity is guaranteed without costly memory leaks by leasing resources for a period of time during which the parties in a distributed system, for example, an application holding a reference to a resource and the garbage collection system managing that resource, agree that the resource and a reference to that resource will be guaranteed. At the end of the lease period, the guarantee that the reference to the resource will continue lapses, allowing the garbage collection system to reclaim the resource. Because the application holding the reference to the resource and the garbage collection system managing the resource agree to a finite guaranteed lease period, both can know when the lease and, therefore, the guarantee, expires. This guarantees referential integrity for the duration of a reference lease and avoids the concern of failing to free the resource because of network errors.
[0045] In accordance with the present invention, as embodied and broadly described herein, a method for managing resources comprises the steps of receiving a request from a process referring to a resource and specifying a requested lease period, permitting shared access to the resource for a granted lease period, advising the process of the granted lease period, and deallocating the resource when the granted lease period expires. In accordance with another aspect of the present invention, as embodied and broadly described herein, a method for managing resources comprises the steps of requesting from a process access to a resource for a lease period, receiving from the process a granted lease period during which shared access to the resource is permitted, and sending a request to the process for a new lease period upon a determination that the granted lease period is about to expire but access to the resource has not completed.
[0046] In accordance with the present invention, as embodied and broadly described herein, an apparatus comprises a receiving module configured to receive a request from a process referring to a resource and specifying a requested lease period, a resource allocator configured to permit shared access to the resource for a granted lease period, an advising module configured to advise the process of the granted lease period, and a resource deallocator configured to deallocate the resource when the granted lease period expires. In accordance with another aspect of the present invention, as embodied and broadly described herein, an apparatus comprises a requesting module configured to request from a process access to a resource for a lease period, a receiving module configured to receive from the process a granted lease period during which shared access to the resource is permitted, and a second sending module configured to send another request to the process for a new lease period upon a determination that the granted lease period is about to expire but access to the resource has not completed.
[0047] In accordance with yet another aspect of the present invention, as embodied and broadly described herein, a computer program product comprises a computer usable medium having computable readable code embodied therein for managing resources. The code comprises a receiving module configured to receive a request from a process referring to a resource and specifying a requested lease period, a resource allocator configured to permit shared access to the resource for a granted lease period, an advising module configured to advise of the granted lease period, and a resource deallocator configured to deallocate the resource when the granted lease period expires. In accordance with another aspect of the present invention, as embodied and broadly described herein, a computer program product comprises a computer usable medium having computable readable code embodied therein for managing resources. The code comprises a requesting module configured to request from a process access to a resource for a lease period, a receiving module configured to receive from the process a granted lease period during which the process permits shared access to the resource, and a sending module configured to send another request to the process for a new lease period upon a determination that the granted lease period is about to expire.
[0048] In accordance with an alternative embodiment of the present invention, as embodied and broadly described herein, a method for managing leases between clients and network services comprises the steps of receiving from the client an indication of a lease on the network service, and managing the lease on behalf of the client.
[0049] In accordance with another aspect of the alternative embodiment of the present invention, as embodied and broadly described herein, a method for managing leases between clients and network services comprises the steps of receiving from the client an indication of a lease on a network service, specifying a duration for managing the lease on behalf of the client, and managing the lease for the specified duration.
[0050] In accordance with an alternative embodiment of the present invention, as embodied and broadly described herein, an apparatus is provided that comprises a memory containing a lease manager that manages leases with network services, a client that has a lease with a network service and sends a request to the lease manager to manage the lease on behalf of the client, and at least one processor for running the lease manager and the client.
[0051] In accordance with an alternative embodiment of the present invention, as embodied and broadly described herein, a computer-readable memory device is provided, containing an interface data structure used for accessing a lease manager that includes a method for use by a client with a pre-existing lease to enter into a lease with the lease manager that manages the pre-existing lease on behalf of the client.
[0052] In accordance with an alternative embodiment of the present invention, as embodied and broadly described herein, a computer-readable medium is provided, containing instructions for controlling a data processing system to perform a method for managing a lease between a client and a network service. The method comprises the steps of receiving from a client an indication of a lease on a network service, and managing the lease on behalf of the client.
[0053] In accordance with an alternative embodiment of the present invention, as embodied and broadly and described herein, a computer-readable medium is provided, containing instructions for controlling a data processing system to perform a method for managing a lease between a client and a network service. The method comprises the steps of receiving from the client an indication of a lease on the network service, specifying a duration for managing the lease on behalf of the client, and managing the lease for the specified duration.
[0054] In accordance with an alternative embodiment of the present invention, as embodied and broadly and described herein, a method for managing leases in a data processing system includes the steps of a client obtaining a lease on the network service, sending a request to the lease manager to manage the lease on behalf of the client for a specified period of time, and receiving an indication from the lease manager when the specified period of time is near expiration.
[0055] In accordance with an alternative embodiment of the present invention, as a embodied and broadly and described herein, a method for managing leases in a data processing system includes the steps of a client obtaining a lease on a resource, sending a request to the lease manager to manage the lease on behalf of the client, and receiving an indication from the lease manager when the lease is near expiration.
BRIEF DESCRIPTION OF THE DRAWINGS
[0056] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate an embodiment of the invention and, together with the description, serve to explain the advantages and principles of the invention. In the drawings,
[0057] FIG. 1 is a flow diagram of the steps performed by the application call processor according to an implementation of the present invention;
[0058] FIG. 2 is a flow diagram of the steps performed by the server call processor to process dirty calls according to the implementation of the present invention;
[0059] FIG. 3 is a flow diagram of the steps performed by the server call processor to process clean calls according to the implementation of the present invention;
[0060] FIG. 4 is a flow diagram of the steps performed by the server call processor to initiate a garbage collection process according to the implementation of the present invention;
[0061] FIG. 5 is a diagram of a preferred flow of calls within a distributed processing system;
[0062] FIG. 6 is a block diagram of the components of the implementation of a method invocation service according to the present invention;
[0063] FIG. 7 is a diagram of a distributed processing system that can be used in an implementation of the present invention;
[0064] FIG. 8 is a diagram of the individual software components in the platforms of the distributed processing system according to the implementation of the present invention;
[0065] FIG. 9 depicts a data processing system for use with an alternative embodiment of the present invention;
[0066] FIG. 10 depicts a flow chart of a method used to create a set in an alternative embodiment of the present invention;
[0067] FIG. 11 depicts a flow chart of a method used to add a lease to a set in an alternative embodiment of the present invention;
[0068] FIG. 12 depicts a flow chart of a method used to notify a client of a lease expiration event in an alternative embodiment of the present invention;
[0069] FIG. 13 depicts a flow chart of a method used to clear an event that notifies a client of a lease expiration in an alternative embodiment of the present invention;
[0070] FIG. 14 depicts a flow chart of a method used to notify a client of a failed attempt to renew a lease in an alternative embodiment of the present invention;
[0071] FIG. 15 depicts a flow chart of a method used to clear an event that notifies a client of a failed attempt to renew a lease in an alternative embodiment of the present invention;
[0072] FIG. 16 depicts a flow chart of a method used to remove a lease from a set in an alternative embodiment consistent with the present invention;
[0073] FIG. 17 depicts a flow chart of a method used to receive a lease in an alternative embodiment consistent with the present invention; and
[0074] FIG. 18 depicts a flow chart of an exemplary usage of an alternative embodiment of the present invention.
DETAILED DESCRIPTION
[0075] Reference will now be made in detail to an implementation of the present invention as illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings and the following description to refer to the same or like parts.
[0076] The present invention may be implemented by computers organized in a conventional distributed processing system architecture. The architecture for and procedures to implement this invention, however, are not conventional, because they provide a distributed garbage collection scheme that ensures referential integrity and eliminates memory leaks.
A. Overview
[0077] A method invocation (MI) component located in each of the computers in the distributed processing system implements the distributed garbage collection scheme of this invention. The MI component may consist of a number of software modules preferably written in the JAVA™ programming language.
[0078] In general, whenever an application in the distributed processing system obtains a reference to a distributed resource, by a name lookup, as a return value to some other call, or another method, and seeks to access the resource, the application makes a call to the resource or to an MI component managing the resource. That MI component, called a managing MI component, keeps track of the number of outstanding references to the resource. When the number of references to a reference is zero, the managing MI component can reclaim the resource. The count of the number of references to a resource is generally called the “reference count” and the call that increments the reference count may be referred to as a “dirty call.”
[0079] When an application no longer requires a distributed resource, it sends a different call to the resource or the managing MI component. Upon receipt of this call, the managing MI component decrements the reference count for the resource. This call to drop a reference may be referred to as a “clean call.”
[0080] In accordance with an implementation of the present invention, a dirty call can include a requested time interval, called a lease period, for the reference to the resource. Upon receipt of the dirty call, the managing MI component sends a return call indicating a period for which the lease was granted. The managing MI component thus tracks the lease period for those references as well as the number of outstanding references. Consequently, when the reference count for a resource goes to zero or when the lease period for the resource expires, the managing MI component can reclaim the resource.
B. Procedure
[0081] An application call processor in an MI component performs the steps of the application call procedure 100 illustrated in FIG. 1. The server call processor in the managing MI component performs the steps of the procedures 200, 300, and 400 illustrated in FIGS. 2-4, respectively. The managing MI component's garbage collector performs conventional procedures to reclaim resources previously bound to references in accordance with instructions from the server call processor. Accordingly, the conventional procedures of the garbage collector will not be explained.
[0082] 1. Application Call Processor
[0083] FIG. 1 is a flow diagram of the procedure 1100 that the application call processor of the MI component uses to handle application requests for references to resources managed by the same or another MI component located in the distributed processing system.
[0084] After an application has obtained a reference to a resource, the application call processor sends a dirty call, including the resource's reference and a requested lease period to the managing MI component for the resource (step 110). The dirty call may be directed to the resource itself or to the managing MI component.
[0085] The application call processor then waits for and receives a return call from the managing MI component (step 120). The return call includes a granted lease period during which the managing MI component guarantees that the reference of the dirty call will be bound to its resource. In other words, the managing MI component agrees not to collect the resource corresponding to the reference of a dirty call for the grant period. If the managing MI component does not provide a grant period, or rejects the request for a lease, then the application call processor will have to send another dirty call until it receives a grant period.
[0086] The application call processor monitors the application's use of the reference and, either when the application explicitly informs the application call processor that the reference is no longer required or when the application call processor makes this determination on its own (step 130), the application call processor sends a clean call to the managing MI component (step 140). In a manner similar to the method used for dirty calls, the clean call may be directed to the referenced resource and the managing MI component will process the clean call. Subsequently, the application call processor eliminates the reference from a list of references being used by the application (step 150).
[0087] If the application is not yet done with the reference (step 130), but the application call processor determines that the grant period for the reference is about to expire (step 160), then the application call processor repeats steps 110 and 120 to ensure that the reference to the resource is maintained by the managing MI component on behalf of the application.
[0088] 2. Server Call Processor
[0089] The MI component's server call processor performs three main procedures: (1) handling dirty calls; (2) handling incoming clean calls; and (3) initiating a garbage collection cycle to reclaim resources at the appropriate time.
[0090] (I) Dirty Calls
[0091] FIG. 2 is a flow diagram of the procedure 200 that the MI component's server call processor uses to handle requests to reference resources, i.e., dirty calls, that the MI software component manages. These requests come from application call processors of MI components in the distributed processing system, including the application call processor of the same MI component as the server call processor handling requests.
[0092] First, the server call processor receives a dirty call (step 210). The server call processor then determines an acceptable grant period (step 220). The grant period may be the same as the requested lease period or some other time period. The server call processor determines the appropriate grant period based on a number of conditions including the amount of resource required and the number of other grant periods previously granted for the same resource.
[0093] When the server call processor determines that a resource has not yet been allocated for the reference of a dirty call (step 230), the server call processor allocates the required resource (step 240).
[0094] The server call processor then increments a reference count corresponding to the reference of a dirty call (step 250), sets the acceptable grant period for the reference-to-resource binding (step 260), and sends a return call to an application call processor with the grant period (step 270). In this way, the server call processor controls incoming dirty calls regarding references to resources under its control.
[0095] Applications can extend leases by sending dirty calls with an extension request before current leases expire. As shown in procedure 200, a request to extend a lease is treated just like an initial request for a lease. An extension simply means that the resource will not be reclaimed for some additional interval of time, unless the reference count goes to zero.
[0096] (ii) Clean Calls
[0097] The MI component's server call processor also handles incoming clean calls from application call processors. When an application in the distributed processing system no longer requires a reference to a resource, it informs the MI component managing the resource for that reference so that the resource may be reclaimed for reuse. FIG. 3 is a flow diagram of the procedure 300 with the steps that the MI component's server call processor uses to handle clean calls.
[0098] When the server call processor receives a clean call with a reference to a resource that the MI component manages (step 310), the server call processor decrements a corresponding reference count (step 320). The clean call may be sent to the resource, with the server call processor monitoring the resource and executing the procedure 300 to process the call. Subsequently, the server call processor sends a return call to the MI component that sent the clean call to acknowledge receipt (step 330). In accordance with this implementation of the present invention, a clean call to drop a reference may not be refused, but it must be acknowledged.
[0099] (iii) Garbage Collection
[0100] The server call processor also initiates a garbage collection cycle to reclaim resources for which it determines that either no more references are being made to the resource or that the agreed lease period for the resource has expired. The procedure 400 shown in FIG. 4 includes a flow diagram of the steps that the server call processor uses to initiate a garbage collection cycle.
[0101] The server call processor monitors reference counts and granted lease periods and determines whether a reference count is zero for a resource managed by the MI component, or the grant period for a reference has expired (step 410). When either condition exists, the server call processor initiates garbage collection (step 420) of that resource. Otherwise, the server call processor continues monitoring the reference counts and granted lease periods.
C. Call Flow
[0102] FIG. 5 is a diagram illustrating the flow of calls among MI components within the distributed processing system. Managing MI component 525 manages the resources 530 by monitoring the references to those resources 530 (see garbage collect 505). Because the managing MI components 525 manages the resources, the server call processor of managing MI component 525 performs the operations of this call flow description.
[0103] FIG. 5 also shows that applications 510 and 540 have corresponding MI components 515 and 545, respectively. Each of the applications 510 and 540 obtains a reference to one of the resources 530 and seeks to obtain access to one of the resources 530 such that a reference is bound to the corresponding resource. To obtain access, applications 510 and 540 invoke their corresponding MI components 515 and 545, respectively, to send dirty calls 551 and 571, respectively, to the MI component 525. Because the MI components 515 and 525 handle application requests for access to resources 530 managed by another MI component, such as managing MI component 525, the application call processors of MI components 515 and 545 perform the operations of this call flow description.
[0104] In response to the dirty calls 551 and 571, managing MI component 525 sends return calls 552 and 572, respectively, to each of the MI components 515 and 545, respectively. The dirty calls include granted lease periods for the references of the dirty calls 551 and 571.
[0105] Similarly, FIG. 5 also shows MI components 515 and 545 sending clean calls 561 and 581, respectively, to managing MI component 525. Clean calls 561 and 581 inform managing MI component 525 that applications 510 and 540, respectively, no longer require access to the resource specified in the clean calls 561 and 581. Managing MI component 525 responds to clean calls 561 and 581 with return calls 562 and 582, respectively. Return calls 562 and 582 differ from return calls 552 and 572 in that return calls 562 and 582 are simply acknowledgments from MI component 525 of the received clean calls 561 and 581.
[0106] Both applications 510 and 540 may request access to the same resource.
[0107] For example, application 510 may request access to “RESOURCE(1)” while application 540 was previously granted access to that resource. MI component 525 handles this situation by making the resource available to both applications 510 and 540 for agreed lease periods. Thus, MI component 525 will not initiate a garbage collection cycle to reclaim the “RESOURCE(1)” until either applications 510 and 540 have both dropped their references to that resource or the latest agreed periods has expired, whichever event occurs first.
[0108] By permitting more than one application to access the same resource simultaneously, the present invention also permits an application to access a resource after it sent a clean call to the managing MI component dropping the reference to the resource. This occurs because the resource is still referenced by another application or the reference's lease has not yet expired so the managing MI component 525 has not yet reclaimed the resource. The resource, however, will be reclaimed after a finite period, either when no more applications have leases or when the last lease expires.
D. MI Components
[0109] FIG. 6 is a block diagram of the modules of an MI component 600 according to an implementation of the present invention. MI component 600 can include a reference component 605 for each reference monitored, application call processor 640, server call processor 650, and garbage collector 660.
[0110] Reference component 605 preferably constitutes a table or comparable structure with reference data portions 610, reference count 620, and grant period register 630. MI component 600 uses the reference count 620 and grant period 630 for each reference specified in a corresponding reference data portion 610 to determine when to initiate garbage collector 660 to reclaim the corresponding resource.
[0111] Application call processor 640 is the software module that performs the steps of procedure 100 in FIG. 1. Server call processor 650 is the software module that performs the steps of procedures 200, 300, and 400 in FIGS. 2-4. Garbage collector 660 is the software module that reclaims resources in response to instructions from the server call processor 650, as explained above.
E. Distributed Processing System
[0112] FIG. 7 illustrates a distributed processing system 50 which can be used to implement the present invention. In FIG. 7, distributed processing system 50 contains three independent and heterogeneous platforms 100, 200, and 300 connected in a network configuration represented by the network cloud 55. The composition and protocol of the network configuration represented in FIG. 7 by the cloud 55 is not important as long as it allows for communication of the information between platforms 700, 800 and 900. In addition, the use of just three platforms is merely for illustration and does not limit the present invention to the use of a particular number of platforms. Further, the specific network architecture is not crucial to this invention. For example, another network architecture that could be used in accordance with this invention would employ one platform as a network controller to which all the other platforms would be connected.
[0113] In the implementation of distributed processing system 50, platforms 700, 800 and 900 each include a processor 710, 810, and 910 respectively, and a memory, 750, 850, and 950, respectively. Included within each processor 710, 810, and 910, are applications 720, 820, and 920, respectively, operating systems 740, 840, and 940, respectively, and MI components 730, 830, and 930, respectively.
[0114] Applications 720, 820, and 920 can be programs that are either previously written and modified to work with the present invention, or that are specially written to take advantage of the services offered by the present invention.
[0115] Applications 720, 820, and 920 invoke operations to be performed in accordance with this invention.
[0116] MI components 730, 830, and 930 correspond to the MI component 600 discussed above with reference to FIG. 6.
[0117] Operating systems 740, 840, and 940 are standard operating systems tied to the corresponding processors 710, 810, and 910, respectively. The platforms 700, 800, and 900 can be heterogenous. For example, platform 700 has an UltraSparc® microprocessor manufactured by Sun Microsystems Corp. as processor 710 and uses a Solaris® operating system 740. Platform 800 has a MIPS microprocessor manufactured by Silicon Graphics Corp. as processor 810 and uses a Unix operating system 840. Finally, platform 900 has a Pentium microprocessor manufactured by Intel Corp. as processor 910 and uses a Microsoft Windows 95 operating system 940. The present invention is not so limited and could accommodate homogenous platforms as well.
[0118] 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.
[0119] Memories 750, 850, and 950 serve several functions, such as general storage for the associated platform. Another function is to store applications 720, 820, and 920, MI components 730, 830, and 930, and operating systems 740, 840, and 940 before execution by the respective processor 710, 810, and 910. In addition, portions of memories 750, 850, and 950 may constitute shared memory available to all of the platforms 700, 800, and 900 in network 50.
E. MI Services
[0120] The present invention may be implemented using a client/server model. The client generates requests, such as the dirty calls and clean calls, and the server responds to requests.
[0121] Each of the MI components 730, 830 and 930 shown in FIG. 7 preferably includes both client components and server components. FIG. 8, which is a block diagram of a client platform 1000 and a server platform 1100, applies to any two of the platforms 700, 800, and 900 in FIG. 7.
[0122] Platforms 1000 and 1100 contain memories 1050 and 1150, respectively, and processors 1010 and 1110, respectively. The elements in the platforms 1000 and 1100 function in the same manner as similar elements described above with reference to FIG. 7. In this example, processor 1010 executes a client application 1020 and processor 1110 executes a server application 1120. Processors 1010 and 1110 also execute operating systems 1040 and 1140, respectively, and MI components 1030 and 1130, respectively.
[0123] MI components 1030 and 1130 each include a server call processor 1031 and 1131, respectively, an application call processor 1032 and 1132, respectively, and a garbage collector 1033 and 1133, respectively. Each of the MI components 1030 and 1130 also contains reference components, including reference data portions 1034 and 1134, respectively, reference counts 1035 and 1135, respectively, and grant period registers 1036 and 1136, respectively, for each reference that the respective MI component 1030 or 1130 monitors.
[0124] Application call processors 1032 and 1132 represent the client service and communicate with server call processors 1031 and 1131, respectively, which represent the server service. Because platforms 1000 and 1100 contain a server call processor, an application call processor, a garbage collector, and reference components, either platform can act as a client or a server.
[0125] For purposes of the discussion that follows, however, platform 1000 is designated the client platform and platform 1100 is designated as the server platform. In this example, client application 1020 obtains references to distributed resources and uses MI component 1030 to send dirty calls to the resources managed by MI component 1130 of server platform 1100.
[0126] Additionally, server platform 1100 may be executing a server application 1120. Server application 1120 may also use MI component 1130 to send dirty calls, which may be handled by MI component 1130 when the resources of those dirty calls are managed by MI component 1130. Alternatively, server application 1120 may use MI component 1130 to send dirty calls to resources managed by MI component 1030.
[0127] Accordingly, server call processor 1031, garbage collector 1033, and reference count 1035 for MI component 1030 of client platform 1000 are not active and are therefore presented in FIG. 8 as shaded. Likewise, application call processor 1132 of MI component 1130 of the server platform 1100 is shaded because it is also dormant.
[0128] When client application 1020 obtains a reference corresponding to a resource, application call processor 1032 sends a dirty call, which server call processor 1131 receives. The dirty call includes a requested lease period. Server call processor 1131 increments the reference count 1135 for the reference in the dirty call and determines a grant period. In response, server call processor 1131 sends a return call to application call processor 1030 with the grant period. Application call processor 1032 uses the grant period to update recorded grant period 1035, and to determine when the resource corresponding to the reference of its dirty call may be reclaimed.
[0129] Server call processor 1131 also monitors the reference counts and grant periods corresponding to references for resources that it manages. When one of its reference counts 1135 is zero, or when the grant period 1135 for a reference has expired, whichever event occurs first, server call processor 1131 may initiate the garbage collector 1133 to reclaim the resource corresponding to the reference that has a reference count of zero or an expired grant period.
[0130] The leased-reference scheme according to the implementation of the present invention does not require that the clocks on the platforms 1000 and 1100 involved in the protocol be synchronized. The scheme merely requires that they have comparable periods of increase. Leases do not expire at a particular time, but rather expire after a specific time interval. As long as there is approximate agreement on the interval, platforms 1000 and 1100 will have approximate agreement on the granted lease period. Further, since the timing for the lease is, in computer terms, fairly long, minor differences in clock rate will have little or no effect.
[0131] The transmission time of the dirty call can affect the protocol. If MI component 1030 holds a lease to reference and waits until just before the lease expires to request a renewal, the lease may expire before the MI component 1130 receives the request. If so, MI component 1130 may reclaim the resource before receiving the renewal request. Thus, when sending dirty calls, the sender should add a time factor to the requested lease period in consideration of transmission time to the platform handling the resource of a dirty call so that renewal dirty calls may be made before the lease period for the resource expires.
F. Conclusion
[0132] In accordance with the present invention a distributed garbage collection scheme ensures referential integrity and eliminates memory leaks by providing granted lease periods corresponding to references to resources in the distributed processing system such that when the granted lease periods expire, so do the references to the resources. The resources may then be collected. Resources may also be collected when they are no longer being referenced by processes in the distributed processing system with reference to counters assigned to the references for the resources.
ALTERNATIVE EMBODIMENT OF THE PRESENT INVENTION
[0133] Although an embodiment consistent with the present invention has been previously described as related to garbage collection, an alternative embodiment also consistent with the present invention provides a lease manager that manages access to leased network services. Thus, a client can use the lease manager to manage the client's leases on its behalf during periods when the client is inactivate (i.e., not in memory).
[0134] In a distributed system, users of the system may share services and resources over a network of many devices. A “network service” refers to a resource, data, or functionality that can be accessed by a user, program, device, or another network service and that can be computational, storage related, communication related, or related to providing access to another user. As used herein, a “client” refers to an entity that uses a network service, and a “server” refers to the provider of the network service (or the network service itself).
[0135] As described above, clients may lease access to a particular network service as an effective manner of sharing access to that network service with other clients. Such leases only remain active for a specified period of time absent an affirmative indication from a client to extend, or renew, the lease. Although a client will sometimes be rendered inactive to conserve memory, the client may still desire to maintain its lease with a given network service. For example, in a device having limited memory, a client (e.g., a data object) may have a lease on a file and may be rendered inactive to conserve memory. However, the client may wish to maintain its lease so that the file manager does not delete the file while the client is inactive. In this situation, the client may use the lease manager to renew its leases on its behalf and thus when the client becomes reactivated, it may continue to utilize the lease.
[0136] The problem of a client maintaining access to leased resources during periods when the client is inactive is especially important in the case of a lookup service. A lookup service defines a network's directory of services located within a distributed system comprised of multiple machines, and stores references to those network services. Typically, for each network service, the lookup service contains a stub object with methods that can be used by a client (e.g., a program) to access the network service (e.g., a printer). Once a client's leases with a lookup service expire, the client will no longer be able to view other network services listed in the lookup service and the client's entry in the lookup service is removed. Because the client will no longer be listed in the lookup service, other network services will be unaware that the client exists. In fact, if the client requires that another network service try to access it before it is reactivated, the client will remain permanently inactivated. The lookup service is further discussed in co-pending U.S. patent application Ser. No. 09/044,931, entitled “Dynamic Lookup Service in a Distributed System,” assigned to a common assignee, filed on Mar. 20, 1998, which is incorporated herein by reference.
[0137] In accordance with an alternative embodiment of the present invention, a lease manager is provided that maintains leases on network services on behalf of clients. The lease manager leases its service to a client. Thus, if a client becomes inactive, the lease manager renews the client's leases with other network services. Further, the lease manager notifies a client if the client's lease with the lease manager is near expiration so that the client may activate itself and renew its lease with the lease manager. The lease manager also notifies clients of failed attempts to renew leases with the lease manger.
[0138] FIG. 9 depicts a data processing system 900 suitable for use with this alternative embodiment of the present invention. Data processing system 900 includes a computer 901 connected to a network 940. Computer 901 includes a memory 902, a secondary storage device 906, a central processing unit (CPU) 910, an input device 914, and a video display 918. The memory 902 includes a client 920, a lease manager 922, a network service 924, a Java™ runtime system 926, and the Java remote method invocation system (RMI) 928. The secondary storage device 906 includes objects that store information reflecting lease management information used by the lease manager 922.
[0139] The Java runtime system 926 allows programs running on top of it to access, in a platform-independent manner, various system functions, including windowing capabilities and networking capabilities of the host operating system. The Java runtime system 926 is provided as part of the Java software development kit available from Sun Microsystems of Mountain View, Calif.
[0140] RMI 928 facilitates remote method invocation by allowing objects executing on one computer or device to invoke methods of an object on another computer or device. RMI 928 is also provided as part of the Java software development kit. RMI 928 includes four packages, one of which is entitled java.rmi. A “package” refers to a collection of related classes, interfaces, and exceptions. Java.rmi provides an interface, a class for accessing remote names, and a security manager for RMI. The security manager for RMI is implemented by a number of exception messages that may be sent to notify a user of a specific error condition. An “exception” refers to an event that alters the normal course of operation of a program. Exceptions are generated by the Java runtime system in response to errors that are detected as classes are loaded and their methods are executed. When the runtime system generates an exception, the operation may be referred to as “throwing” the exception. Runtime exceptions are objects. Further details on the runtime exception messages of the Java runtime system and the java.rmi package may be found in “Java 1.1 Developer's Guide” by Jamie Jaworski, Sams.net Publishing Second Edition, 1997, incorporated herein by reference.
[0141] The lease manager 922 enters into a lease arrangement with a client 920, whereby the lease manager agrees to renew leases between the client 920 and a network service 924, on behalf of the client 920, for a specified period of time. Once the lease manager 922 has been initialized, it remains active on an ongoing basis. A client 920 requests renewal of its leases with the lease manager 922 as needed. The lease manager 922 grants leases that are generally of a longer duration than leases granted by other network services. Therefore, the leases granted by the lease manager 922 will be sufficiently long so that the renewal calls will not place an excessive load on the client 920, the lease manager 922, or the network 940. The lease manager 922 may be used to manage leases for a variety of network services including, for example, leasing storage described in greater detail in co-pending U.S. patent application Ser. No. 09/044,923, entitled “Method and System for Leasing Storage,” assigned to a common assignee, filed on Mar. 20, 1998, which is incorporated herein by reference; leasing of delegation certificates, described in greater detail in co-pending U.S. patent application Ser. No. 09/044,838, entitled “Method, Apparatus and Product for Leasing of Delegation Certificates in a Distributed System,” assigned to a common assignee, filed on Mar. 20, 1998, which is incorporated herein by reference; and leasing of group membership, described in greater detail in co-pending U.S. patent application Ser. No. 09/044,834, entitled, “Method, Apparatus, and Product for Leasing of Group Membership in a Distributed System,” assigned to a common assignee, filed on Mar. 20, 1998, which is incorporated herein by reference.
[0142] Although this alternative embodiment of the present invention has been described as operating in a distributed system and the Java programming environment, one skilled in the art will appreciate that this embodiment of the present invention can be practiced in other systems and other programming environments. Additionally, although aspects of the present invention are described as being stored in memory, one skilled in the art will appreciate that these aspects can also be stored on or read from other types of computer-readable media, such as secondary storage devices, like hard disks, floppy disks, or CD-ROM; a carrier wave from the Internet; or other forms of RAM or ROM, either currently know or later developed. Sun, Sun Microsystems, the Sun Logo, Java and Java-based trademarks are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.
Interface to the Lease Manager
[0143] As shown below, the interface to the lease manager provides a number of methods that allow a client to interact with the lease manager. More specifically, the lease manager provides a method, createLeaseMgmtSet (see Code Table 1 below), that allows a client to group existing leases with other network services into lease management sets, or sets. A set is an entity used by the lease manager to manage leases. Further details of a set will be discussed below. The lease manger also provides an interface to the sets, LeaseMgmtSet interface (see Code Table 1 below), which includes seven methods defined on a set: addLease, setExpirationWarningListener, clearExpirationWarningListener, setRenewalFailureListener, clearRenewalFailureListener, removeLease, and getSetLease. These methods allow a client to perform operations on a set. Each of these methods will be further described below.
[0144] As shown above, the createLeaseMgmtSet is used to create a set. A set is an entity used by the lease manager to manage leases between clients and network services. The sets include methods defined on the sets themselves. A set may consist of one or more leases. Each lease in a set need not be granted by the same host and can be independently added to or removed from the set. To utilize the createLeaseMgmtSet, a client sends an appropriate request to the lease manager. The lease manager in turn executes the createLeaseMgmtSet method. The leaseDuration argument specifies how long (in milliseconds) the client wants the set's initial duration to be. This duration must be positive. The initial duration of the set's lease will be equal to or shorter than the requested duration.
[0145] FIG. 10 depicts a flowchart of the steps performed by the createLeaseManagementSet method. First, a client sends a request to the lease manager to create a set (step 1010). The lease manager then creates a set (Step 1020). After the set is created, processing ends.
[0146] A client may cancel a lease on a set at any time while the set remains active. The method used to cancel a lease is included as part of the lease object itself. Once a lease on a set has been canceled the lease manager destroys the set and does not take further action on any of the leases within the set. The lease manager will not cancel a lease unless it receives an affirmative cancellation request from a client. Upon receiving a cancellation request from a client, the lease manager will cancel a lease specified in the request.
[0147] After a set has been created, a client may use any of the seven methods defined on the set. A client may use the addLease method to add a lease between a client and a network service, other than the lease manager, to a set. The addLease method may not be used on a lease granted by the lease manager. A client may not add a lease to a set if it is already in another.
[0148] The addLease method includes several parameters. The leaseToRenew argument specifies the lease being added to the set. The membershipDuration argument specifies the initial time duration that a lease will be in the set. The membership duration is unilaterally specified by the client, rather than negotiated between the client and the server. The duration value may be specified as any value between 1 and a maximum value defined by a user. Otherwise, the lease manager sends an illegal argument error to the client. Each lease in a set may have a different expiration time. After a leases's membership duration expires, the lease will be removed from the set without further client intervention. The lease manager will not renew a lease for a period that extends beyond its membership duration.
[0149] In addition, the addLease method may generate, or throw, an exception class if the appropriate conditions for complete processing of the method are not met. The exception classes thrown by the addLease method include Remote Exception, Unknown Lease Exception, and Illegal Argument Exception. Each of the exception classes will be referenced below relative to the conditions that cause them to be thrown. The setExpirationWarningListener, clearExpirationWarningListener, setRenewalFailureListener, clearRenewalFailureListener, and removeLease methods may also throw these exception classes if the appropriate conditions for processing are not met. Each of the exception classes thrown by the other methods included in the interface to the lease manager is discussed below relative to the conditions that cause them to be thrown.
[0150] If a client invokes the addLease method on a lease that is already in a set, the method will associate the existing lease with the membership duration specified by the most recent call to addLease. If a client attempts to invoke the addLease method to add a lease to a set that no longer exists, the method will throw an exception in the form of UnknownLeaseException. If a client and the lease manager experience a communication failure such that the client is unable to reach the lease manager the addLease method will send a RemoteException to the client. If a client invokes the addLease method for a lease that is currently a member of another set allocated by the same lease manager, an IllegalArgumentException will be thrown.
[0151] Once placed in a set, a lease will stay there until the lease on the set itself expires or is canceled, the lease is removed from the set by the client, the lease expires, the lease's membership duration expires, or a renewal call results in anything but a normal return or a specified failure message.
[0152] FIG. 11 depicts a flowchart of the steps performed by the addLease method. If the lease manager fails to respond to a client's request to add a lease to a set, then the request was not completed, probably due to a communications failure (step 1110). In this situation, a RemoteException is thrown and processing ends (step 1115). Otherwise, processing continues to step 1120 and the lease manager determines whether the specified set exists. If the specified set does not exist, then an UnknownLeaseException is thrown and processing ends (step 1125). Otherwise, processing continues and the lease manager determines whether the lease belongs to another set (step 1130). If the lease belongs to another set then an exception in the form of IllegalArgumentException is thrown and processing ends (step 1135). Otherwise, the lease manager receives information from the client indicating the duration of the lease (step 1140). Next, the lease manager determines whether the specified lease duration falls in a range between 1 and a specified maximum value (step 1150). If the lease duration does not fall with this range, the lease manager throws an IllegalArgumentException (step 1135). Otherwise, if the lease duration falls in the specified range, the lease is added to the set (step 1155), and processing ends.
[0153] There is an event associated with each set that occurs at a client-specified time before the lease on a set expires. The setExpirationWarningListener method allows a client to register to receive the event indicating that a set's lease is near expiration. This method creates a lease between the client and the lease manager for notification of the event. The duration of the lease corresponds to the duration of the lease on the set. This lease may be canceled by the client at any time by the clearExpirationWarningListener, discussed below. When a client registers with this method to receive the notification event, the event registration is assigned a unique identification code.
[0154] The event registration request includes a listener argument, a minWarning argument and a handback argument. The listener argument specifies which client to notify that the lease is about to expire. The minWarning argument specifies, in milliseconds, how long before lease expiration the event should be generated. The handback argument specifies an object that will be included as part of the expiration warning event notification.
[0155] A client that has registered for the setExpirationWarningListener method will receive an event indicating that a set's lease will expire at the time corresponding to minWarning. If the current expiration of the set's lease is sooner than minWarning, then the event will occur immediately.
[0156] FIG. 12 depicts a flowchart of the steps performed by the setExpirationWarningListener method. If the lease manager fails to respond to an appropriate client call to this method, then a communications error has occurred (step 1210), a RemoteException is thrown, and processing ends (step 1215). Otherwise, if the lease manager receives the registration request, it determines whether the specified set exists (step 1220). If the set does not exist, an UnknownLease Exception is thrown and processing ends (step 1230). If the set does exist, processing continues and the lease manager receives an indication, included as part of the registration requested, of when an expiration warning event should be sent to the client (steps 1235 and 1240). When an expiration warning condition occurs (step 1245), the lease manager sends an event to the client (1250). The setExpirationWarning method waits idle if the event conditions fail to occur.
[0157] After an event is sent to the client (step 1250), processing ends.
[0158] The clearExpirationWarningListener method removes an event registration associated with an event indicating that a set's lease is near expiration. This method cancels the lease between a client and the lease manager for notification of an expiration event. When invoking this method, a client specifies the set for which the expiration warning event registration is to be removed. A client may call this method even if a set does not have an active event registration.
[0159] FIG. 13 depicts a flow chart of the steps performed by the clearExpirationWarningListener method. If the lease manager fails to respond to an appropriate client call to this method, a communications failure has occurred (step 1305), a RemoteException is thrown and processing ends. Otherwise, processing continues. If the request is received, the lease manager determines whether the specified set exists (step 1320). If the set does not exist the lease manager throws an UnknownLeaseException and processing ends (step 1325). Otherwise, the lease manager clears the event warning (step 1330).
[0160] The setRenewalFailureListener method allows a client to register to receive an event indicating that a lease in the specified set has expired, or that the lease manager was unsuccessful in renewing a lease, i.e., the lease renewal attempt returned something other than a normal return or a RemoteException. This registration creates a lease between the client and the lease manager. The registration will have the same expiration as the set to which the client belongs. The lease manager assigns each registration a unique event identification code.
[0161] A registration request includes a listener, a minWarning argument and a handback argument. The listener argument specifies which client to notify that the lease is about to expire. The minWarning argument specifies, in milliseconds, how long before lease expiration the event should be generated. The handback argument specifies an object that will be included as part of the expiration warning event notification.
[0162] If a client has registered with the setRenewalFailureListener method, the client will receive a renewal failure event. In response to the event the client may re-request renewal of the lease on the set and the lease manager will continue attempting to renew the lease. If the client does not respond to the event, or if the client has not registered with the setRenewalFailureListener method, the lease manager will allow the set to expire and destroy it.
[0163] FIG. 14 depicts the steps performed by the setRenewalFailureListener method. If the lease manager fails to respond to an appropriate client call to this method, a communications error has occurred (step 1410), a RemoteException is thrown and processing ends (step 1415). Otherwise, processing continues and the lease manager awaits occurrence of an appropriate event trigger (step 1420). An appropriate event trigger includes minWarning time occurring with respect to a lease in a set expiring, or an unsuccessful lease renewal. If an event trigger occurs, the lease manager sends an event to the client (1425). Otherwise, the lease manager awaits occurrence of an event trigger. Once an event has been sent to the client, processing ends.
[0164] The clearRenewalFailureListener method removes an event registration associated with an event indicating a failure to renew a lease in a set. This method may be called even if there is no active registration. If a set no longer exists and a client attempts to call this method, the lease manager will return an error message to the client.
[0165] FIG. 15 depicts the steps performed by the clearRenewalFailureListener method. If the lease manager fails to respond to an appropriate client call to this method, a communications failure has occurred (step 1505) a RemoteException is thrown, and processing ends. Otherwise, if the request is received, the lease manager determines weather the specified set exists (step 1520). If the set does not exist the lease manager throws an UnknownLeaseException and processing ends (step 1525). Otherwise, the lease manager clears the registration for the event warning (step 1530).
[0166] A client may remove a lease from a set by using the removeLease method. Removal from a set does not cancel a lease, but rather it merely removes the lease from the set. The expiration time of a lease that has been removed from a set will be set to either the time resulting from the last successful renewal call made by the lease manager, or the expiration time the lease originally had when it was added to the set if the lease manager had not yet successfully renewed the lease. The removeLease method includes a leasetoRemove argument that identifies the lease will be removed from a set.
[0167] FIG. 16 depicts a flow chart of the steps performed by the removeLease method. If the lease manager fails to respond to an appropriate client call to this method, a communications failure has occurred, a RemoteException is thrown, and processing ends (step 1615). Otherwise, the lease manager determines whether the set from which a lease is to be removed exists (step 1620). If the set does not exist, an UnknownLeaseException is thrown and processing ends (step 1625). However, if the set exists, the lease manager determines whether the specified lease is in the set (step 1630). If the specified lease is not in the specified set, the lease manager returns a null value to the client and processing ends (step 1635). If the specified lease is in the specified set then the lease manager returns the lease object to the client (step 1640).
[0168] As described above, information identifying sets and leases between the lease manager and clients is maintained as objects in a secondary storage area. The lease manager may retrieve these objects as needed. The getSetLease method returns the lease associated with a specified set. FIG. 17 depicts a flow chart of the steps performed by the getSetLease method. In response to an appropriate client invocation request, the getSetLease method returns a lease object corresponding to the specified lease on the set (step 1720). This ends processing of the getSetLease method.
[0169] Similarly, the getLease method returns a specified lease on a network service that is managed by the lease manager. It is called by states associated with exceptions that occur with respect to individual leases, rather than with respect to a lease on a set. Code table 2, below, lists two states associated with exceptions that may invoke the getLease method.
[0170] The ExpirationWarningEvent object is returned to a client when a lease between the client and a network service is about to expire. The object includes a method called getLease, which returns to the client information identifying the lease nearing expiration. The expiration of the returned lease reflects the expiration time the lease had when the event occurred. Renewal calls may have changed the actual expiration time of the lease from the time the event was generated and delivered.
[0171] The RenewFailureEvent object is returned to a client when an attempt to renew a lease between the client and a network service fails. The delivery of this event indicates that an attempt to renew a lease between a client and a network service failed. The object includes a method called getLease, which returns information to the client identifying the lease that was not renewed. The object also provides to the client information reflecting any exception that was thrown. If the lease manager was able to renew the lease before it expired, the lease's expiration time will reflect the result of the last successful renewal call. When a renewal failure event is not corrected, the lease is removed from its associated set, but is not canceled. The lease will continue to exist until it expires.
[0172] By its affirmative renewal requirement, the lease manager allows clients no longer needing to access the lease manager to terminate its lease with the lease manager without any required action, and forces clients that have experienced unrecoverable failures to release their relationship with the lease manager. This proves most useful when, for example, in the case of a lease to a lookup service, a failed client should no longer be listed there anyhow. Therefore, by automatically canceling any lease that is not affirmatively renewed by a client, the lease manager assists in ensuring that the lookup service maintains an accurate listing of available services.
An Exemplary Usage of the Lease Manager
[0173] FIG. 18 depicts a flowchart of the steps performed by a client and a lease manager in connection with an exemplary usage of the lease manager of an alternative embodiment of the present invention. This flowchart depicts the chronological steps performed by both a client and the lease manger. First, the client invokes the createSet method, to create a set, by sending an appropriate request, specifying the duration of a lease on a set, to the lease manager (step 1805). Responsive to the request to create a set, the lease manager creates the set by populating it with leases, as discussed above with respect to FIG. 10 (step 1810).
[0174] Next, the client adds a lease to the set by invoking the addLease method. The client invokes the addLease method by sending an appropriate request, specifying the lease to be added and its membership duration, to the lease manager (step 1815). The lease manager receives the request and executes the addLease method, described above with respect to FIG. 11 (step 1820). If an exception occurs during processing of the method, that exception will be thrown. Otherwise, the specified lease is added to the specified set.
[0175] After adding a lease to the set, the client invokes the setRenewalFailure method, allowing it to register to receive notification of a lease renewal failure, by sending an appropriate request (step 1825). Responsive to the invocation, the setRenewalFailure method registers the client for the event notification, assigns a unique event registration code to the registration, and sends the event registration to the client as described above with respect to FIG. 14 (step 1830). The client then receives the event registration (step 1835).
[0176] Next, the client inactivates itself to conserve its resources (step 1840). The client remains inactive until it receives an event notification from the lease manager. While the client is inactive the lease manager remains active, monitoring the client's leases on its behalf. The lease manager maintains a status of the leases it is currently managing and determines whether a lease with a network service is near expiration (step 1845). If a lease is near expiration, the lease manager renews the lease (step 1850). Otherwise, the lease manager awaits an indication that a lease between the lease manager and the client is near expiration (step 1855). Upon determining that a lease between the lease manager and the client is near expiration, the lease manager sends an event to the client (step 1860). The client activates upon receiving the event (step 1870). When the client activates, it sends a request to cancel the lease on the set (step 1875). Upon receiving the request to cancel the lease on the set, the lease manager cancels the lease and takes no further action with regard to any of the leases that were in the canceled set, and processing ends (step 1880).
[0177] The foregoing description of an implementation of the invention has been presented for purposes of illustration and description. It is not exhaustive and does not limit the invention to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practicing of the invention. For example, the described implementation may be implemented as a combination of hardware and software, or hardware alone. Additionally, although described as operating in a Java environment, methods and systems consistent with an implementation of the present invention could operate in other environments, such as other object-oriented programming environments or non-object-oriented programming environments. The scope of the invention is defined by the appended claims and their equivalents.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method in a data processing system, containing a client, a lease manager, and a network service, the method comprising the steps performed by the lease manager of:
receiving from the client an indication of a lease on the network service; and
managing the lease on behalf of the client.
2. The method of claim 1 wherein the managing step further includes the step of notifying the client when the lease is near expiration.
3. The method of claim 1 wherein the managing step further includes the step of renewing the lease before expiration.
4. The method of claim 1 wherein the managing step further includes the steps of:
attempting to re new the lease;
determining that the attempt failed; and
notifying the client that the attempt failed.
5. The method of claim 1 wherein the managing step further includes the steps of:
receiving an indication of a period of time;
and managing the lease for the period of time.
6. A method in a data processing system, containing a client, a lease manager, and a network service, the method comprising the steps performed by the lease manager of:
receiving from the client an indication of a lease on the network service;
specifying a duration for managing the lease on behalf of the client; and
managing the lease for the specified duration.
7. The method of claim 6 wherein the managing step further includes the step of notifying the client that the lease is near expiration.
8. The method of claim 6 wherein the managing step further includes the step of renewing the lease before expiration.
9. A method in a data processing system containing a client, a lease manager, and a network service, the method comprising the steps performed by the lease manager of:
receiving from the client an indication of a first lease with the network service;
entering into a second lease with the client for a period of time;
while the period of time has not expired,
determining whether the first lease is near expiration;
when it is determined that the first lease is near expiration,
determining whether the client has registered to be notified of when the first lease is near expiration;
when it is determined that the client has registered to be notified,
notifying the client that the first lease is near expiration;
when it is determined that the client has not registered to be notified,
attempting to renew the first lease with the network service;
determining whether the attempt failed; and
when it is determined that the attempt failed,
notifying the client of the failed attempt to renew the lease with the network service.
10. A data processing system comprising:
a memory containing:
a lease manager that manages leases with network services;
a client that has a lease with a network service and that sends a request to the lease manager to manage the lease on behalf of the client; and
at least one processor for running the lease manager and the client.
11. A computer-readable memory device containing an interface data structure used for accessing a lease manager, the data structure containing:
a method for use by a client with a preexisting lease to enter into a management lease with the lease manager that manages the preexisting lease on behalf of the client.
12. The computer-readable memory device of claim 11 wherein the interface data structure contains a notify method for use by the client to receive notification that the preexisting lease is near expiration.
13. The computer-readable memory device of claim 11 wherein the interface data structure contains a notify method for use by the client to receive notification when an attempt to renew the preexisting lease fails.
14. The computer-readable memory device of claim 11 wherein the interface data structure contains a second method for use by the client to cancel the management lease with the lease manager.
15. The computer-readable memory device of claim 11 wherein the interface data structure contains a second method for use by the client to group the preexisting lease into a set.
16. The computer-readable memory device of claim 15 wherein the interface data structure contains a second method for use by the client to remove the preexisting lease from the set.
17. A computer-readable medium containing instructions for controlling a data processing system to perform a method, the data processing system having a lease manager, the method comprising the steps performed by the lease manager of:
receiving from a client an indication of a lease on a network service; and
managing the lease on behalf of the client.
18. The computer-readable medium of claim 17 wherein the managing step further includes the step of notifying the client that the lease will expire in a specified time period.
19. The computer-readable medium of claim 17 wherein the managing step further includes the step of notifying the client that an attempt to renew the lease failed.
20. The computer-readable medium of claim 17 wherein the managing step further includes the step of renewing the lease before expiration.
21. The computer-readable medium of claim 17 wherein the managing step further includes the step of entering into a lease agreement of a duration unilaterally specified by the client.
22. An apparatus for managing a lease in a data processing system containing a client and a network service, the apparatus comprising:
means for receiving from a client, an indication of a lease on a network service; and
means for managing the lease on behalf of the client.
23. A computer-readable medium containing instructions for controlling a data processing system to perform a method, the data processing system having a lease manager, the method comprising the steps performed by the lease manager of:
receiving from a client, an indication of a lease on a network service;
specifying a duration for managing the lease on behalf of the client; and
managing the lease for the specified duration.
24. The computer-readable medium of claim 23 wherein the managing step further includes the step of notifying the client that the lease is near expiration.
25. The computer-readable medium of claim 23 wherein the managing step further includes the step of renewing the lease before expiration.
26. A method in a data processing system containing a client, a network service, and a lease manager, comprising the steps of:
obtaining a lease on the network service;
sending a request to the lease manager to manage the lease on behalf of the client for a specified period of time; and
receiving an indication from the lease manager when the specified period of time is near expiration.
27. A method in a data processing system containing a client, a network service, and a lease manager, comprising the steps of:
obtaining a lease on the network service;
sending a request to the lease manager to manage the lease on behalf of the client; and
receiving an indication from the lease manager when the lease is near expiration.
28. The method of claim 27 wherein the sending step includes:
rendering the client inactive.
29. The method of claim 28 wherein the receiving step includes:
activating the client.
Patent Citations (141)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4491946 | 1985-01-01 | Kryskow, Jr. et al. | Applicant |
| US4713806 | 1987-12-01 | Oberlander et al. | Applicant |
| US4809160 | 1989-02-01 | Mahon et al. | Applicant |
| US4823122 | 1989-04-01 | Mann et al. | Applicant |
| US4939638 | 1990-07-01 | Stephenson et al. | Applicant |
| US4956773 | 1990-09-01 | Saito et al. | Applicant |
| US5088036 | 1992-02-01 | Ellis et al. | Applicant |
| US5109486 | 1992-04-01 | Seymour | Applicant |
| US5187787 | 1993-02-01 | Skeen et al. | Applicant |
| US5218699 | 1993-06-01 | Brandle et al. | Applicant |
| US5257369 | 1993-10-01 | Skeen et al. | Applicant |
| US5293614 | 1994-03-01 | Ferguson et al. | Applicant |
| US5297283 | 1994-03-01 | Kelly, Jr. et al. | Applicant |
| US5311591 | 1994-05-01 | Fischer | Applicant |
| US5339435 | 1994-08-01 | Lubkin et al. | Applicant |
| US5386568 | 1995-01-01 | Wold et al. | Applicant |
| US5390328 | 1995-02-01 | Frey et al. | Applicant |
| US5423042 | 1995-06-01 | Jalili et al. | Applicant |
| US5440744 | 1995-08-01 | Jacobson et al. | Applicant |
| US5448740 | 1995-09-01 | Kiri et al. | Applicant |
| US5452459 | 1995-09-01 | Drury et al. | Applicant |
| US5455952 | 1995-10-01 | Gjovaag | Applicant |
| US5471629 | 1995-11-01 | Risch | Applicant |
| US5475792 | 1995-12-01 | Stanford et al. | Applicant |
| US5475817 | 1995-12-01 | Waldo et al. | Applicant |
| US5481721 | 1996-01-01 | Serlet et al. | Applicant |
| US5504921 | 1996-04-01 | Dev et al. | Applicant |
| US5511197 | 1996-04-01 | Hill et al. | Applicant |
| US5524244 | 1996-06-01 | Robinson et al. | Applicant |
| US5553282 | 1996-09-01 | Parrish et al. | Applicant |
| US5555367 | 1996-09-01 | Premerlani et al. | Applicant |
| US5557798 | 1996-09-01 | Skeen et al. | Applicant |
| US5560003 | 1996-09-01 | Nilsen et al. | Applicant |
| US5561785 | 1996-10-01 | Blandy et al. | Applicant |
| US5577231 | 1996-11-01 | Scaizi et al. | Applicant |
| US5603031 | 1997-02-01 | White et al. | Applicant |
| US5617537 | 1997-04-01 | Yamada et al. | Applicant |
| US5628005 | 1997-05-01 | Hurvig | Applicant |
| US5640564 | 1997-06-01 | Hamilton et al. | Applicant |
| US5644768 | 1997-07-01 | Periwal et al. | Applicant |
| US5652888 | 1997-07-01 | Burgess | Applicant |
| US5655148 | 1997-08-01 | Richman et al. | Applicant |
| US5659751 | 1997-08-01 | Heninger | Applicant |
| US5671225 | 1997-09-01 | Hooper et al. | Applicant |
| US5675796 | 1997-10-01 | Hodges et al. | Applicant |
| US5680573 | 1997-10-01 | Rubin et al. | Applicant |
| US5680617 | 1997-10-01 | Gough et al. | Applicant |
| US5684955 | 1997-11-01 | Meyer et al. | Applicant |
| US5689709 | 1997-11-01 | Corbett et al. | Applicant |
| US5706435 | 1998-01-01 | Barbara et al. | Applicant |
| US5724588 | 1998-03-01 | Hill et al. | Applicant |
| US5727145 | 1998-03-01 | Nessett et al. | Applicant |
| US5737607 | 1998-04-01 | Hamilton et al. | Applicant |
| US5745678 | 1998-04-01 | Herzberg et al. | Applicant |
| US5745695 | 1998-04-01 | Gilchrist et al. | Applicant |
| US5745703 | 1998-04-01 | Cetjin et al. | Applicant |
| US5754849 | 1998-05-01 | Dyer et al. | Applicant |
| US5757925 | 1998-05-01 | Faybishenko | Applicant |
| US5761656 | 1998-06-01 | Ben-Shachar | Applicant |
| US5764897 | 1998-06-01 | Khalidi | Applicant |
| US5768532 | 1998-06-01 | Megerian | Applicant |
| US5774551 | 1998-06-01 | Wu et al. | Applicant |
| US5778228 | 1998-07-01 | Wei | Applicant |
| US5778368 | 1998-07-01 | Hogan et al. | Applicant |
| US5787425 | 1998-07-01 | Bigus | Applicant |
| US5787431 | 1998-07-01 | Shaughnessy | Applicant |
| US5790548 | 1998-08-01 | Sistanizadeh et al. | Applicant |
| US5809507 | 1998-09-01 | Cavanaugh, III | Applicant |
| US5813013 | 1998-09-01 | Shakib et al. | Applicant |
| US5815149 | 1998-09-01 | Mutschler, III et al. | Applicant |
| US5815709 | 1998-09-01 | Waldo et al. | Applicant |
| US5815711 | 1998-09-01 | Sakamoto et al. | Applicant |
| US5829022 | 1998-10-01 | Watanabe et al. | Applicant |
| US5832529 | 1998-11-01 | Wollrath et al. | Applicant |
| US5832593 | 1998-11-01 | Wurst et al. | Applicant |
| US5835737 | 1998-11-01 | Sand et al. | Applicant |
| US5842018 | 1998-11-01 | Atkinson et al. | Applicant |
| US5844553 | 1998-12-01 | Hao et al. | Applicant |
| US5845129 | 1998-12-01 | Wendorf et al. | Applicant |
| US5860004 | 1999-01-01 | Fowlow et al. | Applicant |
| US5860153 | 1999-01-01 | Matena et al. | Applicant |
| US5864862 | 1999-01-01 | Kriens et al. | Applicant |
| US5864866 | 1999-01-01 | Henckel et al. | Applicant |
| US5872928 | 1999-02-01 | Lewis et al. | Applicant |
| US5875335 | 1999-02-01 | Beard | Applicant |
| US5878411 | 1999-03-01 | Borroughs et al. | Applicant |
| US5884024 | 1999-03-01 | Lim et al. | Applicant |
| US5884079 | 1999-03-01 | Furusawa | Applicant |
| US5887134 | 1999-03-01 | Ebrahim | Applicant |
| US5890158 | 1999-03-01 | House et al. | Applicant |
| US5892904 | 1999-04-01 | Atkinson et al. | Applicant |
| US5933497 | 1999-08-01 | Beetcher et al. | Applicant |
| US5935249 | 1999-08-01 | Stern et al. | Applicant |
| US5940827 | 1999-08-01 | Hapner et al. | Applicant |
| US5946485 | 1999-08-01 | Weeren et al. | Applicant |
| US5946694 | 1999-08-01 | Copeland et al. | Applicant |
| US5966531 | 1999-10-01 | Skeen et al. | Applicant |
| US6003763 | 1999-12-01 | Gallagher et al. | Applicant |
| US6009103 | 1999-12-01 | Woundy | Applicant |
| US6061699 | 2000-05-01 | DiCecco et al. | Applicant |
| US6061713 | 2000-05-01 | Bharadhwaj | Applicant |
| EP300516 | 1989-01-01 | Applicant | |
| EP351536A3 | 1990-01-01 | Applicant | |
| EP384339 | 1990-08-01 | Applicant | |
| EP472874 | 1992-03-01 | Applicant | |
| EP474340 | 1992-03-01 | Applicant | |
| EP497022A1 | 1992-08-01 | Applicant | |
| EP555997 | 1993-08-01 | Applicant | |
| EP565849 | 1993-10-01 | Applicant | |
| EP569195A2 | 1993-11-01 | Applicant | |
| EP625750 | 1994-11-01 | Applicant | |
| EP635792 | 1995-01-01 | Applicant | |
| EP651328 | 1995-05-01 | Applicant | |
| EP660231 | 1995-06-01 | Applicant | |
| EP697655 | 1996-02-01 | Applicant | |
| EP718761 | 1996-06-01 | Applicant | |
| EP767432 | 1997-04-01 | Applicant | |
| EP778520 | 1997-06-01 | Applicant | |
| EP794493 | 1997-09-01 | Applicant | |
| EP803811 | 1997-10-01 | Applicant | |
| EP803810 | 1997-10-01 | Applicant | |
| EP805393 | 1997-11-01 | Applicant | |
| EP810524 | 1997-12-01 | Applicant | |
| EP817022 | 1998-01-01 | Applicant | |
| EP817025 | 1998-01-01 | Applicant | |
| EP817020 | 1998-01-01 | Applicant | |
| EP836140A2 | 1998-04-01 | Applicant | |
| GB2253079 | 1992-08-01 | Applicant | |
| GB2262825 | 1993-06-01 | Applicant | |
| GB2305087 | 1997-03-01 | Applicant | |
| JP11-45187 | 1999-02-01 | Applicant | |
| WO92/07335 | 1992-04-01 | Applicant | |
| WO92/09948 | 1992-06-01 | Applicant | |
| WO93/25962A1 | 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 (87)
- Aldrich et al., “Providing Easier Access to Remote Objects in Client-Server Systems,” System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l. Conference, Jan. 6-9, 1998, pp. 366-375.Applicant
- Aldrich et al., “Providing Easier Access to Remote Objects in Distributed Systems,” Calif. Institute of Technology, www.cs.caltech.edu/%7Ejed/paper/jedipaper.html, Nov. 21, 1997.Applicant
- Dave et al., “Proxies, Application Interfaces, and Distributing Systems,” XP 002009478, IEEE, 1992, pp. 212-220.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
- 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
- IBM Technical Disclosure Bulletin, “Local Network Monitoring to Populate Access Agent Directory,” vol. 36, No. 09A, pp. 403-405, Sep. 1993.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
- “Java (TM) Remote Method Invocation Specification,” Sun Microsystems, Inc., <java.sun.com/products/jdk 1.2beta 1>, 1997.Applicant
- “Transparent Network Computing,” Locus Computing Corporation, Jan. 5, 1995.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, pp. 1-12, Nov. 1992.Applicant
- Ahmed et al., “A Program Building Tool of Parallel Applications,” Yale University, pp. 1-23, Dec. 1, 1993.Applicant
- Alexander et al., “Active Bridging,” Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, Sep. 1997.Applicant
- Anderson et al., “Persistent Linda: Linda +Transactions +Query Processing,” Proceedings of the 13th Symposium on Fault Tolerant Systems, pp. 93-109, 1991.Applicant
- Anonymous, “Change-Notification Service for Shared Files,” IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, XP002108713, New York, US Aug. 1993.Applicant
- Anonymous, “Resources Preemption for Priority Scheduling,” IBM Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931, XP002109435 New York, US, Nov. 1973.Applicant
- Beech et al., “Object Databases as Generalizations of Relational Databases,” Computer Standards & Interfaces, vol. 13, Nos. 1/3, pp. 221-230, Amsterdam, NL, Jan. 1991.Applicant
- Bertino et al., “Object-Oriented Database Management Systems: Concepts and Issues,” Computer, vol. 24, No. 4, pp. 34-47, Los Alamitos, CA, Apr. 1991.Applicant
- Betz et al., “Interoperable Objects: Laying the Foundation for Distributed Object Computing,” Dr. Dobb's Journal, vol. 19, No. 11, p. 18(13), Oct. 1994.Applicant
- Bevan et al., “An Efficient Reference Counting Solution To The Distributed Garbage Collection Problem,” Parallel Computing, NL, Elsevier Science Publishers, Amsterdam, vol. 9, No. 2, pp. 179-192, Jan. 1989.Applicant
- Birrell et al., “Grapevine: An Exercise in Distributed Computing,” Communications of the ACM, vol. 25, No. 4, pp. 260-274, Apr. 1982.Applicant
- Birrell et al., “Implementing Remote Procedure Calls,”ACM Transactions on Computer Systems, vol. 2, No. 1, pp. 39-59, Feb. 1984.Applicant
- Birrell et al., “Network Objects,” DEC SRC Research Report 115, Feb. 28, 1994.Applicant
- Cannon et al., “Adding Fault-Tolerant Transaction Processing to LINDA,” Software-Practice and Experience, vol. 24(5), pp. 449-466, May 1994.Applicant
- Birrell, Andrew, et al., “Distributed Garbage Collection for Network Objects,” Digital Systems Research Center, No. 116, Dec. 15, 1993, pp. 1-18.Applicant
- Birrell, Andrew, et al., “Network Objects,” Digital Equipment Corp. Systems Research Center Technical Report, 27 (5), Dec. 1993, pp. 217-230.Applicant
- Gray, Cary G. et al., “Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency,” Computer Science Department, Stanford University, 1989, pp. 202-210.Applicant
- Hamilton, Marc A., “Java and the Shift to Net-Centric Computing,” Computer, Aug. 1996, pp. 31-39.Applicant
- Chung, Kin-Man and Yuen, Herbert, “A Tiny'Pascal Compiler: Part 1: the P-Code Interpreter,” Byte Publications, Inc., Sep. 1978.Applicant
- Chung, Kin-Man and Yuen, Herbert, “A Tiny'Pascal Compiler: Part 2: The P-Compiler,” Byte Publications, Inc., Oct. 1978.Applicant
- McDaniel, Gene, “An Analysis of a Mesa Instruction Set,” Xerox Corporation, May 1982.Applicant
- Mitchell, James G., Maybury, William, and Sweet, Richard, “Mesa Language Manual,” Xerox Corporation.Applicant
- Pier, Kenneth A., “A Retrospective on the Dorado, A High-Performance Personal Computer,” Xerox Corporation, Aug. 1983.Applicant
- Pier, Kenneth A., “A Retrospective on the Dorado, A High-Performance Personal Computer,” IEEE Conference Proceedings, The 10th Annual international Symposium on Computer Architecture, 1983.Applicant
- Thompson, Ken, “Regular Expression Search Algorithm,”Communications of the ACM, vol. 11, No. 6, pp. 419-422, Jun. 1968.Applicant
- Cardelli, “Obliq, A Lightweight Language For Networks Objects,”Digital SRC, pp. 1-37, Nov. 5, 1993.Applicant
- Carriero et al., “Distributed Data Structures in Linda,” Principles of Programming Language, pp. 1-16, 1986.Applicant
- Carriero et al., “Distributed Data Structure in Linda,” Yale Research Report Yale/DCS/RR-438, Nov. 1985.Applicant
- Coulouris et al., “Distributed Systems Concepts and Designs,” Second Edition, Addison-Wesley, 1994.Applicant
- Dave et al., “Proxies, Application Interface, And Distributed Systems,” Proceedings International Workshop On Object Orientation In Operating Systems, pp. 212-220, Sep. 24, 1992.Applicant
- Duex et al., “The O2 System,”Communications Of The Association For Computing Machinery, vol. 34, No. 10, pp. 34-48, Oct. 1, 1991.Applicant
- Dijkstra, “Self-stabilizing Systems in Spite of Distributed Control,” Communications of the ACM, vol. 17, No. 11, pp. 643-644, Nov. 1974.Applicant
- Dolev et al., “On the Minimal Synchronism Needed for Distributed Consensus,” Journal of the ACM, vol. 34, No. 1, pp. 77-97, Jan. 1987.Applicant
- Dourish, “A Divergence-Based Model of Synchrony and Distributed in Collaborative Systems,” Xerox Technical Report EPC-1194-102, pp. 1-10, 1994.Applicant
- Drexler et al., “Incentive Engineering for Computational Resource Management,” The Ecology of Computation, Elsevier Science Publishers B.V., pp. 231-266, 1988.Applicant
- Droms, “RFC 1541 Dynamic Host Configuration Protocol,”<http://www.cis.ohiostate.edu/htbin/rfc/rfc1541.html>, pp. 1-33, Oct. 1993.Applicant
- Emms, “A Definition Of An Access Control Systems Language,” Computer Standards And Interfaces, vol. 6, No. 4, pp. 443-454, Jan. 1, 1987.Applicant
- Gelernter et al., “Parallel Programming in Linda,” Yale University, pp. 1-21, Jan. 1985.Applicant
- Gelernter, “Generative Communication in Linda,” ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, pp. 80-112, Jan. 1985.Applicant
- Gosling et al., “The Java (TM) Language Specification,” Addison-Wesley, 1996.Applicant
- Gottlob et al., “Extending Object-Oriented Systems with Roles,” ACM Transactions On Information Systems, vol. 14, No. 3, pp. 268-296, Jul. 1996.Applicant
- Guth,“JavaOne: Sun to Expand Java Distributed Computing Effort,” <http://www.sunworld.com/swol-02-1998/swol-02-sunspots.html>, XP002109935, P. 1, Feb. 20, 1998.Applicant
- Hamilton et al., “Subcontract: A Flexible Base For Distributed Programming,” Proceedings of 14th Symposium of Operating System Principles, Dec. 1993.Applicant
- Harris et al., “Proposal for a General Java Proxy Class for Distributed Systems and Other Uses,” Netscape Communication Corp., Jun. 25, 1997.Applicant
- Hartman et al., “Liquid Software: A New Paradigm For Networked Systems,” Technical Report 96-11, Department of Comp. Sci Univ. of Arizona, Jun. 1996.Applicant
- Howard et al., “Scale and Performance in a Distributed File System,” ACM Transactions on Computer Systems, vol. 6, No. 1, pp. 51-81, Feb. 1988.Applicant
- Hunt, “IDF: A Graphical Data Flow Programming Language for Image Processing and Computer Vision,” Proceedings of the International Conference on Systems, Man, and Cybernetics, pp. 351-360, Los Angeles, Nov. 4-7, 1990.Applicant
- IBM (TM) Technical Disclosure Bulletin, “Objects 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, pp. 6-1-6-90, Oct. 1994.Applicant
- Jaworski, “Java 1.1 Developer's Guide, 2nd Edition,” Sams.net, 1997.Applicant
- Jones et al., “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” pp. 165-175, John Wiley & Sons, 1996.Applicant
- Kambhatla et al., “Recovery with Limited Replay: Fault-Tolerant Processes in Linda,” Oregon Graduate Institute, Technical Report CSIE 90-019, pp. 1-16, Sep. 1990.Applicant
- Kay et al., “An Overview of the Raleigh Object-Oriented Database System,” ICL Technical Journal, vol. 7, No. 4, pp. 780-798, Oxford, GB, Nov. 1991.Applicant
- Kougiouris et al., “Support for Space Efficient Object Invocation in Spring,” Sep. 1994.Applicant
- Krasner et al., “The Smalltalk-80 Virtual Machine,” Byte Publications Inc., pp. 300-320, Aug. 1991.Applicant
- Lamport et al., “The Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, pp. 382-401, Jul. 1982.Applicant
- Linda Database Search, pp. 1-68, Jul. 20, 1995.Applicant
- Lindholm et al., “The Java (TM) Virtual Machine Specification,” Addison Wesley, 1996.Applicant
- Liskov et al., “Distributed Object Management in Thor,” International Workshop on Distributed Object Management, p. 12, 1992.Applicant
- Mullender, “Distributed Systems,” Second Edition, Addison-Wesley, 1993.Applicant
- Mummert et al., “Long Term Distributed File Reference Tracing: Implementation and Experience,” Carnegie Mellon University School of Computer Science, pp. 1-28, Nov. 1994.Applicant
- Orfali et al., “The Essential Distributed Objects Survival Guide,” Chapter 11: Corba Commerical ORBs, pp. 203-215, John Wiley & Sons, Inc., 1996.Applicant
- Ousterhout et al., “The Sprite Network Operating System,” Computer, IEEE, pp. 23-36, Feb. 1988.Applicant
- Pinakis,“Using Linda as the Basic of an Operating System Microkernel,” University of Western Australia, Department of Computer Science, pp. 1-165, Aug. 1993.Applicant
- Riggs et al., “Pickling State in the Java (TM) System,” USENIX Association Conference on Object-Oriented Technologies and Systems, XP-002112719, pp. 241-250, Jun. 17-21, 1996.Applicant
- Rosenberry et al., “Understanding DCE,” Chapters 1-3, 6, 1992.Applicant
- Sharrott et al., “ObjectMap: Integrating High Performance Resources into a Distributed Object-oriented Environment,”ICODP, 1995.Applicant
- Venners, “Jini Technology, Out of the Box,” Javaworld, 'Online!, pp. 1-4, Dec. 1998.Applicant
- Waldo et al., “Events In An PCR Based Distributed System,” Proceedings Of The 1995 USENIX Technical Conference, Proceedings USENIX Winter 1995 Technical Conference, New Orleans, LA, USA, 16-20, pp. 131-142, Jan. 1995.Applicant
- Wilson et al., “Design of the Opportunistic Garbage Collector,” Proceedings of the Objects Oriented Programming Systems Languages And Applications Conference, New Orleans, vol. 24, No. 10, Oct. 1989.Applicant
- Wu, “A Type System For An Object-Oriented Database System,” Proceeding of the International Computer Software and Applications Conference (COMPSAC), Tokyo, Japan, pp. 333-338, Sep. 11-13, 1991.Applicant
- Yemini et al., “Towards Programmable Networks,” IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, L'Aquila, Italy, Oct. 1996.Applicant
- Cary G. Gray and David R. Cheriton, “Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency”, Computer Science Department, Stanford University, pp. 202-210.Applicant
- Jian Yin et al., “Using Leases to Support Server-Driven Consistency in Large-Scare Systems”, Computer Sciences Department, University of Texas at Austin, pp. 285-294.Examiner