US 6,957,237 B1Grant

Database store for a virtual heap

Issue Date:2005-10-18

•56 Claims

•20 Drawing Sheets

Abstract

A database store method and system for a virtual persistent heap may include an Application Programming Interface (API) that provides a mechanism to cache portions of the virtual heap into an in-memory heap for use by an application. The virtual heap may be stored in a persistent store that may include one or more virtual persistent heaps, with one virtual persistent heap for each application running in the virtual machine. Each virtual persistent heap may be subdivided into cache lines. The store API may provide atomicity on the store transaction to substantially guarantee the consistency of the information stored in the database. The database store API provides several calls to manage the virtual persistent heap in the store. The calls may include, but are not limited to: opening the store, closing the store, atomic read transaction, atomic write transaction, and atomic delete transaction.

Metadata

Assignee

Sun Microsystems, Inc.

Inventors

Bernard A. Traversat
Mohamed M. Abdelaziz
Thomas E. Saulpaugh
Gregory L. Slaughter

Application Information

Application Number:US 09/587,076

Filing Date:2000-06-02

Priority Date:2000-06-02

Art Unit:2162

Patent Drawings (20 sheets)

Description

Background of the Invention

[0001] 1. Field of the Invention

[0002] The present invention relates to the field of virtual machines, and more particularly to a database store method and system for a virtual persistent heap.

[0003] 2. Description of the Related Art

[0004] The problem of migrating a running process, for example, an application, from one machine to another on a network has been tried for years, and there is much research literature on the subject of “process migration,” but not much success in actually solving this difficult problem.

[0005] Currently, with the world moving towards a network centric model of computing, with unprecedented connectivity, there is a growing need to run an application (editor, email, browser, etc.) on one computer, and to be able to later resume running that same application from another machine in another location. Such a need can only be fulfilled via application migration. At the same time, modern operating systems have become very complex, and tend to have multiple applications running on a very thick client, and this complexity has resulted in much unreliability. It's thus desirable to be able to separate an application from the rest of the complex operating system, and persist it somewhere on the net, where it is protected from the complex, thick client system. This need, as well, can only be fulfilled via persistent application migration.

Java™

[0006] The computer world currently has many platforms, among them Microsoft Windows®, Apple Macintosh®, OS/2, UNIX®, Linux and NetWare®. Software must be compiled separately to run on each platform. The binary file for an application that runs on one platform cannot run on another platform, because the binary file is platform-specific.

[0007] A “virtual machine” may be defined as an operating environment that sits on top of one or more other computer platforms, and provides the capability to run one binary file on the virtual machine on the one or more other computer platforms. Thus, an application is written and compiled to run on the virtual machine, and thus does not need to be compiled separately to run on the one or more other computer platforms.

[0008] The Java Platform is a software platform for delivering and running applets and applications on networked computer systems. What sets the Java Platform apart is that it sits on top of other platforms, and executes bytecodes, which are not specific to any physical machine, but are machine instructions for a virtual machine. A program written in the Java Language compiles to a bytecode file that can run wherever the Java Platform is present, on any underlying operating system. In other words, the same file can run on any operating system that is running the Java Platform. The Java Platform has two basic parts, the Java Virtual Machine and the Java Application Programming Interface (Java API).

[0009] The Sun Java technologies are grouped into three editions: Java 2 Micro (J2ME), Standard (J2SE), and Enterprise (J2EE) Editions. Each edition includes a Java Virtual Machine (JVM) that fits inside a range of consumer devices such as set-top, screenphone, wireless, car, and digital assistant devices J2ME specifically addresses the consumer space, which covers the range of small devices from smart cards and pagers up to the set-top box, an appliance almost as powerful as a computer. The consumer devices targeted by J2ME, such as set-top boxes, printers, copiers, and cellular phones, typically have fewer resources and more specialized functionality than a typical Network Computer. Such devices may have special constraints such as small memory footprint, no display, or no connection to a network. The J2ME API provides the smallest Java API one of these limited devices can have and still run. A Java-powered application written for one particular device may operate on a wide range of similar devices. Applications written with J2ME are upwardly scalable to work with J2SE and J2EE.

Java Remote Method Invocation (RMI)

[0010] RMI is a Java programming language-enabled extension to traditional remote procedure call mechanisms. RMI allows not only data to be passed from object to object around the network but full objects, including code.

K Virtual Machine (KVM)

[0011] The K Virtual Machine (KVM) is a Java runtime environment that is an extremely lean implementation of the Java virtual machine for use in devices that have a small memory footprint. The KVM is the core of the Java 2 Micro Edition (J2ME). The KVM is suitable for 16/32-bit RISC/CISC microcontrollers with a total memory of no more than a few hundreds of kilobytes (Kbytes) and sometimes less than 128 Kbytes of RAM. This typically applies to small-footprint memory devices, including digital cellular phones, pagers, mainstream personal digital assistants, low-end analog set-top boxes, and small retail payment terminals.

Application Migration and Java

[0012] By writing an application in Java, the application is not tied to a particular machine, but is rather written to run on an abstract or “virtual” machine, the Java Virtual Machine (JVM). Consequently, it is possible for the application to run on any machine on the network that implements the JVM specification. This aids in process migration, because past attempts at this problem have been largely foiled by differences, even slight ones, among the various machines on a network where an application is intended to migrate and run. By itself, though, an application written in Java cannot migrate from one machine on a net to another, because once the application starts running, it runs only in the heap of the JVM on which it initially started.

[0013] The Java language provides the programmer with an object model, a strong type system, automatic main memory storage management and concurrency through lightweight threads. However, the Java platform provides no satisfactory way of maintaining these properties beyond the single execution of a JVM. Instead, the programmer must deal explicitly with saving the state of an application, using one of a variety of persistence mechanisms, for example, file input/output, object serialization or relational database connectivity, none of which approach complete support for the full computational model. This lack of completeness, while only a minor nuisance for simple applications, becomes a serious problem as application complexity increases.

Orthogonal Persistence for Java

[0014] Orthogonal persistence for the Java platform (OPJ) addresses some of the limitations of application migration with Java with no changes to the source language and minor modifications to the specification of the Java Virtual Machine life cycle. In effect, orthogonal persistence extends the automatic memory management of the Java platform to encompass stable memory.

[0015] OPJ allows a running Java application to persist with no change to the application or to Java (thus orthogonal). This is achieved by enhancements to the JVM that implement a persistent heap that parallels the heap that Java code runs in. It is possible to suspend a running application and have a checkpoint result in the persistent heap that can later be reactivated on that same JVM. However, migrating to another JVM on another machine is not supported.

[0016] Another limitation of the persistent heap and checkpointing as implemented in OPJ is that any portions of a process that are dependent upon external state and not transient may be invalid when the code runs again, because the actual external state may have changed. An example of an external state is a socket for a network connection.

[0017] Yet another limitation of the persistent heap and checkpointing as implemented in OPJ is that it supports one large persistent heap for all Java code running on the system, making it difficult to separate out one particular application to migrate to another node. The persistent heap may include system Java objects and application Java objects. System Java objects are those Java objects tied to the platform (machine and operating system) on which the JVM is executing with the Java Native Interface (JNI). System Java objects may include native methods for the platform on which the JVM is executing. The application Java objects for the particular application would have to be separated from the application Java objects from any other running process and from the system Java objects.

[0018] Still yet another limitation of the OPJ model is that it requires two separate garbage collectors, one for the “in-memory” heap and one for the persistent heap.

JVM Separation Models

[0019] In a system providing application migration, it would be desirable to separate an application so that only it runs in a heap (and is persisted in a persistent heap). One way to do this is to start a separate JVM on the machine for each application. Although simple, the approach may not be practical. For one thing, this solution uses many system resources. Other approaches for application separation are hierarchical, with one “real” JVM and many “virtual” JVMs multiplexed on top. It would be desirable to provide a virtual machine separation model that separates applications into discrete persistent stores, permits the running of applications one at a time in an in-memory heap, and that does so without requiring the running of multiple copies (real or virtual) of the JVM.

Summary of the Invention

[0020] The problems outlined above may be solved in large part by a system and method for persistent application migration that provides application separation and a method of maintaining the properties of a process beyond the single execution of a virtual machine such as a Java Virtual Machine (JVM) while preserving the external state of the process.

[0021] In one embodiment, an application on a system may be separated from other applications and from system code and data, and thus migratable separately from the other applications. In one embodiment, one or more applications on a system may each have an in-memory heap serving as “physical” memory that is being used for the current execution of the application, a virtual heap that may include the entire heap of the application including at least a portion of the runtime environment, and a persistent heap or store where the virtual heap can be checkpointed. The virtual heap and the persistent heap may be combined in one memory (the virtual heap may serve as the persistent heap). Alternatively, the virtual heap may be checkpointed to a separate, distinct persistent heap. The combination of the in-memory heap, the virtual heap, and the persistent store may be referred to as the “virtual persistent heap.”

[0022] A heap may include code and data for use by the application. In object-oriented programming languages such as Java, at least some of the code and data in the heap for the application may be encapsulated in objects. Objects may be defined as structures that are instances of a particular class or subclass of objects. Objects may include instances of the class's methods or procedures (code) and/or data related to the object. An object is what actually “runs” in an object-oriented program in the computer.

[0023] A heap may also include structures for managing the application's code and data in the heap. For example, a heap may be divided into sections, for example pages or cache lines. The sections of the heap may be grouped into sets of two or more sections for some heap processing functions such as garbage collection. Sections of the heap may include structures for managing code and data (objects) in the section. For example, one or more structures for tracking internal and external references to objects in a section may be kept in the sections of memory. An internal reference to an object may be defined as a reference to an object from another object in the same section of the heap. An external reference may be defined as a reference to an object from another object in another section of the heap.

[0024] In one embodiment, an application may establish one or more leases to local and/or remote services external to the application. In one embodiment, an application may establish one or more leases to system code that give the application access to resources external to the application such as system resources. System code for accessing an external resource may be referred to as a system service. A lease on system code for accessing an external resource may be referred to as a leased system service. For example, an application may establish leases to system services that give the application access to system drivers for accessing communications ports in the system.

[0025] In a virtual persistent heap, the entire heap may be made persistent. The virtual persistent heap may enable the checkpointing of the state of the computation of the virtual machine to a persistent storage such as a disk or flash device for future resumption of the computation from the checkpoint. The virtual persistent heap may enable the migration of the virtual machine computation states from one machine to another. Both the data and computation state may be migrated. The virtual persistent heap may also provide for the suspension and resumption of an application, such as upon restarting a device after an intentional or unintentional shutdown of the device. The virtual persistent heap is important for small consumer and appliance devices including Java-enabled devices, such as cellular phones and Personal Digital Assistants (PDAs), as these appliances may be shutdown and restarted often. In one embodiment, the virtual persistent heap may include the entire address space of the virtual machine heap an application is using.

[0026] A feature of the virtual persistent heap is the method used to cache portions of the virtual persistent heap into the physical heap. The virtual persistent heap may include a caching mechanism that is effective with small consumer and appliance devices that typically have a small amount of memory and that may be using flash devices as persistent storage. The caching strategy may provide a reduced amount of caching and may help to improve locality among elements of the virtual persistent heap that are cached in the physical heap, thus minimizing caching overhead.

[0027] In one embodiment, the virtual persistent heap may be divided into cache lines. A cache line may be the smallest amount of virtual persistent heap space that can be loaded or flushed at one time. Caching in and caching out operations may be used to load cache lines into the heap or to flush dirty cache lines to the store.

Database Store Method for a Virtual Persistent Heap

[0028] In one embodiment, a database store method and Application Programming Interface (API) may be provided for the virtual persistent heap. The API may provide a mechanism to cache portions of the virtual heap to the in memory heap for use by the application. In one embodiment, the virtual heap may be stored in a persistent store. Thus, the database store method and API may be provided to manage the virtual persistent heap in the store.

[0029] In one embodiment, the persistent store may comprise one or more virtual persistent heaps, with one virtual persistent heap for each application running in the virtual machine. In one embodiment, a virtual persistent heap may be subdivided into cache lines. The cache line may be the smallest amount of data that can be read from or written to the heap.

[0030] In one embodiment, the database store API may be a “small footprint” set of calls to substantially meet the memory constraints of the targeted virtual machine. In one embodiment, the database store method and API may work with small consumer and embedded Java-enabled devices, as well as larger devices supporting Java and other virtual machine environments such as PCs, laptops, etc. In one embodiment, the store API may provide atomicity on the store transaction to substantially guarantee the consistency of the information stored in the database.

[0031] In one embodiment, the database store API may provide calls to manage the virtual persistent heap in the store. The calls may include, but are not limited to, calls to perform the following:

- [0032] Open the store
- [0033] Close the store
- [0034] Atomic read transaction (read a set of cache lines)
- [0035] Atomic write transaction (write a set of cache lines)
- [0036] Atomic delete transaction (delete a set of cache lines)
- [0037] Abort (stop a transaction)

Brief Description of the Drawings

[0038] Other objects and advantages of the invention will become apparent upon reading the following detailed description and upon reference to the accompanying drawings in which:

[0039] FIG. 1a is a block diagram illustrating a device with virtual persistent heap and persistent store space located on the device according to one embodiment of the invention;

[0040] FIG. 1b is a block diagram illustrating a device with virtual persistent heap and persistent store space located external to the device according to one embodiment of the invention;

[0041] FIG. 1c is a block diagram illustrating a device with virtual persistent heap on the device and persistent store space located external to the device according to one embodiment of the invention;

[0042] FIG. 1d is a block diagram illustrating a client device, proxy server, and server with persistent store space according to one embodiment of the invention;

[0043] FIG. 1e is a block diagram illustrating a virtual heap and leases to local and remote resources according to one embodiment of the invention;

[0044] FIG. 1f is a block diagram illustrating application virtual heaps and leases to system resources according to one embodiment of the invention;

[0045] FIG. 2 is a block diagram illustrating virtual persistent heap architecture according to one embodiment of the invention;

[0046] FIG. 3 is a state diagram illustrating the states of a page in a virtual persistent heap according to one embodiment of the invention;

[0047] FIG. 4 is a flowchart illustrating a computation method for the in-memory heap page addresses according to one embodiment of the invention;

[0048] FIG. 5a is a block diagram illustrating an application migration process with a stored state from a first process sent from a persistent store to a second process according to one embodiment of the invention;

[0049] FIG. 5b is a block diagram illustrating an application migration process with a persistent store for each process according to one embodiment of the invention;

[0050] FIG. 6 is a flowchart illustrating a method for migrating an application according to one embodiment of the invention;

[0051] FIG. 7 is a block diagram illustrating virtual persistent heap architecture using cache lines according to one embodiment of the invention;

[0052] FIG. 8 is a flowchart illustrating a computation method for the in-memory heap cache line addresses according to one embodiment of the invention;

[0053] FIG. 9 is a block diagram illustrating a device with virtual heap, object nursery and garbage collector according to one embodiment of the invention;

[0054] FIG. 10a is a flowchart illustrating garbage collecting a virtual heap according to one embodiment of the invention;

[0055] FIG. 10b is a flowchart illustrating the processing of a nursery region in a virtual heap according to one embodiment of the invention;

[0056] FIG. 10c is a flowchart illustrating garbage collection performed on one or more regions of a heap according to one embodiment of the invention;

[0057] FIG. 11a is a flowchart illustrating an atomic read transaction from a persistent store for a process;

[0058] FIG. 11b is a flowchart illustrating an atomic write transaction to a persistent store for a process; and

[0059] FIG. 11c is a flowchart illustrating an atomic delete transaction from a persistent store for a process.

[0060] Item numbers for objects in the Figures may be repeated in more than one Figure to signify objects that are substantially similar in the Figures.

[0061] While the invention is susceptible to various modifications and alternative forms, specific embodiments are shown by way of example in the drawings and are herein described in detail. It should be understood however, that drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the invention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.

Detailed Description of Several Embodiments

[0062] FIG. 1a—A device with virtual persistent heap on the device FIG. 1a illustrates an embodiment of a device 140 with virtual machine 101 and a virtual heap with persistence, referred to as a virtual persistent heap. In a virtual persistent heap, the entire heap may be made persistent. The virtual persistent heap may enable the checkpointing of the state of the computation of the virtual machine to a persistent storage such as a disk or flash device for future resumption of the computation at the point of the checkpoint. The Virtual Persistent Heap also may enable the migration of the virtual machine computation states from one machine to another. Both the data and computation state may be migrated. One embodiment may also provide for the suspension and resumption of an application, such as upon restarting a device after an intentional or unintentional shutdown of the device.

[0063] In FIG. 1a, device 140 includes a client 101 and memory 115. Client device 140 may be a computer platform with operating system, such as a PC or laptop computer running an operating system such as Microsoft Windows 9x/NT, or a consumer or appliance device, for example, a cell phone or PDA. Client device 140 may include a service provider client, for example, a Jini client (not shown) for finding and leasing services on remote servers on a network. Client 101 may be a virtual machine such as a JVM or KVM. Client 101 may be used for running applications, for example, Java applications. One or more applications may be running on client 101, with one application typically executing and one or more applications suspended. Application 104 is shown as a currently executing application.

[0064] Memory 115 may be integrated in or directly attached to client device 140. Memory 115 may be a volatile memory such as Direct Inline Memory Modules (DIMMs) or non-volatile storage device such as a flash memory, a hard disk, or removable disk such as a floppy disk. This embodiment may use persistent store space 120 in memory 115 to store the virtual heap 110 for application 104. Persistent store space 120 may also include virtual heaps (not shown) for one or more other suspended applications.

[0065] Device 140 may comprises an operating system capable of executing the software to enable a virtual machine such as a JVM or KVM. The operating system may include a virtual memory manager (VMM) for managing virtual memory on device 140. The VMM may enable applications such as a virtual machine running on the device 140 to appear to have more physical memory than is actually present on the system by enabling virtual memory. The VMM may utilize storage such as a disk drive to set up a swap area. Sections of memory may be cached into a cache area in the physical memory for faster access by an application running on the device 140. Sections of memory may be flushed to the swap area on the storage when not actively in use by an application or to make room in physical memory for other sections of memory that may be in more immediate demand for direct access by an application. The sections of memory in the virtual memory on the device may be referred to as the heap for the application. Thus, a virtual machine running on device 140 may run on a heap in the virtual memory on the device.

[0066] The virtual machine may execute in a portion of the memory space managed by the operating system on the device 140. In one embodiment, the memory space may be a virtual memory space managed by a VMM for the operating system. The virtual machine may comprise a virtual machine memory space for use by processes executing on the virtual machine. As used herein, “process” may refer to, but is not necessarily limited to: applications, applets, programs, tasks, subprocesses, threads, and drivers. The virtual machine memory space may be managed by a virtual machine virtual memory manager (VM VMM) as described herein. The VM VMM may allow processes executing on the virtual machine to use a virtual heap as described herein, and may also provide persistence for the virtual heap. The virtual heap may include an in-memory heap as described herein, which may reside in the virtual machine memory space. The virtual heap may also include a store heap as described herein. In one embodiment, the store heap may be resident in the virtual machine memory space. In another embodiment, the store heap may be resident in memory external to the virtual machine, such as on a storage device attached to the device 140 directly or via the Internet, but accessible using the VM VMM. The entire memory space, including the virtual machine memory space and the store heap, may be referred to as the virtual machine virtual memory space.

[0067] The VM VMM as described herein may allow applications to execute on a virtual machine on device 140 that would otherwise require too much virtual machine memory space, and thus would not execute, by providing a virtual machine virtual memory space and a virtual heap for the application. The VM VMM and virtual heap as described herein may also allow multiple applications to run on a virtual machine by providing a store heap for each application, and allowing an application to be suspended by flushing its in-memory heap to its store heap, and a second application to be resumed by loading its in-memory heap into the virtual machine memory space from its store heap.

[0068] As used herein, the definition of a heap may include an area of computer main storage (memory) that a process may use to store data in some variable amount that wont be known until the program is running. A heap may be reserved for data that is created at runtime, that is, when a program is executing. A heap may also include portions of code for the process. In one embodiment, the process may be a Java process, and the code may be in Java classes. For example, a program may accept different amounts of input from one or more users for processing and then do the processing on all the input data at once. The heap may be pre-allocated for the process to use. The process manages its allocated heap by requesting a portion of the heap when needed, returning the portions when no longer needed, and doing occasional “garbage collecting,” which makes portions of the heap available that are no longer being used and also may reorganize the available space in the heap to minimize fragmentation of the memory. In one embodiment, Java classes, including Java classes containing code for the process, may be garbage collected to remove classes (and thus process code) that are no longer in use. A heap may be portioned into blocks, sectors, pages, cache lines, or any other division of memory that meets the requirements of the heap management method.

[0069] A “stack” may be defined as an area of memory that may be used for data whose size can be determined when the program is compiled. A stack may be managed substantially similarly to a heap except that portions of the stack may be taken out of storage in a certain order and returned in the same way.

[0070] Client device 140 may also include volatile memory for loading and running client 101. Client 101 then may load and run applications in its memory space. In-memory heap 108 may be maintained in client 101 memory space, or alternatively may be maintained in memory external to client 101 memory space. In-memory heap 108 may include a portion of virtual heap 110 currently cached for use by application 104.

[0071] In-memory heap 108 and virtual heap 110 may be divided into one or more sections. The sections may be sectors, pages, cache lines, or any other division of memory space. In-memory heap 108 may be used by application 104 for storing data and code currently being used in the execution of application 104. In-memory heap 108 may include a portion or all of virtual heap 110. If application 104 requires code or data that is not currently in heap 108, one or more sections of virtual heap 110 may be copied into in-memory heap 108. If there is insufficient room in in-memory heap 108, one or more sections of in-memory heap 108 may be removed from heap 108 before copying in the new sections. If one or more sections being removed from heap 108 are “dirty” (have been written to), the one or more dirty sections may be written to (flushed to) virtual heap 110 before being removed from in-memory heap 108.

[0072] Application 104 may create new code and data in sections of in-memory heap 108. The new code and data in in-memory heap 108 may be flushed to virtual heap 110.

[0073] The in-memory heap 108 may include a portion of the virtual heap 110 that is cached (acts as physical memory) for use by application 104. In one embodiment, the virtual heap address space may be divided into fixed size pages. Page-in and page-out operations may be used to move pages from the virtual heap 110 in store 120 to the in-memory heap 108 or to eject pages from the heap 108. Pages, page states and page addressing are further illustrated in FIGS. 2, 3 and 4.

[0074] At certain times, a checkpoint for application 104 may be written to persistent store space 120. In this application, a checkpoint is a persistent store of the state of an application and its execution environment (such as the virtual machine state) at a point in time. After storing a checkpoint for application 104, persistent store space 120 may include an entire, up-to-date copy of the virtual heap 110. In one embodiment, persistent store space 120 may also contain an entire copy of the virtual heap for one or more other applications. In one embodiment, persistent store space 120 may include one or more versions of copies of the virtual heap (checkpointed states) for each application.

[0075] The virtual persistent heap may allow the running of an application on a physical heap 108 that is much smaller than may otherwise be required. As an example, the virtual persistent heap 110 may be an order of magnitude larger than the physical, in-memory heap 108. In one embodiment, the virtual persistent heap may be maintained on non-volatile memory storage external to the device running the application, and portions of the heap for the current execution state of the application may be cached in and out of a physical heap resident in local memory on the device. For example, the device may connect to a server on the Internet, and the server may provide non-volatile storage space for the virtual persistent heap. In another embodiment, the external storage for the virtual persistent heap may reside on a non-volatile storage attached to the device, for example, a Flash card or hard disk drive.

[0076] With persistence, an application may be checkpointed and suspended on a virtual machine, and a second application may then start execution on the virtual machine without ending the virtual machine process. This avoids the overhead of starting a new virtual machine for a new application. For example, a virtual machine may be launched on a system when one is required to run a first application. When a second application is launched, the web browser may not start a second virtual machine to run the second application, as is done in the prior art, but may instead checkpoint and suspend the first application, and then run the second application on the same virtual machine the first application was running on. The second application at some point may be checkpointed and suspended, and the first application may resume execution at the last checkpointed state prior to its suspension. In another example, a web browser may launch a virtual machine to run a first application. The web browser may keep the virtual machine active after the first application completes, and later use it to run a second application. In the prior art, terminating an application would have caused the virtual machine it was running on to terminate execution as well, requiring a new virtual machine to be launched for each application.

[0077] The virtual persistent heap may enable the saving of the entire state of the virtual machine heap for possible future resumption of the computation at the point the save was performed, and may permit the migration of the computation to a different system. In one embodiment, the saved state of the virtual machine heap may also provide the ability to restart the virtual machine after a system crash or shutdown to a previously saved persistent state. This persistent feature may be useful for small consumer and appliance devices including Java-enabled devices, such as cellular phones and Personal Digital Assistants (PDAs), as these appliances may be shutdown and restarted often. The virtual persistent heap may include the entire address space of the virtual machine heap an application is using.

[0078] Embodiments of the virtual persistent heap may include at least one of a caching method, a database store method, and a garbage collection method as described below.

FIG. 1b—A Device with Virtual Persistent Heap External to the Device

[0079] FIG. 1b illustrates an embodiment of the invention where a device 140 includes a client 101, and memory 117 external to the client stores the persistent store space 120 with virtual heap 110. Memory 117 may be on any device external to but coupled to client device 140. Examples of methods in which the devices may be coupled include, but are not limited to: wireless connection (cell phones, Wireless Access Protocol (WAP)), infrared (IrDA), Ethernet, Universal Serial Bus (USB), and phone/modem. The connection may be an Internet connection. Memory 117 may be a volatile memory such as Direct Inline Memory Modules (DIMMs) or non-volatile storage device such as a flash memory, a hard disk, or removable disk such as a floppy disk. This embodiment may use persistent store space 120 in memory 117 to store the virtual heap 110 for application 104. Persistent store space 120 may also include virtual heaps (not shown) for one or more other suspended applications on device 140. Persistent store space 120 may also include virtual heaps (not shown) for one or more applications running on devices other than device 140.

[0080] The architecture and operation of in-memory heap 108 and virtual heap 10 as illustrated in FIG. 1b may be substantially similar to that described in FIG. 1a. In the embodiment illustrated in FIG. 1b, caching, checkpointing, and other reads or writes to virtual heap 110 may be performed over an external interface such as a network connection, rather than being performed over an internal interface such as a memory bus as in the embodiment illustrated in FIG. 1a.

FIG. 1c—A Device with Virtual Persistent Heap Internal to the Device and a Persistent Store External to the Device

[0081] FIG. 1c illustrates an embodiment of the invention where a device 140 includes a client 101 and memory 115. Memory 115 may include virtual heap 110. This embodiment may also include a memory 117 external to the client. Memory 117 may include persistent store space 120 for holding checkpoints 111 of virtual heap 110. Memory 117 may be on any device external to but coupled to client device 140. Examples of methods in which the devices may be coupled include, but are not limited to: wireless connection (cell phones, Wireless Access Protocol (WAP)), infrared (IrDA), Ethernet, Universal Serial Bus (USB), and phone/modem. The connection may be an Internet connection. Alternatively, memory 117 may be integrated in or directly attached to device 140. Memory 117 may be a volatile memory such as one or more memory modules (for example, Direct Inline Memory Modules (DIMMs)), or a non-volatile storage device such as a flash memory, a hard disk, or removable disk such as a floppy disk. This embodiment may use persistent store space 120 in memory 117 to store the checkpoints 111 of virtual heap 110 for application 104. Persistent store space 120 may also include checkpoints of virtual heaps (not shown) for one or more other suspended applications on device 140. Persistent store space 120 may also include checkpoints of virtual heaps (not shown) for one or more applications running on devices other than device 140.

[0082] The architecture and operation of in-memory heap 108 and virtual heap 110 may be substantially similar to that described in FIG. 1a. Periodically, a checkpoint 111 of virtual heap 110 for application 104 may be written to persistent store space 120. After storing a checkpoint for application 104, persistent store space 120 may include an entire, up-to-date copy of the virtual heap 110. Persistent store space 120 may also include checkpointed copies of the virtual heap for one or more other applications.

[0083] Some embodiments may checkpoint one or more versions of virtual heap 110. For example, in the embodiment illustrated in FIG. 1c, multiple versions of checkpoint 111 for virtual heap 110 for application 104 may be stored in persistent store space 120. A method may be provided to select a checkpoint version from among one or more checkpointed version for resuming the application and/or virtual machine execution at a particular point.

FIG. 1d—A Client-Server System with Persistent Store Space

[0084] FIG. 1d is a block diagram illustrating a network including client system 100, gateway server 112, and server system 116 according to one embodiment of the invention. Server system 116 may include a service provider server 118, for example, a Jini or other network service connection system or compact service connection system server.

Jini™

[0085] Sun Microsystems' Jini is an example of a Network Service Connection System (NSCS) that may be used with networked devices to locate and lease resources, herein referred to as services, on networked systems including servers, and to pass information to and from the services located on the networked systems.

[0086] The Jini technology makes it possible for an application to discover and use local and remote services. A local service may be a service that is provided on the same device as the application. A remote service may be a service that is provided by a device other than the device the application is executing on. Furthermore, applications that use such local and remote services may obtain leases on the services. These leases may expire after a certain amount of time (or on demand). By modifying an application to use Jini when it accesses local and remote services (and to handle expiration and reactivation of a lease), the problem of maintaining the external state of a process during process migration may be addressed.

[0087] The Jini system federates computers and computing devices on a network into what appears to the user as a single system. Each Jini technology-enabled device preferably has some memory and processing power. Devices without processing power or memory may be connected to a Jini system, but those devices may be controlled by another piece of hardware and/or software, called a proxy, that presents the device to the Jini system and which itself contains both processing power and memory.

[0088] The Jini system is Sun Java technology-centered. The Jini architecture assumes that the Java programming language is the implementation language for components. The ability to dynamically download and run code is central to a number of the features of the Jini architecture. However, any programming language can be supported by a Jini system if it has a compiler that produces compliant bytecodes for the Java programming language.

Services

[0089] A service is an entity that can be used by a person, a program, or another service. A service may be a computation, storage, a communication channel to another user, a software filter, a hardware device, or another user. Services may be local or remote. A local service may be provided on the same device as the user of the service. A user of a service may be called a client, and the device client is accessing the service from may be called the client device. Thus, a client may access a service on the client device. A remote service may be provided on a device other than (external to) the client device. Examples of services include devices such as printers, displays, or disks: software such as applications or utilities; information such as databases and files: and users of the system, and translating from one word processor format to some other. Jini systems provide mechanisms for service construction, lookup, communication, and use in a distributed system. Services in a Jini system communicate with each other by using a service protocol, which is a set of interfaces written in the Java programming language.

[0090] Services may be found and resolved using a lookup service. The lookup service may be the central bootstrapping mechanism for the system and may provide a major point of contact between the system and users of the system. In precise terms, a lookup service maps interfaces indicating the functionality provided by a service to sets of objects that implement the service. In addition, descriptive entries associated with a service allow more fine-grained selection of services based on properties understandable to people.

[0091] A service is added to a lookup service by a pair of protocols called discovery and join; the service first locates an appropriate lookup service (by using the discovery protocol), and then it joins the lookup service (by using the join protocol).

Service Leasing

[0092] Access to many of the services in the Jini system environment is lease based. A lease is a grant of guaranteed access to a service over a period. A service may be a resource external to the virtual machine within which an application desiring a service is executing. A service may be a local service or a remote service. In Jini, a lease may be negotiated between the user of the service and the provider of the service as part of a service protocol: a service is requested for some period, and access is granted for some period, presumably considering the request period. If a lease is not renewed before it is freed—because the service is no longer needed, the client or network fails, or the lease is not permitted to be renewed—then both the user and the provider of the service may conclude the service can be freed. Leases may be exclusive or non-exclusive. Exclusive leases insure that no one else may take a lease on the service during the period of the lease; nonexclusive leases allow multiple users to share a service.

[0093] In one embodiment, an application may establish one or more leases to local and/or remote services external to the application. In one embodiment, an application may establish one or more leases to system code that give the application access to resources external to the application such as system resources. System code for accessing an external resource may be referred to as a system service. A lease on system code for accessing an external resource may be referred to as a leased system service. For example, an application may establish leases to a system services that give the application access to system drivers for accessing communications ports in the system.

[0094] In one embodiment, interactions between services and applications may be stateless. For example, each interaction request may be handled by the receiver using information included with the request.

Jini and JavaSpaces™

[0095] The JavaSpaces technology package provides a distributed persistence and object exchange mechanism for code written in the Java™ programming language. Objects are written in entries that provide a typed grouping of relevant fields. Clients can perform simple operations on a JavaSpaces server to write new entries, lookup existing entries, and remove entries from the space. Objects in JavaSpaces are stored in Java Serialization Format. Server JavaSpaces provide persistent object storage replacing traditional file system storage persistence models. JavaSpaces servers provide network service connection system clients such as Jini clients access to a persistent and shareable object store.

Network Service Connection System for Small Footprint Devices

[0096] A consumer or appliance device with a small amount of memory may be referred to as a “small footprint device.” A Compact Network Service Connection System (CNSCS) may be provided for use with small footprint network client devices (PDAs, cell phones, etc.) to locate and lease services on networked systems including servers, and to pass information to and from the located services and resources. The CNSCS may be designed specifically for use with small footprint network client devices that may be too “small” (not have enough resources such as memory) to support a system such as Jini. The CNSCS may be embodied as a self-contained message-passing system that may operate among similar small systems, and may be bridged to a complete Jini federation using a bridging server. Examples of such a CNSCS is described in U.S. Provisional Patent Application No. 60/208,011 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT”, filed May 26, 2000, which is hereby fully incorporated by reference in its entirety, and in U.S. Provisional Patent Application No. 60/209,430 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT”, filed Jun. 2, 2000, which is hereby fully incorporated by reference in its entirety, and in U.S. Provisional Patent Application No. 60/209,140 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT”, Jun. 2, 2000, which is hereby fully incorporated by reference in its entirety.

[0097] CNSCS clients are typically small footprint devices that may include small display screens and keyboards. CNSCS clients may be mobile or non-mobile devices. Examples of mobile CNSCS clients may include, but are not limited to: cell phones, palmtop computers, notebook computers, Personal Digital Assistants (PDAs), desktop computers, and printers. An example of a non-mobile CNSCS client may be a light switch comprising a simple chip capable of receiving a simple set of commands (on/off) and of transmitting a simple set of status messages (on/off status).

[0098] A CNSCS client may include core CNSCS software and one or more client applications. A CNSCS client may connect to a “fixed” network through a variety of paths. Examples of connection methods may include, but are not limited to: wireless connection (cell phones, Wireless Access Protocol (WAP)), infrared (IrDA), Ethernet, and phone/modem. CNSCS clients may connect to a network through gateways. The gateways provide the client devices with access to CNSCS servers on the network. A gateway may include a proxy CNSCS server. When connected, a CNSCS client “finds” a proximity network on which the client can run one or more applications from the network. A CNSCS client may also connect to a network to remotely access files on a server.

[0099] A mobile CNSCS client may send out broadcast messages using whatever physical interface it has (IRDA, WAP, proprietary connection, etc). All that is required of the device is that it can send and/or receive messages. Some devices may only have to receive messages. For example, a CNSCS capable light switch may only need to receive and act on messages (ON message, OFF message, or TOGGLE message). More sophisticated CNSCS clients may send out a message to join a CNSCS federation.

Message Capable Networking in CNSCS

[0100] A distributed computing facility can be built upon a messaging layer. Furthermore, a messaging layer (providing both reliable and unreliable messages) can be built upon the socket networking classes provided in an embedded Java platform. TCP, UDP, and IP are examples of message capable protocols that may be leveraged by CNSCS. Other more specialized protocols such as the Wireless Application Protocol (WAP) are also capable of supporting CNSCS messages. WAP is tuned for networks with high latency and low bandwidth. CNSCS messages also work well with other network drivers such as IrDA (Infrared Data Association) and Bluetooth beneath the transport. The only required portion of CNSCS for a device (above the basic networking protocol stack) is a thin messaging layer, and all additional facilities are optional.

CNSCS Spaces

[0101] A CNSCS Space may be smaller and simpler than a JavaSpace. Some CNSCS Spaces are transient, while others are persistent. Transient spaces may be used as rendezvous mechanisms for peer-to-peer communication (Palm Pilot IrDA, for example). Server CNSCS Spaces may provide persistent object storage, replacing traditional file system storage persistence models.

[0102] CNSCS Space servers provide CNSCS clients access to a persistent (and potentially shared) object store. In one embodiment of a CNSCS, the objects stored in a CNSCS Space (and sent in a message) may be represented in XML (eXtensible Markup Language). XML may be used as the means of representing objects because it is sufficiently rich, as well as being an Internet standard.

[0103] A persistent CNSCS Space is a directory containing XML representations of objects. Because XML is used to represent the space and its objects, Internet search facilities can be leveraged to find spaces and objects within those spaces and Java and non-Java objects created in C++ or any other object-oriented language may be stored and retrieved from a CNSCS Space or placed in a message.

[0104] XML object representations are language independent. In one embodiment, only an object's data is represented in XML, not its code. This means that Java and non-Java applications can send and receive objects from each other. Classes (with encapsulated bytecode) may be stored in a CNSCS Space or passed in a message.

[0105] XML class representations may not be supported in all platforms due to security and size constraints. In one embodiment, threads may be compiled into XML to enable virtual machine migration to a CNSCS Space. In this model, the CNSCS Space may be used as a persistent heap/virtual machine store.

[0106] A Java virtual machine understands the structure of a Java object, so in one embodiment, CNSCS may provide JVM extensions for compiling a Java object to XML, and for decompiling XML into a Java object. In some embodiments, the CNSCS may provide other extensions for compiling and decompiling other object types into XML or other messaging languages.

Space Searching

[0107] A CNSCS client may not need a browser. Instead, a search may be offloaded to a server that performs the actual search using a front-end proxy that parses the results for the client. Hence, CNSCS Space queues may be Internet document searches triggered by messages sent to a proxy.

CNSCS Leasing

[0108] As in Jini, access to many of the services in the CNSCS system environment may be lease based. A lease is a grant of access to a service. In one embodiment, an application may establish one or more leases to local and/or remote services external to the application. In one embodiment, an application may establish one or more leases to system code that give the application access to resources external to the application such as system resources. The leasing mechanism may allow clients to obtain leases for objects in a CNSCS Space. In one embodiment, the CNSCS leasing mechanism may use time-based leasing. In another embodiment, clients may make claims on Java objects, and register a callback method that may be invoked when another client desires a lease that is incompatible with current leaseholders. There may be several levels of CNSCS leases. A first level may not return a copy of the Java object when a lease is obtained, but simply registers an interest in this object being kept in the CNSCS Space. A second level does return a copy of the Java object when a lease is obtained at this level, but there could be multiple clients accessing the object. A third level does return a copy of the Java object when a lease is obtained at this level, and there are other clients are prohibited from accessing the object.

[0109] In one embodiment, interactions between processes and services provided through leases may be stateless. For example, each interaction request may be handled by the receiver using information included with the request.

[0110] Returning to FIG. 1d, service provider server 118 may include a persistent store space 120. Client system 100 may be a computer platform with operating system, such as a PC or laptop computer running Windows 9×/NT, or a virtual machine, for example, a JVM or KVM, sitting on top of a computer platform or executing on a consumer or appliance device, for example, a cell phone or PDA. Client system 100 may include a service provider client 102, for example, a Jini or CNSCS client, for finding and leasing services on remote servers. Client system 100 may be used for running applications and applets, for example, Java applications and applets. One or more applications may be executing on client system 100. Application 104 is shown as a currently executing application, and application 106 is shown as a suspended application. Application 104 may access an “in-memory” heap 108. Persistent store space 120 may include a virtual heap 110 for application 104. Persistent store space 120 may also include a virtual heap (not shown) for application 106.

[0111] Client system 100 may broadcast and receive messages using whatever physical I/O interface it has (IRDA, WAP, Ethernet, modem, proprietary connection, etc). Client system 100 may access services on one or more servers on the network including server 116. In one embodiment, the service provider client 102 may connect to servers on the network through gateway server 112. A gateway 112 may include a proxy service provider server 114. When connected, the service provider client 102 may find server 116 on which the client 102 may provide, via lease or otherwise, persistent store space 120 for virtual heap space for one or more applications including applications 104 and 106. Checkpoints for applications may be stored in persistent store space 120. Thus, persistent store space 120 may be a service that may be leased by an application using a service provider system such as Jini or CNSCS.

[0112] A lease may be established for a leasable service 125 on server 124. The lease may be established for application 104 by service provider client 102. Service provider 102 may establish the lease through service provider proxy server 114. In one embodiment, leases to services and/or resources on client device 100 may also be established.

[0113] The architecture and operation of in-memory heap 108 and virtual heap 110 as illustrated in FIG. 1d may be substantially similar to that described in FIG. 1a. In the embodiment illustrated in FIG. 1d, caching, checkpointing, and other reads or writes to virtual heap 110 may be performed over a network connection, for example, over the Internet, rather than being performed over an internal interface such as a memory bus as in the embodiment illustrated in FIG. 1a.

FIG. 1e—A Virtual Heap and Leases to Local and Remote Resources

[0114] FIG. 1e is a block diagram illustrating a virtual heap 148 for an application and leases to local and remote resources according to one embodiment of the invention. Virtual heap 148 may include one or more pages of application code and data 152. Virtual heap 148 may also include one or more pages of system code and data 154. Pages 152 may include a lease to a service 164 that may include information describing the lease relationship with a service 166. Service 166 may be a local or remote service. In one embodiment, the lease may be established using an NSCS such as Jini. In another embodiment, the lease may be established using a CNSCS.

[0115] Pages 152 may also include a lease to system code 156. In one embodiment, the lease may be established using an NSCS such as Jini. In another embodiment, the lease may be established using a CNSCS. The lease to system code 156 may give the application access to a system resource 162 by leasing native method 158. Native method 158 may be system code that invokes one or more system native code functions 160 for accessing system resource 162. For example, system resource 162 may be a bus port such as a USB port. Code 160 may be the native language driver for the USB port. Native method 158 may include the code necessary to invoke various functions provided by the native language USB driver.

[0116] In one embodiment, when the application is checkpointed, the system code and data pages 154 may not be checkpointed. When the application code and data pages 154 are checkpointed, service lease 164 and system resource lease 156 may be checkpointed. In one embodiment, the information checkpointed for a lease (system resource or service lease) may include enough information to re-establish the lease if necessary. In one embodiment, leases to system resources and services may be stateless—no record of previous interactions between the application and the service or resource may be kept, and each interaction request between the application and the service or resource may be handled based entirely on information that comes with it. Being stateless may simplify the checkpointing of the leases because no current or past state information needs to be checkpointed for the leases. If the application needs to be migrated to another device, or if the application is suspended for some reason, then the leases held by the application may be cancelled, releasing the services and/or resources held by the leases. When the application is resumed (locally or on another device), then the lease information from the checkpointed state of the application may be used to re-establish the leases to services and/or system resources.

[0117] In one embodiment, an application may migrate to a device with a different system and native language than the system and native language of the device from which it is migrating. In this embodiment, the lease to system resource 156 may be reestablished to a method 158 in the system code 154 of the device to which the application migrated. Native code functions 160 for accessing system resource 162 may be in the native code of the new device.

[0118] In one embodiment, the application may migrate to a device that does not have system resource 162. In this case, the application may be notified that the lease to the system resource cannot be re-established. In one embodiment, the application may migrate to a device that does not have access to service 166. In one embodiment, the application may be notified that the lease to the service cannot be re-established. In one embodiment, when it is discovered that service 166 is not available, an alternate service may be searched for to fulfill the functionality of service 166, and, if found, a lease may be established to the alternate service.

FIG. 1f—A Virtual Heap and Leases to System Resources

[0119] FIG. 1f is a block diagram illustrating a virtual heap 148a and 148b for two applications with leases to system resources 162a and 162b according to one embodiment of the invention. In this embodiment, a heap 164 external to virtual heaps 148a and 148b may be used to store system code and data that may be shared among two or more applications.

[0120] Virtual heaps 148a and 148b may each include one or more pages of application code and data 152a and 152b. Pages 152a and 152b may include leases to system code 156a and 156b that may give the application access to system resources 162a and 162b respectively by leasing shared native methods 158a and 158b. Native methods 158a and 158b may include system code that may invoke one or more native code functions 160 for accessing system resources 162a and 162b.

[0121] Some system resources may be shareable and others may require exclusive access privileges. In one embodiment, if a native method in heap 154 allows shared access, two or more applications may hold leases to the same native method, and thus the same system resource, simultaneously.

FIG. 2—Virtual Persistent Heap Architecture

[0122] FIG. 2 is a block diagram illustrating a virtual persistent heap architecture according to one embodiment of the invention. Application 104 may be executing in client system 100. Application 104 may be using in-memory heap 108.

[0123] Persistent store 120 may reside on a server on the network to which client system 100 has access, or alternatively may be located in a local non-volatile memory on the system application 104 is executing on. Page table 122 may reside on the same system as application 104 or alternatively may reside on another system on the network.

[0124] The persistent store 120 may include an entire copy of the virtual heap 110 (virtual memory) for application 104. The “in-memory” heap 108 may include a portion of the virtual heap 110 that is cached (acts as physical memory). In one embodiment, the virtual persistent heap is a page-based heap. The virtual heap address space is divided into fixed size pages. Page-in and page-out operations are used to move pages from the persistent store 120 to the in-memory heap 108 and to eject pages from the in-memory heap 108.

[0125] In this application, the terms “physical heap” or “heap” may be used to indicate the heap structure in memory 108. This is only a portion of the total virtual heap 110 saved in the persistent store 120. The term “virtual heap” may be used to indicate the entire heap image saved in the store 120. The “in memory” heap address space may be viewed as the physical memory. The “in store” heap address space may be viewed as the virtual memory.

[0126] The store 120 may be segmented into two or more disjoint virtual heaps. Each checkpointed application such as application 104 has its own virtual heap space reserved in the store. In exemplary persistent store 120, a virtual heap space exists for application 106 and application 104, and two unused virtual heap spaces exist to allow for two more applications.

[0127] Paging provides a simple model to move data from the persistent store 120 to the in-memory heap 108 in virtual machine 100. In one embodiment, a page table 122 and offset based address translation may be used to convert virtual heap 110 references into in-memory heap 108 references. Relatively small pages may be used to reduce heap waste. In one embodiment, a paging-based approach may enable page protection mechanisms and support for DMA and block I/O devices.

[0128] In one embodiment, object-caching granularity may be implemented instead of paging. Object-caching granularity is possible if objects can efficiently be moved in the heap. A consideration in embodiments using object handles is the memory footprint constraint. The object handle area may take more memory space than related structures such as handle tables in embodiments using pages.

[0129] Using page handles rather than object handles may give the ability to tune the implementation to fit the memory footprint requirement of a targeted device. The page size determines the amount of space required for the handle table. Larger memory environments may use smaller pages. Smaller memory environments may need to use larger pages. Larger objects may be broken up and stored across multiple pages, allowing portions of objects to be cached in an out of the in-memory heap 108. This may allow devices with limited memory resources to support objects, and therefore applications, that may not be supportable with object caching granularity. With object caching granularity, the entire object may have to be cached into in-memory heap 108.

[0130] One embodiment may use a page-in and page-out approach to bring pages from the virtual heap 110 into the in-memory heap 108. For embodiments in which persistent store 120 is comprised in a flash memory device, paging-out may use a scatter/gather object phase to only write updated objects to increase the life of the flash device. In one embodiment, this may be combined with a log-based approach to guarantee atomicity on store transactions.

[0131] In a paging-based system; the page size may be increased to reduce the page table 122 size. Increasing the page size may permit the grouping of multiple objects into a single page. In this case, a single page table entry may play the role of multiple object handle entries (one handle for each object in the page). Grouping objects into a single table entry may allow the reduction of the memory footprint required for a handle table, as there may be fewer handles. Updating a single object in the page may require the writing of the entire page (all objects in the page). Alternatively, reducing the page size allows fewer objects to be stored in a page, thus reducing paging granularity. This approach may increase the page table size. The page size may be adjusted accordingly based upon memory constraints on the device on which the paging-based system is implemented.

[0132] In one embodiment, the virtual heap 110 may be divided into a fixed number of pages. In one embodiment, to aid in efficient address translation, the application virtual heap size (i.e. the Kernel plus all user pages) may be a fixed multiple of the size of the in-memory heap 108. This allows each application virtual heap store to start at a multiple heap size offset in the persistent store 120. In this embodiment, the address translation includes subtracting a fixed heap size multiple. Since a virtual machine may not have access to a hardware translation mechanism, the address translation may be simplified so it can be efficiently performed in software.

[0133] An offset based schema may be used to convert a virtual heap address into an in-memory heap address. All object references in the virtual heap 110 and the in-memory heap 108 may be kept as virtual heap addresses. In one embodiment, there may be an address translation to convert the virtual heap address into the physical heap location. The CPU of the system or CPU layer of the virtual machine may perform address translation from the virtual heap address space into the in-memory heap location via a Page Table 122 entry. The Page table 122 maintains the mapping of the virtual heap 110 page into the heap 108. For each virtual heap 110 address reference (read or write), code may be inserted (read/write barriers) to verify the validity of the address (i.e. check if the corresponding page is resident in the heap), and to translate it into the in-memory heap 108 reference. The process of converting heap addresses is illustrated in FIG. 4.

[0134] In some embodiments, the virtual machine CPU layer, for example, the Java CPU layer, may provide access to hardware Memory Management Unit (MMU) address translation functions, allowing object handle in directions to be done in hardware.

[0135] In one embodiment, an object in the virtual address space may maintain references to other objects via a valid or invalid address. A valid address may mean the corresponding page is resident in the in-memory heap 108. An invalid address may mean the corresponding page is not resident in the in-memory heap 108.

Page Table 122

[0136] In one embodiment, page table 122 is not persistent, but is a “live” structure. The page table may be reinitialized whenever a new application is restarted. In one embodiment, the page table 122 may include one or more of the following entries for a page of the active application virtual heap 110:

- [0137] Type (User or System): The page type is used to select the write through policy used to backup the page into the persistent store 120 as well as the paging policy (which page to eject). As an example, System pages may be pinned in the in-memory heap 108 and may not be paged out.
- [0138] Resident (TRUE or FALSE): In one embodiment, the resident bit may be used to maintain the heap residency state of the page, and may be TRUE if the page is resident in heap 108 or FALSE if the page is not resident in heap 108. In another embodiment, a value stored in a heap page ID field may be used to indicate if a page is resident in the heap. For instance, if a memory address is used to indicate the heap page ID, a NULL address or other invalid address may be used to indicate if the page is resident. In yet another embodiment, only pages that are currently cached in in-memory heap 108 may have an entry (row) in page table 122.
- [0139] Dirty (TRUE or FALSE): Keeps track of any write or modification of the page in heap 108. TRUE if the page is dirty (has been modified or written to).
- [0140] Flushing (TRUE or FALSE): Only valid for dirty pages. Indicates the page is in the checkpoint queue. If TRUE, the page is in the list of pages that are to be flushed to the virtual heap 110 in store 120.
- [0141] Heap Page ID: Specifies the location of the page in the heap 108.

[0142] In one embodiment, as shown in FIG. 2, there may be one entry in the page table 122 for each page of the active application virtual heap 110. This embodiment may simplify the location of an entry for a page in the page table 122. In another embodiment, there may be one entry in the page table for each page currently cached in in-memory heap 108. This embodiment may reduce the size of the page table 122.

[0143] Read-only/static core virtual machine objects may be located into pinned and read-only system pages (objects may be tagged by the primary class loader). These classes are typically not loaded twice. Read/write core virtual machine objects may be located into user pages. In one embodiment, read/write core virtual machine objects may be “colored” as system pages. All user objects may be allocated in user pages.

[0144] In one embodiment, an application may establish one or more leases to system objects that may give the application access to resources external to the application such as system resources. In one embodiment, system pages in a heap may include system objects (code and/or data) that are currently leased. In one embodiment, the leases for the system objects may be contained in the application virtual heap 110.

[0145] In embodiments that allow the running of only one application at a time, each application virtual heap may contain its own set of system pages. In these embodiments, system pages are not shared among applications. In embodiments running more than one application at a time, system pages may be shared among applications. These embodiments may have a system segment in the persistent store 120 to checkpoint static and read-only pages that can safely be shared among applications.

FIG. 3—The States of a Page in a Virtual Persistent Heap

[0146] FIG. 3 is a state diagram illustrating the states of a page in a virtual persistent heap according to one embodiment of the invention. A page may be in one of the following states:

- [0147] Empty: The page has been freed or has not been allocated.
- [0148] Resident: The page has been newly allocated or the page has been paged in from the virtual heap 110 in persistent store 120 to the in-memory heap 108. No changes have been made to the page, or the latest changes have been flushed to the persistent store 120. The copy in the heap 108 is synchronized with the copy in the store 120.
- [0149] Dirty: A write to the page has been performed and the page has not been written back to the persistent store 120. No request for checkpointing the page has been made.
- [0150] Waiting to be checkpointed: The page is in a list of pages to be checkpointed to the store 120. The page is currently write locked, so no further write can occur until the page has been flushed.
- [0151] Persistent: The page has been paged out. The page is no longer resident in the heap 108.
  Page Fault

[0152] A page fault occurs when a reference is made to a page not resident in the in-memory heap 108. The page fault may induce a caching of the page from the virtual heap 110 in store 120 to the heap 108. When a page fault occurs, the following conditions may be encountered:

- [0153] There is a free page available in the heap 108: The page may be brought into the heap 108 and the page table 122 entry updated.
- [0154] There are no free pages in the heap 108: Before the page can be cached, room needs to be made in the heap. One or more resident pages need to be evicted from heap 108.

[0155] In one embodiment, when looking for candidate pages to be evicted, more than one page may be selected for eviction, since it is likely that another page may need to be evicted soon. In one embodiment, a free page threshold may be used to induce this behavior. In one embodiment, a standard LRU (Last Recently Used) method may be used to select pages for eviction (page out). In other embodiments, other methods, for example, Least Frequently Used (LFU), may be used to select pages for eviction.

[0156] If a page is dirty, the page may be checkpointed to the store 120, or alternatively a shadow copy is made, before being freed from the heap 108. In one embodiment, non-dirty pages may be evicted before dirty pages.

Page Checkpointing

[0157] As previously described, pages may be brought into the heap 108, modified and checkpointed to the virtual heap 110 in store 120 when they are evicted. In one embodiment, pages may be checkpointed when there are evicted. Alternatively, pages may be checkpointed when they remain in the heap 108. For instance, if checkpointing can be performed asynchronously (an executing thread does not have to be frozen), then pages may be checkpointed whenever convenient with minimum overhead to look for dirty pages.

[0158] In embodiments with a single threaded virtual machine environment using a simple bytecode count as a time sharing quantum for switching between threads, pages to be checkpointed may be searched for whenever a thread synchronization or a context switch occurs. On a thread context switch, dirty pages may be scanned for and placed in a checkpoint queue. In another embodiment, a mechanism to interrupt the running thread may be used to provide an opportunity to search for and checkpoint pages.

[0159] The flush bit in the Page Table 122 may be used to mark pages that are in the checkpoint queue. Further writes may be prevented to the page while the page is in the queue or in the process of being checkpointed. In one embodiment, the thread may be blocked until the page is written. In this embodiment, the checkpoint queue may be reordered to prioritize pages that have a blocked thread. In another embodiment, a copy of the page may be made to let the thread “go” on the shadow copy. A recently checkpointed page may not be put back into the checkpoint queue right away.

[0160] System pages may have a different checkpoint strategy than user pages. For instance, checkpointing system pages may freeze the entire virtual machine. System pages may therefore be more selectively checkpointed than user pages.

Store Checkpoints and Consistency

[0161] Having pages checkpointed individually may be insufficient to maintain the consistency of the virtual heap 110 in store 120. For instance, if two pages have changed in the heap 108, but only one page has been checkpointed, and the system crashes, the checkpointed virtual heap 110 in store 120 may end up in an inconsistent state. When the system restarts with an inconsistent store 120, the application may crash due to incorrect pointer locations. There is no guarantee that pages put in the checkpoint queue will be checkpointed to the store 120 (the system may crash at any time). In one embodiment, in order to capture a consistent virtual machine state, the set of changes made to the store 120 may be combined into an atomic operation. An atomic operation is an operation may comprise a series of steps that are not finalized until all of the steps in the atomic operation are confirmed to have successfully completed. The atomic operation allows all of the steps in the operation to be undone if any of the steps in the operation do not complete successfully. The process of undoing all of the steps in an atomic operation may be referred to as “rolling back” the operation. In the example above, if one of a series of two or more checkpoints in a checkpoint queue are not completed when recovering a crashed system, the system may be “rolled back” to a previous checkpointed state.

[0162] In one embodiment, a transaction-based API to allow the client system 100 to issue checkpoint requests may be provided. Using the API, the client system 100 may tell the store:

- [0163] when a new transaction starts
- [0164] what heap pages need to be saved
- [0165] when the transaction is committed
  A store checkpoint may have one or more of following states which may be made permanent to the store:
- [0166] Saved all dirty user pages since the last checkpoint.
- [0167] Saved all dirty system pages since the last checkpoint.
- [0168] Save the current state of non-heap (for example, virtual machine) internal structures (thread contexts, pointer to main structure in the heap such as classes, constant pool, etc.).

[0169] In one embodiment, the client system 100 may have only one outstanding store transaction at a time. Each successive store checkpoint may be encapsulated in a different-transaction. When a store checkpoint is issued, client system 100 execution may need to be stopped for as short a time as possible in order to save non-heap virtual machine structures.

[0170] One embodiment may provide for pre-flushing of dirty pages by allowing dirty pages to be checkpointed independently of the store checkpoint. Thus, when a store checkpoint is issued, all heap 108 pages may have already been saved (pre-flushed) into store 120. Thus, the only structures that may need to be stored are a few dirty system pages and the virtual machine non-heap structures. In one embodiment, the store may verify that all states have been correctly written to the store 120 when the checkpoint transaction is committed. If one or more writes failed or did not complete, the store may abort the transaction and roll back to the last committed checkpoint. In one embodiment, if the checkpoint fails, but client system 100 is still running, the client system 100 may continue to run under restrictions, such as no more paging allowed, and also warning the user that the store has been lost. In another embodiment, the client system 100 may be stopped when the checkpoint fails. In one embodiment, an application level checkpointing API may be provided to inform the application 104 that the checkpointing failed.

[0171] The client system 100 may verify that any heap or non-heap changes are correctly recorded as part of the store transaction. The store may verify that all changes have been made persistent (written to non-volatile storage such as disk or flash memory) and the store is left in a consistent state.

[0172] The client system 100 may rely on the store to guarantee transaction ACID properties. ACID is the acronym used to describe the following properties of a transaction:

- [0173] ATOMICITY: a transaction should be done or undone completely. In the event of a failure, all operations and procedures should be undone, and all data should roll back to its previous state.
- [0174] CONSISTENCY: a transaction should transform a system from one consistent state to another consistent state.
- [0175] ISOLATION: each transaction should happen independently of other transactions occurring at the same time.
- [0176] DURABILITY: Completed transactions should remain permanent, even during system failure.

[0177] In one embodiment, the store may only maintain one checkpoint per application (the last successfully committed checkpoint). In another embodiment, the store may maintain one or more checkpoints per application, and the client system 100 may select which checkpoint to use when restarting an application.

[0178] Since each application store is kept in a different persistent store 120 virtual heap segment, the current application heap segment may be “touched” for a checkpoint, while other application segments are untouched.

[0179] In one embodiment, a store management User Interface (UI) may be provided, and may allow the removal of an application's corrupted virtual heap.

When to Commit a Store Checkpoint?

[0180] In one embodiment, in order to keep the heap 108 and client system 100 states very closely synchronized with the store 120, a store checkpoint may be issued any time a change is made. This embodiment may not be practical due to the high incidence of store checkpointing that may degrade performance. To avoid performance degradation, the heap 108 and client system 100 state may be loosely synchronized with the store 120 state, and store checkpoints may only be issued under certain conditions. The following are examples of conditions that may be used in deciding when to issue a store checkpoint:

- [0181] Since the client system 100 may be interrupted to commit a store checkpoint, a time may be selected to perform the checkpoint that may generate the least amount of overhead. Fir example, when a client system performs a thread switching or synchronization, a check may be made to see if a checkpoint needs to be performed. Checkpointing may be performed asynchronously, so the overhead may be defined in terms of issuing the request, not executing the request.
- [0182] The number of pages written since the last committed checkpoint may be considered. If many pages were updated, the changes may be committed as soon as possible.
- [0183] The speed at which a transaction checkpoint can be performed to the store may be considered. If store operations are slow, the number of checkpoints may have to be limited. Buffering may not be an option in a tight memory environment.
- [0184] A checkpoint may be performed after a garbage collection, since many pages may have changed due to object collections and heap compacting.
- [0185] How long since the last checkpoint occurred may be considered. For instance, an application may be compute-intensive and touch a very small number of pages. To save the computation state, a checkpoint may be induced after a maximum elapsed time, if none of the previous conditions occurred.
- [0186] Whenever the application is suspended, and client system 100 is in the process of switching to a new application, a checkpoint may be committed for the suspended application.
  FIG. 4—A Computation Method for the In-Memory Heap Page Addresses

[0187] FIG. 4 is a flowchart describing a computation method for in-memory heap page addresses according to one embodiment of the invention. In one embodiment, the translation of a virtual heap page reference to an in-memory heap page reference may include the following steps. In step 300, the store page ID may be determined. An example of a method for determining the store page ID is:

- [0188] PageID=Sadd−(AppID*HS)<<PageS
- [0189] Sadd: The virtual heap page reference address to be translated.
- [0190] AppID: The current application ID used to select the store virtual heap. For example, in FIG. 2, application 104 may have an application ID of 1.
- [0191] HS: The virtual heap size (may be a multiple of the in-memory heap size)
- [0192] <<: shift operator (may be left or right shift depending on bit order representation in the system)
- [0193] PageS: Page size bit shift

[0194] In step 300, first, the application ID may be multiplied by the virtual heap size to get the base address of the virtual heap for the application. Second, the base address of the virtual heap may be subtracted from the virtual heap page reference address to produce an address offset from the base address. Third, the address offset may be shifted to remove the bits containing the in-page address information. For example, if a page comprises 256 addressable bytes, the address may be shifted 8 bits. In one embodiment, the result of the shift is the page ID for the virtual heap page reference.

In step 302, the location of the page in the heap may be determined from the page table:

- [0195] HeapPageID=PageTable (PageID)
  For example, referring again to FIG. 2, if the result of step 300 is virtual heap page 4, looking up the virtual heap page 4 row in page table 122 produces a heap page ID of 1.

[0196] If the page is not resident, a page fault may be issued to bring the page into the heap. In step 304, the in-memory heap address may be computed. An example of a method for computing the in-memory heap address is:

- [0197] Hadd=HeapPageID*PageS+Sadd & PageMask
- [0198] PageS: Page size
- [0199] Sadd: The original virtual heap page reference address
- [0200] PageMask: Page Size bit mask
- [0201] &: Bitwise AND operator

[0202] First, the heap page ID produced in step 302 may be multiplied by the page size to produce the base address of the in-memory heap page. The original virtual heap page reference address may then be ANDed with a page size bit mask to produce the bits containing the in-page address information. The in-page address information may then be added to the base address of the in-memory heap page to produce the in-memory heap address.

FIGS. 5a and 5b—Application Migration

[0203] The embodiments of an application migration processes as illustrated in FIGS. 5a and 5b, and other embodiments not illustrated, may provide for migrating Java applications from one machine to another on a network or between devices when at least one of the devices may not be connected to a network. In other embodiments, non-pure Java applications and/or non-Java applications from one machine to another on a network or between devices when at least one of the devices may not be connected to a network. In order to handle the problem of migrating the external state of an application, migratable applications may use a Network Service Connection System such as Jini or a Compact Network Service Connection System (CNSCS) for accessing resources external to the applications, referred to as services. Services may be local (on the device within which the application is running) or remote (on other devices connected to the device via the network). Local services may include system resources on the device within which to the application is running. These local or remote services may be leased by an application using an NSCS or CNSCS. Thus, in one embodiment, the external state of the application may be represented by one or more leases to local and/or remote services, including system resources. Other embodiments may use other methods for accessing external resources that allow for the preservation of external state during migration.

[0204] In one embodiment, each application on a system is separated from other applications, and is thus migratable separately from other applications. In one embodiment, each application on a system may have an in-memory heap serving as “physical” memory that is being used for the current execution of the application, a virtual heap that may include the entire heap of the application including at least a portion of the runtime environment of the virtual machine, and a persistent heap or store where the virtual heap may be checkpointed. In one embodiment, the virtual heap and the persistent heap may be combined in one memory (the virtual heap may serve as the persistent heap). In another embodiment, the virtual heap may be checkpointed to a separate, distinct persistent heap. The combination of the in-memory heap, the virtual heap, and the persistent store may be referred to as the “virtual persistent heap.” In yet another embodiment, there may be sufficient memory available for the in-memory heap so that a virtual heap is not required to run the application; in this embodiment, only an in-memory heap and a persistent heap on the store may be present for an application.

One embodiment of a method for migrating an application may include.

- [0205] Checkpointing the application to its persistent heap. In addition, any current leases to external services and or resources may be expired.
- [0206] Packaging the persistent state of the application in the persistent heap and sending the persistent heap for the application to the node where the application is to migrate. In one embodiment, a transaction mechanism is used, where the application's entire persistent state may be copied atomically as a “transaction” and committed as having migrated on both the sending and receiving nodes.
- [0207] Reconstituting the state of the application into a new persistent heap (may be a virtual persistent heap) on the node where the application migrated.
- [0208] Re-establishing leases to external services and/or resources for the application.

[0209] The application resuming execution in the persistent heap on the node where it migrated.

[0210] In one embodiment, since processes that migrate away from a node may migrate back after minor state changes on the node where they migrated (e.g. updated a page of a document), a versioning mechanism may be used whereby nodes where an application once lived may cache a previous state, and thus may avoid sending over the network a state that hasn't changed.

[0211] Information on the current leases for the application may also be packaged and sent to the new node where the application is to migrate. The information may be used in reestablishing the leases on the new node. In one embodiment, the lease information may be maintained in a gate structure. Example of gate structures for a CNSCS is described in U.S. Provisional Patent Application No. 60/208,011 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT” filed May 26, 2000, which was previously fully incorporated reference in its entirety, and in U.S. Provisional Patent Application No. 60/209,430 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT”, filed Jun. 2, 2000, which was previously fully incorporated by reference in its entirety, and in U.S. Provisional Patent Application No. 60/209,140 to Slaughter, Saulpaugh, Traversat, Abdelaziz, Duigou, Joy, and Pouyoul, titled “DISTRIBUTED COMPUTING ENVIRONMENT”, filed Jun. 2, 2000, which was previously fully incorporated by reference in its entirety.

[0212] In addition, a user interface (UI) may be provided to manage application checkpoints. Functions the UI may allow the user to perform may include, but are not limited to, the following;

- [0213] Browse the store.
- [0214] Select an application checkpoint to restart
- [0215] Suspend the current application.
- [0216] Remove an application checkpoint.

[0217] FIG. 5a is a block diagram illustrating an embodiment of an application migration process where the original application 104a and the migrated application 104b may use the same virtual heap 110 in persistent store 120. In FIG. 5a, the in-memory heap 108 for application 104a executing on client system 100 is checkpointed to persistent store 120. The checkpointing may be performed as an atomic transaction. The store checkpoint may include one or mom of the following states that may be made permanent to the store;

- [0218] All dirty user pages since the beginning of the transaction.
- [0219] All dirty system pages since the beginning of the transaction.
- [0220] The current state of non-heap (for example, virtual machine) internal structures (thread contexts, pointer to main structure in the heap such as classes, constant pool, etc.).

[0221] Any current leases to external services (for example, services leased via an NSCS such as Jini or a CNSCS) may be expired. In one embodiment, expiration of current leases may be required prior to migration. In one embodiment expiration of current leases is not required before checkpointing the application.

[0222] The checkpointed persistent state of the application 104 stored in persistent store 120, including user pages, system pages, and the current state of non-heap structures, is packaged and sent to the client system 130 where the application 104a is to migrate. In this step, a transaction mechanism may be used, where a process's entire persistent state is copied atomically and committed as having migrated on both the sending and receiving client systems. In one embodiment, since processes that migrate away from a client system may be expected to migrate back after only relatively minor state change on the client system where they migrated (e.g. updated a page of a document), a versioning mechanism may be used whereby nodes on which an application once lived may cache previous states and avoid sending over the network a state that hasn't changed.

[0223] The packaged and sent state is received and reconstituted on client system 130, and application 104b resumes running on the new client system. A new in-memory heap 108b may be allocated for application 104b including the checkpointed user and system pages. The current state of non-heap structures on client system 130 may be set from the received checkpointed state. Required leases of services may be reestablished for the application. The application 104b then may resume running in the heap 108b on the client system 130 where it migrated. Application 104b may continue to use persistent store 120 for its virtual heap or may establish a new virtual heap in another persistent store on client system 130 or on another server providing persistent store space on the network.

[0224] FIG. 5b illustrates an embodiment where client 100 comprises a persistent store 120a used by application 104a to store virtual heap 110a. When migrating application 104a to client 130, a checkpointed state of application 104a may be sent to client 130. On client 130, a new virtual heap 104b may be established in persistent store 120b, a new in-memory heap 108b may be established, and application 104b may resume executing on client 130 from the checkpointed state of application 104a.

FIG. 6—A Method for Migrating an Application

[0225] FIG. 6 is a flowchart describing a method for migrating processes, including applications, from one client system to another according to one embodiment of the invention. Client systems may be “real” systems such as Windows 9×/NT systems or virtual machines such as Java Virtual Machines running on top of other systems. In one embodiment, each application may be independent from other applications on the system, and thus may be migratable separately from other applications. In one embodiment, each application on a particular client system will have an in-memory heap where it executes and a persistent heap where it can be checkpointed before being migrated.

[0226] In step 320, application 104 executing on client system 100 is checkpointed to its persistent heap 110 in persistent store 120. The store checkpoint may include one or more of the following states that may be made permanent to the store:

- [0227] All dirty user pages since the beginning of the transaction.
- [0228] All dirty system pages since the beginning of the transaction.
- [0229] The current state of non-heap (for example, virtual machine) internal structures (thread contexts, pointer to main structure in the heap such as classes, constant pool, etc.).

[0230] A “user page” includes application-specific data or executable code. A “system” page includes operating system and/or virtual machine data or executable code that is not application-specific.

[0231] In step 322, current leases to services (for example, services leased via an NSCS such as Jini or a CNSCS) may be expired on client system 100. In one embodiment, all current leases must be expired before migration.

[0232] In step 324, the most recently checkpointed persistent state of the application 104 in persistent heap 120 is packaged and sent to the client system 130 where the application 104 is to migrate. In step 326, the packaged checkpointed state of application 104 is received on the client system 130. In one embodiment, a transaction mechanism may be used, where a process's entire persistent state is copied atomically and committed as having migrated on both the sending and receiving client systems in step 328.

[0233] In step 330, the received packaged state is reconstituted on the client system 130 where the application 104 is migrating. Required leases of local and/or remote services may be re-established for the application 104 in step 332. In one embodiment, one or more of the leases expired in step 322 maybe re-established. In one embodiment, the received packaged state include information describing the one or more leases expired in step 322, and this information on the leases may be used in step 332 in re-establishing the leases. In one embodiment, the re-established leases may include leases to system resources on the device to which the application is migrating. In step 334, the application 104 then may resume running using heap 108 on the client system 130 where it migrated. The migrated application 104 may continue to use the virtual heap 110 that was used by application 104 on client system 100 prior to migration, as illustrated in FIG. 5a. Alternatively, a new virtual heap 110 may be established for application 104 on client system 130, as illustrated in FIG. 5b.

FIG. 7—Virtual Persistent Heap Architecture Using Cache Lines

[0234] A feature of the virtual persistent heap is the method used to cache portions of the virtual persistent heap into the “physical”, in-memory heap. The virtual persistent heap may include a caching mechanism that is effective with small consumer and appliance devices that typically have a small amount of memory and that may be using flash devices as persistent storage. The caching strategy may achieve a lesser amount of caching and may improve locality among elements of the virtual persistent heap that are cached in the physical heap, thus reducing caching overhead. FIGS. 2 through 5 illustrate embodiments that use a “page” as a level of granularity for the virtual persistent heap caching mechanism.

[0235] FIG. 7 is a block diagram illustrating an embodiment of a virtual persistent heap architecture substantially similar to the embodiment illustrated in FIG. 2. Application 104 may be executing in client system 100. Application 104 may be using in-memory heap 108. Persistent store 120 may reside on a server on the network to which client system 100 has access, or alternatively may be located in a local non-volatile memory on the system that application 104 is executing on. Cache table 122 may reside on the same system as application 104 or alternatively may reside on another system on the network.

[0236] The embodiment illustrated in FIG. 7 includes a caching mechanism in which the virtual persistent heap is divided into cache lines. A cache line is the smallest amount of virtual persistent heap space that can be loaded or flushed at one time. Caching in and caching out operations are used to load cache lines into the heap or to flush dirty cache lines into the store. In general, the definition of a “page” as used in FIGS. 2 through 5 includes a cache line. In other words, a cache line is a size of page. In other embodiments, object granularity may be used in a virtual persistent heap. In these embodiments, caching in and caching out operations may be performed on objects that may be created by the application.

[0237] A level of object locality in a cache line may be achieved to reduce heap waste by is the use of object caching nurseries and a generational garbage collector as described below. Different cache line sizes may be used for different regions of the heap. Cache lines may provide a natural path for porting the virtual persistent heap to cache based Memory Management Unit (MMU) architectures, and may allow address translation from the virtual persistent heap to the heap to be performed in hardware.

[0238] In one embodiment, all heap references may be kept in one address space (the virtual persistent heap address space). The address translation is therefore simplified, and may require no “swizzling” of virtual references into in-memory heap references when manipulating objects in the heap. In one embodiment, having a single address space may allow a single garbage collector to run on the virtual persistent heap space. If a single address space is not used, two or more garbage collectors, may be required, for example, one running on the virtual persistent heap and one running on the in-memory heap.

[0239] The term “virtual persistent heap” may be used to refer to the entire virtual heap image saved in the persistent store. The terms in-memory heap or heap may be used to refer to the portion of virtual heap currently cached in memory. The term cache line may be used to refer to the smallest caching-in and caching-out granularity. A cache line corresponds to the smallest amount of data that can be loaded or flushed from the in-memory heap at one time. The in-memory heap and the virtual persistent heap may be divided into fixed size cache lines, or alternatively the heaps may be divided into groups of cache lines with differing cache line sizes. The virtual persistent heap size may be a multiple of the maximum in-memory heap size, and an offset-based schema, such as that illustrated in FIG. 4, may be used to convert virtual persistent heap addresses into in-memory heap addresses.

[0240] In one embodiment, references in the virtual persistent heap and the in-memory heap structure may be kept as virtual persistent heap addresses. There may be no updates to physical heap references when heap references are manipulated. The address translation from the virtual persistent heap address space to the in-memory heap location may be done using a cache table entry.

[0241] In a cache line based system, the cache line size may be increased to reduce the cache table size. Increasing the cache line size may permit the grouping of multiple objects into a single cache line. In this case, a single cache table entry may play the role of multiple object handle entries (one handle for each object in the cache line). Grouping objects into a single cache table entry may allow the reduction of the memory footprint required for a handle table, as there may be fewer handles. Updating a single object in the cache line may require the writing of the entire cache line (all objects in the cache line). Alternatively, reducing the cache line size allows fewer objects to be stored in a cache line, thus reducing caching granularity. This approach may increase the cache table size. The cache line size may be adjusted accordingly based upon memory constraints on the device on which the cache line based system is implemented.

[0242] On each virtual persistent heap reference (read or write), read/write barriers may be used to verify the validity of the address (i.e. to check if the corresponding cache line is resident in the heap), and to translate it into the current heap location.

[0243] In one embodiment, objects in the virtual persistent heap may maintain references to other objects via a valid or invalid address. A valid address may mean the corresponding address is resident in the in-memory heap. An invalid address may mean the corresponding address is not resident in the in-memory heap.

Caching Considerations for Flash Devices

[0244] Using cache line addressing, reads may be done at a very small granularity (for example, 2 bytes). Bringing a cache line into the in-memory heap, rather than a single object, means that more objects may be brought into the heap than needed. For example, a cache line may include two objects, only one of which may be required by the application. Caching the cache line in the in-memory heap may cache both the required object and the non-required object. This may be exacerbated if there is bad object locality (i.e., if unrelated objects are in the same cache line). If the cache line is too big, many objects read in may never be referenced. Cache lines may also waste heap space if the lines are not full. For example, an average object size for an application may be 50 bytes, and a cache line size may be 4 Kbytes. If 40 objects are resident in a 4 Kbyte cache line in this example, approximately half of the cache line may be unused.

[0245] Flash memory writes are typically destructive, and are therefore preferably minimized. Flash devices may use relatively large block writes (for example, 128 Kbytes). In one embodiment, the cache line size may be a multiple of the flash block write size for optimum performance. In one embodiment, the cache line size may be equal to the block write size. In one embodiment, a cache line flush may write the entire line (all objects in the line).

[0246] From the above, it is evident that cache lines for reads may be small and cache lines for writes may be large. For example, read cache lines may be 4 Kbytes and write cache lines may be 128 Kbytes. To satisfy both requirements, different nursery regions in the heap may be used to combine objects with different flushing policies. Scatter/gather operations may also be used to combine dirty objects into cache I/O buffers, so that only updated objects are written, allowing for larger writes.

[0247] Caching may provide a simple scheme to load and flush data between the store and the in-memory heap. In one embodiment, a cache table and offset based address translation may be used to convert virtual persistent heap references into in-memory heap references. Successive caching and garbage collection compaction cycles may improve spatial locality so that cache lines may contain related objects. This may help reduce heap waste and improve performance due to less caching. Smaller cache line regions may also be used to reduce heap waste.

[0248] Flushing to a flash device may include a scatter/gather step to combine dirty objects into preallocated cache I/O buffers, so that a minimum number of writes are performed. In one embodiment, only dirty objects are written to increase the life of the flash. This may be combined with a log-based store and atomicity for store transactions to maintain the consistency of the image of the virtual persistent heap stored in the persistent device.

[0249] Using cache lines and a cache table may be an improvement over the use of a Resident Object Table (ROT) to keep track of objects resident in the heap. A ROT occupies a relatively large amount of heap space (an entry for each resident object vs. an entry for each cache line). The cache line approach may uses significantly less heap space than an approach using object granularity.

[0250] In one embodiment, cache lines may be “colored” by adding the notion of systems and user lines. For instance, core virtual machine classes loaded from the primary loader shared by all applications can be allocated into system cache area. In addition, read-only objects can be placed into a read-only area.

[0251] The following are examples of types of operations that may occur on a virtual persistent heap cache line:

- [0252] Cache Hit: a reference is made to a valid cache line in the virtual heap address space of the application. The in-memory heap currently contains the cache line. The cache table contains the mapping of the cache line into the heap.
- [0253] Cache Miss: a reference is made to an invalid cache line in the virtual heap address space. The in-memory heap currently does not contain the cache line. A cache miss occurs. The cache line must be loaded from the virtual heap in the store into a free heap location in the in-memory heap.
- [0254] Cache Flush: The dirty cache line was put in the flushing queue. The write lock for the cache line is acquired so that no further writes may proceed until the line is flushed to the store. When flushing is completed, the write lock is released.
- [0255] Cache Eviction: The cache line is evicted from the heap. If the cache line is dirty, the cache needs to be flushed to the store. When completed, the corresponding cache table entry may be freed.

[0256] To help provide efficient address translation, the application virtual heap size (i.e. Kernel+all user information) may be a fixed multiple of the in-memory heap size. Each application virtual persistent heap may be stored at a multiple heap size offset in the store. The address translation may involve subtracting a fixed heap size multiple. The cache table may maintain the mapping of the virtual persistent heap cache line into an in-memory heap location.

[0257] The above caching approach may add a cache table indirection to each object reference. The cache table indirection is substantially similar to object handle indirection. For instance, a cache line set to contain a single object is similar to a traditional virtual machine with one handle per object. Increasing the cache line size may permit the loading and flushing of multiple objects in a single cache operation. A cache table entry may play the role of multiple object handle entries (one handle for each object in the line). A benefit of grouping objects into a single cache entry is that the memory footprint required for the cache table is reduced (there are fewer handles). This is beneficial for small memory devices. If too many objects are grouped into a cache line (making the cache line too big), then updating a single object in the line may require flushing the entire cache line (all objects in the line). Reading a single object also may require loading the entire cache line. Using cache line handles rather than object handles may provide the ability to tune the implementation to fit the memory footprint requirement of the targeted device. The cache line size determines the amount of space required for the cache table. Larger memory environments may use smaller cache lines. Smaller memory environments may use relatively large cache lines.

[0258] The cache table 122 may maintain one or more of the following entries for each cache line of the active application virtual heap:

- [0259] Type (User or System): The type is used to select the flushing and checkpointing policy used to eject and flush the cache line into the persistent store 120. For example, system cache lines may be pinned in the heap 108 and cannot be evicted.
- [0260] Resident (TRUE or FALSE): The resident entry maintains the heap residency state of the cache line. If TRUE, the cache line is resident in the heap 108.
- [0261] Dirty (TRUE or FALSE): Used to keep track of any write/modification to the cache line. If TRUE, the cache line is dirty.
- [0262] Flushing (TRUE or FALSE): Only used for dirty lines. Indicates the cache line is in the checkpoint queue. If TRUE, the cache line is in the list of lines that have been requested to be checkpointed to the store.
- [0263] Length: Length of the cache line. The length may be kept as the multiple of the minimum cache line size supported.
- [0264] Heap Cache Line ID: Specifies the location of the cache line in the heap 108.

[0265] Read-only/static core/virtual machine objects may be located into pinned and read-only system cache lines. In one embodiment, the objects are tagged by the primary class loader. These classes are typically not loaded twice. All read/write core/virtual machine objects may be located in the user cache area. All user objects may be allocated in the user heap area.

[0266] A cache line may be in one of the following states:

- [0267] Empty: The cache line has been freed or has not been allocated, and is “free space” in the virtual persistent heap. One embodiment may preallocate space in the store 120. Another embodiment may not preallocate space in the store 120.
- [0268] Resident: The cache line has been newly allocated or has been loaded from the store 120. No changes have been made yet, or the latest changes have been flushed to the store 120. The copy in the heap 108 is synchronized with the copy in the store 120.
- [0269] Dirty: A write to the cache line has been performed and the changes have not been written back to the store 120. No request for flushing the cache line has been made.
- [0270] Waiting to be flushed: The cache line is in the flushing queue. The cache line is currently write-locked, no further write can occur until the line has been flushed.
- [0271] Persistent: The cache line has been ejected. The line is not resident in the in-memory heap 108.
  FIG. 8—In-Memory Heap Cache Line Address Calculation

[0272] FIG. 8 is a flowchart illustrating one embodiment of a method for translating virtual heap cache line references to in-memory heap cache line references. In step 340, the virtual persistent heap cache line id may be determined. The following function may be used:

- [0273] CacheID=Sadd−(AppID*HS)<<CacheLineS
- [0274] Sadd: The virtual heap cache line reference address to be translated
- [0275] AppID: The current application ID used to select the virtual persistent heap. For example, in FIG. 7, application 104 may have an application ID of 1.
- [0276] HS: The virtual heap size (may be a multiple of the in-memory heap size)
- [0277] <<: Left bit shift operator (may be left or right shift depending on bit order representation in the system)
- [0278] CacheLineS: Cache line bit shift

[0279] In step 340, first, the application ID may be multiplied by the virtual heap size to get the base address of the virtual heap for the application. Second, the base address of the virtual heap may be subtracted from the virtual heap cache line reference address to produce an address offset from the base address. Third, the address offset may be shifted to remove the bits containing the in-cache line address information. For example, if a cache line comprises 256 addressable bytes, the address may be shifted 8 bits. The result of the shift is the cache line ID) for the virtual heap cache line reference.

[0280] In step 342, the location of the cache line in the in-memory heap may be determined via the cache table:

- [0281] HeapCacheIDE=cacheTable (CacheID)

[0282] For example, referring again to FIG. 7, if the result of step 340 is virtual heap cache line 4, looking up the virtual heap cache line 4 row in cache table 122 produces a heap cache line ID of 1.

[0283] In step 344, if the cache line is not resident in the in-memory heap, a cache miss may be issued in step 346, and the cache line may be loaded into the in-memory heap in step 348. In step 350, the in-memory heap address may be calculated. An example of a method for computing the in-memory heap address is:

- [0284] Hadd=HeapCacheID*CacheLineS+Sadd & CacheLineMask
- [0285] CacheLineS: Cache line size
- [0286] Sadd: The original virtual heap page reference address
- [0287] CacheLineMask: Cache line bit mask
- [0288] &: Bitwise AND operator

[0289] First, the heap cache line ID produced in step 342 may be multiplied by the cache line size to produce the base address of the in-memory heap cache line. The original virtual heap cache line reference address may then be ANDed with a cache line bit mask to produce the bits containing the in-cache line address information. The in-cache line address information may then be added to the base address of the in-memory heap cache line to produce the in-memory heap address.

FIG. 9—A Device with Virtual Hear, Object Nursery and Garbage Collector

[0290] FIG. 9 illustrates a device similar to those illustrated in FIGS. 1a-1d. One embodiment includes a client 101 and memory 115. Client 101 and memory 115 may be comprised in a device. Alternatively, client 101 may be comprised in a device, and memory 115 may be located externally to the device. The device may be a computer platform with operating system, such as a PC or laptop computer running an operating system such as Microsoft Windows 9×/NT, or a consumer or appliance device, for example, a cell phone or PDA. Client 101 may be a virtual machine such as a JVM or KVM. Client 101 may be used for running applications, for example, Java applications. One or more applications may be running on client 101, with one application typically executing and one or more applications suspended. Application 104 is shown as a currently executing application.

[0291] Memory 115 may be integrated in or directly attached to the device comprising client 101. Alternatively, memory 115 may be located on a device external to and remotely attached to (for instance, via the Internet) the device comprising client 101. Memory 115 may be a volatile memory such as Direct Inline Memory Modules (DIMMs) or non-volatile storage device such as a flash memory, a hard disk, or removable disk such as a floppy disk. Memory 115 may include the virtual heap 110 for application 104. Memory 115 may also include virtual heaps (not shown) for one or more other applications.

[0292] In-memory heap 108 may be maintained in client 101 memory space, or alternatively may be maintained in memory external to client 101 memory space. In-memory heap 108 may include a portion of virtual heap 110 currently cached for use by application 104. In-memory heap 108 and virtual heap 110 may be divided into one or more sections. The sections may be sectors, pages, cache lines, or any other division of memory space. If application 104 requires code or data that is not currently in heap 108, one or more sections of virtual heap 110 may be copied into in-memory heap 108. If there is insufficient room in in-memory heap 108, one or more sections of in-memory heap 108 may be removed before copying in the new sections.

[0293] A garbage collector 126 may perform garbage collection on the virtual persistent heap on a schedule and/or when required. The virtual persistent heap is the combination of the in-memory heap 108 and the virtual heap 110. Virtual heap 110 may also be referred to as the store heap.

[0294] Garbage collection may include a compaction phase to compact memory in the heap after deleting objects from the heap. Garbage collection may be triggered by several conditions. In one embodiment, running low on heap space may trigger garbage collection to free heap space by deleting non-referenced objects and optionally compacting the heap. In one embodiment, a garbage collection may be initiated on a schedule; the schedule may be at fixed or varying intervals. In one embodiment, garbage collection may be triggered by an excessive amount of caching. An excessive amount of caching may indicate poor object locality, degrading system performance.

[0295] Poor object locality may occur when correlated objects are not stored in the same section of the heap. For example, poor object locality may occur when two or more objects in a section of the heap are not highly correlated, when two or more correlated objects are stored in different sections of the heap, or in a combination of the two conditions. Correlated objects are objects that may be used during execution of a function of the application. For example, a window used to display images and a toolbar used to manipulate the images may be stored as different objects in an image processing application. For good object locality, the objects may be stored in the same page of the heap. With poor object locality, the window and toolbar objects may be stored in different pages. With poor object locality, while a user is editing an image in the window, the page containing the window object may be cached in the in-memory heap 108 while the user is directly manipulating the object. If there is insufficient room in the in-memory heap, the page containing the menu bar may be stored in the virtual heap 110. When the user goes to the toolbar to select another image editing tool, the page containing the window object may be flushed to the virtual heap 110, and the page containing the toolbar object may then be cached to the in-memory heap 108. After the user has selected the tool and returns to the window to edit the image, the page containing the toolbar object may be flushed and the page containing the window object may be cached. The constant swapping of pages between the in-memory and the virtual heap may significantly degrade performance of the system, forcing the user to wait while the operation completes.

[0296] Garbage collecting the heap to remove non-referenced pages, and then compacting the heap, may improve object locality. Compacting the heap may include moving objects from one section of the heap to another section in which heap space wash freed during garbage collection by deleting objects in the section, or by moving objects from the section to another section. Moving objects from one section to another section of the heap may result in correlated objects that were in different sections of the heap being stored in the same section of the heap. In one embodiment, during the compaction phase, the objects in the heap may be examined to determine correlated objects, and an attempt may be made to group as many correlated objects as possible in the same section of the heap. This may include moving non-correlated objects out of a section of memory and moving correlated objects into the section of memory.

[0297] The garbage collector 126 may start at the root of the virtual persistent heap and flag code and data that are referenced (i.e. need to be kept in the virtual persistent heap). Then, all code and data not flagged may be removed from the virtual persistent heap. Alternatively, the garbage collector 126 may flag code and data that are not referenced, and then may remove the flagged code and data. In one embodiment, the code and data may be comprised in objects, and the garbage collector may examine and flag for removal objects in the heap that are not referenced.

[0298] In one embodiment, objects are created by the application in the in-memory heap 108, and may be later flushed to the virtual heap 110 to free space in the in-memory heap 108 for the creation of more new objects, or for requested objects to be cached from the virtual heap 110 into the in-memory heap 108. In one embodiment, for the application to access an object, the object must be in the in-memory heap. A request by the application for an object not currently in the in-memory heap 108 may trigger a heap read operation to move the object from the virtual heap 110 to the in-memory heap 108.

[0299] An object in the heap may reference one or more other objects in the heap, and in turn may itself be referenced by one or more other objects in the heap. If an object is referenced, the object may be considered to be currently in use by the application. Non-referenced objects may be considered as not currently in use by the application. Non-referenced objects may be candidates for garbage collection.

[0300] In one embodiment, a heap may be divided into sections, for example, pages or cache lines. The sections of the heap may be grouped into sets of two or more sections, or working sets, for heap operations such as garbage collection. Sections of the heap may include structures for managing code and data (objects) stored in the section. A structure for tracking references to objects may be referred to as an object reference table. In one embodiment, one or more object reference tables may be kept in a section of the heap. In another embodiment, one or more object reference tables may be kept in a working set for the sections of memory in the working set. In yet another embodiment, a global structure for tracking the references for all objects in the heap may be maintained external to the sections of memory and/or working sets. In still yet another embodiment, each object may include information on the objects it references and the objects that reference it. An internal reference to an object may be defined as a reference to an object from another object in the same section of the heap. An external reference to an object may be defined as a reference to an object from another object in another section of the heap. In one embodiment, to determine if an object is referenced during garbage collection, the process may examine the object reference table that comprises the reference information for the object.

[0301] In one embodiment, the virtual persistent heap may use a single address space for both the virtual heap 110 and the in-memory heap 108. A single garbage collector 126 may be run on the entire virtual persistent heap address space. The virtual persistent heap may use a single garbage collector 126, which may be advantageous for devices with memory and CPU constraints, for example, small appliance and consumer devices. Code and data in in-memory heap 108 may be flushed to virtual heap 110 prior to the start of a garbage collection cycle. Thus, the garbage collector 126 may only need to perform garbage collection on virtual heap 110.

[0302] Garbage collection may cause the virtual persistent heap to become fragmented so that a large object can't fit in available free space. An embodiment of a garbage collection method may include a compaction phase to reduce or eliminate this fragmentation. The compaction phase may also improve object locality.

[0303] The virtual heap enables the running of applications that require a bigger than available in-memory heap. In one embodiment, the amount of caching is tracked, and a garbage collection cycle is induced to reduce extra caching before running out of virtual heap space in response to the tracking of the amount of caching.

[0304] Small appliance and consumer devices may use flash devices for non-volatile memory storage. Flash devices typically have special characteristics, such as large write I/O blocks (for example, 128 Kbytes) and destructive writes. In one embodiment, the number of writes performed to the device by the garbage collector 126 may be minimized to increase the life of the flash device. The garbage collector 126 for the virtual persistent heap may be implemented using working sets and/or one or more object nurseries for short life objects.

[0305] If a garbage collection method walks through the entire virtual heap address space in a single cycle, a large burst of cache load and flushing requests may be generated, particularly when the in-memory heap 108 is much smaller than the virtual heap 110. A generational-based garbage collector 126 may be used. The virtual persistent heap may be divided into working sets, and each generation of the garbage collector 126 may be confined to a working set of the virtual persistent heap. A working set may include one or more sections (pages, cache lines, etc.) of the virtual persistent heap. In one embodiment, the working set size may be the same as the size of the in-memory heap. The entire virtual persistent heap may be garbage collected in several cycles (generations) of garbage collector 126 on the working sets, and each cycle may garbage collect one or more of the working sets. Each generational garbage collection cycle may touch disjoint areas of the virtual persistent heap. A small portion of the heap may be shared to store inter-working set dependencies. References may be significantly confined to the working set region. In one embodiment, the garbage collection cycles may run at fixed intervals. Alternatively, the garbage collection cycles may run at varying intervals.

[0306] In one embodiment, a heap allocator may combine related code and data (e.g. correlated objects) in the same working set region. The generational garbage collector 126 may allow the flushing of changes before, or alternatively after, each garbage collection cycle for each working set region, and thus may avoid the caching burst of a garbage collector that walks the entire virtual heap in one cycle. The generational garbage collector 126 may allow cache load and eviction to be spread across multiple garbage collection generations.

[0307] During garbage collection, the default flushing mechanism of the virtual persistent heap may be disabled until the garbage collection is completed. Since garbage collection is likely to change the heap state and update heap structures many times, there is no advantage to generating a store checkpoint during garbage collection. For instance, a cache line is likely to be updated many times during garbage collection. Therefore, the method may wait until the garbage collection is completed to commit a store checkpoint.

[0308] In one embodiment, heap regions with different flushing policies may be used. For example, an object nursery region 113 that is not flushed where objects for use by application 104 are initially created may be used. In one embodiment, multiple object nurseries with different flushing policies may be used. Application 104 may create new code and data in nursery regions such as object nursery region 113 of in-memory heap 108. The nursery regions may not be flushed as are other regions in the in-memory heap 108. Using nursery regions may help to reduce flushing, fragmentation, and garbage collection overhead by reducing the number of newly created objects that are flushed to the virtual heap 110, since short-term, non-referenced newly created objects may not be flushed, and thus do not have to be examined and removed during garbage collection. In one embodiment, a garbage collector may use both working sets to implement a generational garbage collection policy and heap regions with different flushing policies such as nursery regions.

[0309] In one embodiment, as part of garbage collection, the objects in object nursery 113 may be examined to see which objects are referenced. In one embodiment, object reference information for the objects in object nursery 113 may be kept in an object reference table in object nursery 113. Referenced objects may be moved from object nursery 113 to other regions of the in-memory heap 108. Non-referenced objects may also be removed from the object nursery 113. “Dirty” objects, including the “new” objects moved from the object nursery 113 to the other regions of the in-memory heap 108, may then be flushed from in-memory heap 108 to virtual heap 110. Garbage collection may then remove non-referenced objects from the virtual heap 110. A compaction phase may then compact memory in the sections of the virtual heap 10 and/or the sections of the in-memory heap 108.

[0310] In object-oriented programming languages such as Java, objects may be defined as structures that are instances of a particular class definition or subclass object definition. Objects may include instances of the class's methods or procedures (code) and/or data related to the object. An object is what actually “runs” in an object-oriented program in the computer.

[0311] The object nursery region may not be flushed in the same manner as other regions of the heap 108. A number of short-lived objects may be created during the execution of an application. A relatively small number of these objects may end up in the persistent tore. Using an object nursery outside the scope of normal flushing and garbage collecting hold new objects avoids unnecessary flushing of the short-lived objects. Objects in the object nursery that are externally referenced by other objects in other regions of the virtual heap may at times be copied into “normal” heap regions to be flushed to virtual heap 110. In one embodiment, when a garbage collection cycle is run, objects referenced in the object nursery may be copied into “normal” heap regions to be flushed to virtual heap 110.

[0312] FIG. 9 shows a new object 128a created in object nursery 113 by application 104. When garbage collector 126 runs, object 128a in object nursery 113 may be examined. If the object is referenced by application 104, it is likely that the object may be used by the application 104 in the future. The object 128a may then be moved into another region of the heap 108 as object 128b. Object 128b may then be flushed to virtual heap 110 as object 128c. Thus, object 128a now exists in virtual heap 110 as object 128c. The memory for object 128a in object nursery 113 may be freed after the object 128a is moved to another region of the in-memory heap 108. Note that object 128b (a cached copy of object 128c) may remain in heap 108 while in use by application 104. When virtual heap 110 is checkpointed, object 128c will be in the persistent store. When a generation of garbage collector 126 runs on the working set of virtual heap 110 that includes object 128c, object 128c may be removed from the virtual heap if no longer used by application 104. Objects in the nursery 113 that are not referenced after a generation of garbage collection may be removed from the nursery 113.

[0313] Some embodiments may include two or more nursery regions. The regions may form a hierarchical nursery for objects. In a hierarchical nursery, an object may be created in a first nursery region. If the object “survives” in the first region (is referenced when the objects in the first nursery region are checked, such as during a garbage collection cycle), the object may be moved to a second nursery region for objects that have persisted for a while. The object may continue to be checked and moved up to “higher” nursery regions until the object is finally moved into a region of the in-memory heap 108 or until the object is no longer referenced and is deleted from the nursery regions. If the object is moved into a region of the in-memory heap 108, the object may hen be flushed from the in-memory heap 108 to virtual heap 110. In one embodiment, a timestamp may be kept for a newly created object to keep track of how long it has been in a nursery region, and the object may be moved to another nursery region or out of the nursery region after a certain time has elapsed.

FIGS. 10a through 10c—Garbage Collecting a Virtual Heap

[0314] FIGS. 10a through 10c are flowcharts illustrating embodiments of a generational garbage collector with special region processing. In an embodiment of garbage collection as illustrated in FIG. 10a, a process is executing on a virtual machine in step 400. In step 402, a virtual heap manager may determine if garbage collection is required on the to virtual heap for the process. In one embodiment, garbage collection may be based on a time interval, for example, approximately every 15 seconds. In one embodiment, running low on space in the virtual heap may trigger garbage collection to free up virtual heap space. In one embodiment, an excessive amount of paging activity between store heap and the virtual heap may trigger garbage collection. The excessive amount of paging may be indicative of poor object locality in the pages; in other words, the process may be accessing two or more objects in different pages of the heap, causing some pages to be flushed from the in-memory heap so that other pages may be cached. Garbage collecting may free up space in pages of the virtual heap, which may allow the two or more objects to be compressed into fewer pages and thus requiring less paging activity.

[0315] In one embodiment, the entire virtual heap may be garbage collected in a cycle. A cycle may comprise one or more generations of garbage collection. In each generation of garbage collection, one or more working sets of the virtual heap may be garbage collected. A working set may include one or more pages of the virtual heap. In step 404, if garbage collection is required, then special regions for the process may be processed. Special regions may include one or more nursery regions. In one embodiment, new objects created by the process may be created in one or more nursery regions. In step 404, new objects that are referenced by the process may be moved to other regions of the in-memory heap 108, and the memory in the nursery region for other objects not referenced by the process may be freed. A next working set in the virtual heap for the process may then be garbage collected in step 406. In one embodiment, two or more working sets may be garbage collected in one generation of garbage collection. In another embodiment, only one working set may be garbage collected in one generation of garbage collection.

[0316] FIG. 10b is a flowchart illustrating the processing of a nursery region. In step 444, an object in the nursery region may be examined. In step 446, if the object is referenced by the process, the object may be moved to another in-memory heap region to be flushed to the persistent store in step 448. Alternatively, the object may be moved to a “higher” nursery region in a hierarchy of two or more nursery regions. If the object is not referenced by the process, the object may be deleted from the nursery region in step 450. In step 452, if there are more new objects in the nursery region that have not been examined, processing may return to step 444 to examine the next object.

[0317] FIG. 10c expands on step 406 of FIG. 10a. In step 418, pages containing “dirty” objects in the in-memory heap may be flushed to the virtual heap. In one embodiment, only pages containing dirty objects in the working set to be garbage collected in this generation of the garbage collector may be flushed in this generation. In step 420, the objects in the one or more working sets to be garbage collected in this generation may be examined. In step 422, objects that are not in use or referenced by the application may be marked for removal. In step 424, objects marked for removal from the one or more working sets may be deleted from the virtual heap. Alternatively, in step 422, objects in use may be marked, and in step 424 unmarked objects may be removed. Another alternative is to remove objects as they are found to be not in use. In step 426, the one or more working sets may be compacted. Compacting the one or more working sets may include moving one or more objects in a working set to another location in the working set, or moving one or more objects to another working set, in order to gain as much contiguous free space in the heap as possible.

FIG. 11a Through 11c—Atomic Transactions on a Persistent Store

[0318] A database store method and Application Programming Interface (API) may be provided for the virtual persistent heap. The API may provide mechanisms to cache portions of the virtual heap into the in-memory heap for use by the application and to flush portions of the heap out of the in-memory heap. The virtual heap may be stored in a persistent store. Thus, the database store method and API may function to manage the virtual persistent heap in the persistent store.

[0319] In one embodiment, the persistent store is composed of one or more virtual persistent heaps, with one virtual persistent heap for each application running in the virtual machine. Each virtual persistent heap may be subdivided into cache lines. The cache line is the smallest amount of data that can be read or written in the heap.

[0320] The database store API may include an interface to a set of functions for managing a virtual persistent heap in a virtual machine environment. The database store method and API may be configured to work with small consumer and embedded devices, such as Java-enabled devices, as well as larger devices supporting Java and other virtual machine environments such as PCs, laptops, etc. The functions provided by the database store API may be configured to perform transactions to manage the virtual persistent heap. At least some of the transactions may be atomic transactions. The transactions provided by the database store API may include, but are not limited to:

- [0321] Open the store
- [0322] Close the store
- [0323] Atomic read transaction (read a set of cache lines)
- [0324] Atomic write transaction (write a set of cache lines)
- [0325] Atomic delete transaction (delete a set of cache lines)
- [0326] Abort (stop a transaction)

[0327] FIGS. 11a through 11c illustrate several database store API transactions that may be available in embodiments of the present invention. An atomic transaction (or transaction) may be defined a sequence of information exchange and related work that is treated as a unit for the purposes of satisfying a request and for ensuring data integrity. For a transaction to be completed and data changes to be made permanent, a transaction has to be completed in its entirety. When a transaction has successfully entirely completed, the transaction is committed. Committing a transaction includes accepting all the changes made by the transaction. If the transaction does not successfully complete, the transaction may be rejected, and all data affected by the transaction may be “rolled back” to the state of the data at some earlier time, for instance, to the state of the data at the time the transaction began.

[0328] As an example of an atomic transaction, if two cache lines are being flushed from the cache and written to the persistent heap, and there is a relationship between the two cache lines that requires the two to be consistent, an atomic write transaction may be invoked from the database store API to write both cache lines. When both cache lines have been successfully read from the in-memory heap and written to the store heap, the transaction is committed and processing resumes. If the first cache line is successfully written but the second cache line fails to write, then the write of the first cache line is undone (“rolled back”) and the state of the in-memory heap and virtual heap are restored to the state before the atomic write began.

[0329] FIG. 11a illustrates one embodiment of an atomic read transaction. An atomic read transaction may occur when an application requires code and/or data (objects) that are not currently in the in-memory heap, but are in the store heap. The atomic read transaction may cache the one or more cache lines including the required objects for the applications from the store heap to the in-memory heap.

[0330] The store heap may be opened in step 500. In one embodiment, the store heap may be in one of several access states including an open access state and a closed access state. In the open access state, operations such as writing, reading and deleting cache lines in the store heap may be allowed. In the closed access state, these operations may be prohibited. Opening the store heap may include changing the access state from closed to open.

[0331] Steps 502 through 506 illustrate the atomic read transaction. In step 502, one or more cache lines may be read from the store heap. The one or more lines read from the store heap may be cached in the in-memory heap in step 504. If there is insufficient memory in the in-memory heap for the cache lines, more memory may be made available in the in-memory heap by one or more of several methods. Examples of methods of making more memory available in the in-memory heap include, but are not limited to: allocating more cache lines to the in-memory heap; flushing one or more cache lines to the store heap; deleting unused or transient content from one or more cache lines; and compacting memory in one or more cache lines. In step 506, the transaction, having successfully completed, may be committed. If the transaction fails, the transaction may not be committed, and data modified during the transaction may be “rolled back” to its state prior to starting the transaction. Rolling back an atomic read may include undoing any caches of cache lines to the in-memory heap done in step 504. In step 530, the store heap may be closed. Closing the store heap may include changing the access state from open to closed.

[0332] FIG. 11b illustrates one embodiment of an atomic write transaction. An atomic write transaction may occur when there are objects to be flushed from the in-memory heap to the store heap. The objects may be “dirty” objects that need to be updated in the store heap, or may be new objects that need to be flushed to the store heap.

[0333] In step 500, the store heap may be opened. Steps 510 through 514 illustrate the atomic write transaction. In step 510, one or more cache lines including the objects to be flushed may be read from the in-memory heap. In step 512, the one or more cache lines may be written to the store heap. If there is insufficient memory in the store heap for the cache lines, more memory may be made available in the store heap by one or more of several methods. Examples of methods of making more memory available in the store heap include, but are not limited to: allocating more cache lines to the store heap; deleting one or more cache lines from the store heap; deleting unused or transient content from one or more cache lines; and compacting memory in one or more cache lines. In step 514, the transaction, having successfully completed, may be committed. If the transaction fails, the transaction may not be committed, and data modified during the transaction may be “rolled back” to its state prior to starting the transaction. In step 530, the store heap may be closed.

[0334] FIG. 11c illustrates one embodiment of an atomic delete transaction. An atomic delete transaction may occur when there are objects to be removed from the store heap, such as when the objects are non-referenced objects selected for removal from the store heap during garbage collection. The objects may be determined to be currently not in use by the application. In step 500, the store heap may be opened. Steps 520 and 522 illustrate the atomic delete transaction. In step 520, one or more cache lines containing the objects may be deleted from the store heap. In step 522, the transaction, having successfully completed, may be committed. If the transaction fails, the transaction may not be committed, and data modified during the transaction may be “rolled back” to its state prior to starting the transaction. In step 530, the store heap may be closed. The cache lines containing the objects to be removed from the store heap may be flushed from the in-memory heap prior to being deleted.

[0335] In FIGS. 11a through 11c, opening and closing the store heap may be optional. For example, if the store heap is already opened, then step 500 may not be necessary, and if other transactions are anticipated, the store heap may not be closed.

[0336] Various embodiments may further include receiving or storing instructions and/or data implemented in accordance with the foregoing description upon a carrier medium. Suitable carrier media may include storage media or memory media such as magnetic or optical media, e.g., disk or CD-ROM, as well as transmission media or signals such as electrical, electromagnetic, or digital signals, conveyed via a communication medium such as network 108 and/or a wireless link.

[0337] Although the embodiments above have been described in considerable detail, numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.

Claims

1. A method for managing a virtual heap for a process executing within a virtual machine executing within a device, the method comprising:

providing a store heap for the process, wherein the store heap is comprised in the virtual heap;

providing an in-memory heap for the process, wherein the in-memory heap comprises a cached portion of the store heap for the process, and wherein the in-memory heap is comprised in the virtual heap;

performing an atomic transaction on the virtual heap, wherein said performing the atomic transaction comprises performing one or more transaction tasks, and wherein said performing the atomic transaction changes a state of the virtual heap by modifying one or more portions of the virtual heap;

committing the atomic transaction by accepting the modifications to the one or more portions of the virtual heap if the one or more transaction tasks in the atomic transaction are performed without generating an error; and

rejecting the atomic transaction by restoring the virtual heap to the state of the virtual heap prior to said performing the atomic transaction if one or more of the one or more transaction tasks in the atomic transaction generates an error when performed.

2. The method of claim 1, wherein an access state of the store heap is closed prior to said performing the atomic transaction, and wherein the closed access state prohibits performing the atomic transaction; the method further comprising:

changing the access state of the store heap to open prior to said performing the atomic transaction, wherein the open access state permits said performing the atomic transaction.

3. The method of claim 2, further comprising: changing the access state of the store heap to closed subsequent to said performing the atomic transaction.

4. The method of claim 1, wherein the atomic transaction is an atomic write transaction; and wherein said performing the atomic transaction comprises:

reading a first portion of the in-memory heap; and

writing the first portion of the in-memory heap to the store heap.

5. The method of claim 4, wherein said performing the atomic transaction further comprises: verifying that the first portion of the in-memory heap is successfully read from the in-memory heap prior to said writing the first portion of the in-memory heap to the store heap.

6. The method of claim 4, wherein said performing the atomic transaction further comprises: deleting the first portion from the in-memory heap subsequent to said reading the first portion from the in-memory heap.

7. The method of claim 1, wherein the atomic transaction is an atomic read transaction; and wherein said performing the atomic transaction comprises:

reading a second portion of the store heap; and

writing the second portion of the store heap to the in-memory heap.

8. The method of claim 7, wherein said performing the atomic transaction further comprises: verifying that the second portion of the store heap is successfully read from the store heap prior to said writing the first portion of the store heap to the in-memory heap.

9. The method of claim 1, wherein the atomic transaction is an atomic delete transaction; and wherein said performing the atomic transaction comprises:

deleting a third portion of the store heap.

10. The method of claim 1, further comprising: checkpointing the store heap to a persistent store to make the virtual heap persistent.

11. The method of claim 1, wherein the store heap is one of a plurality of store heaps in a persistent store; wherein each of the plurality of store heaps is associated with one of a plurality of processes; and wherein the process is one of the plurality of processes.

12. The method of claim 1, wherein the store heap and the in-memory heap are comprised in one memory address space.

13. The method of claim 1, wherein the device is a mobile computing device.

14. The method of claim 1, wherein the virtual machine is a Java virtual machine; and wherein the process is a Java application.

15. The method of claim 1, wherein the in-memory heap and the store heap comprise objects for the process, and wherein the objects comprise code and data for use by the process during execution within the virtual machine.

16. A method for managing a virtual heap on a virtual machine executing within a device, the method comprising:

providing a store heap for a first process executing within the virtual machine, wherein the store heap is comprised in the virtual heap;

providing an in-memory heap for the first process, wherein the in-memory heap comprises a cached portion of the store heap for the first process, and wherein the in-memory heap is comprised in the virtual heap;

providing an application programming interface (API) for performing heap operations on the virtual heap, wherein the API comprises functions for performing operations on portions of the virtual heap, and wherein the functions in the API are callable by processes executing within the virtual machine;

a second process calling a first function from the API to perform a first operation on a first portion of the virtual heap;

performing the first operation on the first portion of the virtual heap in response to the second process calling the first function, wherein said performing the first operation changes a state of the virtual heap by modifying the first portion of the virtual heap;

committing the first operation on the first portion of the virtual heap by accepting the modifications to the first portion of the virtual heap if the first operation is performed without generating an error; and

rejecting the first operation on the first portion of the virtual heap by restoring the virtual heap to the state of the virtual heap prior to said performing the first operation if the first operation generates an error when performed.

17. The method of claim 16, wherein the first process and the second process are the same process.

18. The method of claim 16, wherein the second process is a heap management process.

19. The method of claim 16, wherein the first operation performed by the first function called by the second process is an atomic write transaction; and wherein the atomic transaction comprises:

reading a first portion of the in-memory heap; and

writing the first portion of the in-memory heap to the store heap.

20. The method of claim 19, wherein the atomic transaction further comprises: verifying that the first portion of the in-memory heap is successfully read from the in-memory heap prior to said writing the first portion of the in-memory heap to the store heap.

21. The method of claim 19, wherein the atomic transaction further comprises: deleting the first portion from the in-memory heap subsequent to said reading the first portion from the in-memory heap.

22. The method of claim 16, wherein the first operation performed by the first function called by the second process is an atomic read transaction; and wherein the atomic transaction comprises:

reading a second portion of the store heap; and

writing the second portion of the store heap to the in-memory heap.

23. The method of claim 22, wherein the atomic transaction further comprises: verifying that the second portion of the store heap is successfully read from the store heap prior to said writing the first portion of the store heap to the in-memory heap.

24. The method of claim 16, wherein the first operation performed by the first function called by the second process is an atomic delete transaction; and wherein said performing the atomic transaction comprises: deleting a third portion of the store heap.

25. The method of claim 16, further comprising: checkpointing the store heap to a persistent store to make the virtual heap persistent.

26. The method of claim 16, wherein the store heap is one of a plurality of store heaps in a persistent store; wherein each of the plurality of store heaps is associated with one of a plurality of processes; and wherein the process is one of the plurality of processes.

27. The method of claim 16, wherein the store heap and the in-memory heap are comprised in one memory address space.

28. The method of claim 16, wherein the device is a mobile computing device.

29. The method of claim 16, wherein the virtual machine is a Java virtual machine; and wherein the process is a Java application.

30. The method of claim 16, wherein the in-memory heap and the store heap comprise objects for the process, and wherein the objects comprise code and data for use by the process during execution within the virtual machine.

31. A system comprising:

a device configured to execute a virtual machine, wherein the virtual machine is configured to execute a process;

a first memory coupled to the device, wherein the first memory is configured to store a store heap for the process, wherein the store heap is comprised within a virtual heap for the process;

a second memory coupled to the device, wherein the second memory is configured to store an in-memory heap for the process, wherein the in-memory heap is comprised within the virtual heap, wherein the in-memory heap comprises cached portions of the store heap for access by the process;

wherein the device is configured to perform operations on the virtual heap according to an application programming interface (API), and wherein the API comprises functions for performing the operations on the virtual heap, and wherein the functions in the API are callable by the process, and wherein the API is configured to:

perform an atomic transaction on the virtual heap, wherein the atomic transaction comprises one or more transaction tasks, and wherein the atomic transaction changes a state of the virtual heap by modifying one or more portions of the virtual heap;

commit the atomic transaction by accepting the modifications to the one or more portions of the virtual heap if the one or more transaction tasks in the atomic transaction are per formed without generating an error; and

reject the atomic transaction by restoring the virtual heap to the state of the virtual heap prior to the atomic transaction if one or more of the one or more transaction tasks in the atomic transaction generates an error when performed.

32. The system of claim 31, wherein an access state of the store heap is closed prior to said performing the atomic transaction, wherein the closed access state prohibits performing the atomic transaction; and wherein the API is further configured to:

change the access state of the store heap to open prior to said performing the atomic transaction, wherein the open access state permits said performing the atomic transaction; and

change the access state of the store heap to closed subsequent to said performing the atomic transaction.

33. The system of claim 31, wherein the atomic transaction is an atomic write transaction; and wherein, in performing the atomic transaction, the API is further configured to:

read a first portion of the in-memory heap; and

write the first portion of the in-memory heap to the store heap.

34. The system of claim 33, wherein, in performing the atomic transaction, the API is further configured to: verify that the first portion of the in-memory heap is successfully read from the in-memory heap prior to said writing the first portion of the in-memory heap to the store heap.

35. The system of claim 33, wherein, in performing the atomic transaction, the API is further configured to: delete the first portion from the in-memory heap subsequent to said reading the first portion from the in-memory heap.

36. The system of claim 31, wherein the atomic transaction is an atomic read transaction; and wherein, in performing the atomic transaction, the API is further configured to:

read a second portion of the store heap; and

write the second portion of the store heap to the in-memory heap.

37. The system of claim 36, wherein, in performing the atomic transaction, the API is further configured to: verify that the second portion of the store heap is successfully read from the store heap prior to said writing the first portion of the store heap to the in-memory heap.

38. The system of claim 31, wherein the atomic transaction is an atomic delete transaction; and wherein, in performing the atomic transaction, the API is further configured to: delete a third portion of the store heap.

39. The system of claim 31, wherein the first memory further comprises a persistent store configured to store a plurality of store heaps, wherein the store heap for the process is one of the plurality of store heaps; and wherein the device is further configured to execute heap management software for managing the virtual heap, and wherein the heap management software is configured to: checkpoint the store heap for the process to the persistent store to make the virtual heap for the process persistent.

40. The system of claim 31, wherein the store heap and the in-memory heap are comprised in one memory address space.

41. The system of claim 31, wherein the device is a mobile computing device.

42. The system of claim 31, wherein the virtual machine is a Java virtual machine; and wherein the process is a Java application.

43. The system of claim 31, wherein the in-memory heap and the store heap comprise objects for the process, and wherein the objects comprise code and data for use by the process during execution within the virtual machine.

44. A computer readable medium comprising programming instructions executable to manage a virtual heap for a process executing within a virtual machine executing within a device, wherein the program instructions are executable to implement:

providing a store heap for the process, wherein the store heap is comprised in the virtual heap;

providing an in-memory heap for the process, wherein the in-memory heap comprises a cached portion of the store heap for the process, and wherein the in-memory heap is comprised in the virtual heap;

committing the atomic transaction by accepting the modifications to the portions of the virtual heap if the one or more transaction tasks in the atomic transaction are performed without generating an error; and

45. The computer readable medium of claim 44, wherein an access state of the store heap is closed prior to said performing the atomic transaction, and wherein the closed access state prohibits performing the atomic transaction; wherein the program instructions are further executable to implement:

changing the access state of the store heap to open prior to said performing the atomic transaction, wherein the open access state permits said performing the atomic transaction; and

changing the access state of the store heap to closed subsequent to said performing the atomic transaction.

46. The computer readable medium of claim 44, wherein the atomic transaction is an atomic write transaction; and wherein the program instructions are further executable to implement:

reading a first portion of the in-memory heap; and

writing the first portion of the in-memory heap to the store heap.

47. The computer readable medium of claim 46, wherein, in said performing the atomic transaction, the program instructions are further executable to implement: verifying that the first portion of the in-memory heap is successfully read from the in-memory heap prior to said writing the first portion of the in-memory heap to the store heap.

48. The computer readable medium of claim 46, wherein, in said performing the atomic transaction, the program instructions are further executable to implement: deleting the first portion from the in-memory heap subsequent to said reading the first portion from the in-memory heap.

49. The computer readable medium of claim 44, wherein the atomic transaction is an atomic read transaction; and wherein, in said performing the atomic transaction, the program instructions are further executable to implement:

reading a second portion of the store heap; and

writing the second portion of the store heap to the in-memory heap.

50. The computer readable medium of claim 49, wherein, in said performing the atomic transaction, the program instructions are further executable to implement: verifying that the second portion of the store heap is successfully read from the store heap prior to said writing the first portion of the store heap to the in-memory heap.

51. The computer readable medium of claim 44, wherein the atomic transaction is an atomic delete transaction; and wherein, in said performing the atomic transaction, the program instructions are further executable to implement: deleting a third portion of the store heap.

52. The computer readable medium of claim 44, wherein the store heap is one of a plurality of store heaps in a persistent store; wherein each of the plurality of store heaps is associated with one of a plurality of processes;

wherein the process is one of the plurality of processes; and wherein the program instructions are further executable to implement: checkpointing the store heap to the persistent store to make the virtual heap persistent.

53. The computer readable medium of claim 44, wherein the store heap and the in-memory heap are comprised in one memory address space.

54. The computer readable medium of claim 44, wherein the device is a mobile computing device.

55. The computer readable medium of claim 44, wherein the virtual machine is a Java virtual machine; and wherein the process is a Java application.

56. The computer readable medium of claim 44, wherein the in-memory heap and the store heap comprise objects for the process, and wherein the objects comprise code and data for use by the process during execution within the virtual machine.

Patent Citations (209)

Patent	Date	Inventor	Cited By
US4491946(A)	1985-01-01	Kryskow, Jr. et al.	Applicant
US4713806(A)	1987-12-01	Oberlander et al.	Applicant
US4742447(A)	1988-05-01	Duvall et al.	Applicant
US4809160(A)	1989-02-01	Mahon et al.	Applicant
US4823122(A)	1989-04-01	Mann et al.	Applicant
US4843541(A)	1989-06-01	Bean et al.	Applicant
US4939638(A)	1990-07-01	Stephenson et al.	Applicant
US4956773(A)	1990-09-01	Saito et al.	Applicant
US4989134(A)	1991-01-01	Shaw	Applicant
US5088036(A)	1992-02-01	Ellis et al.	Applicant
US5101346(A)	1992-03-01	Ohtsuki	Applicant
US5109486(A)	1992-04-01	Seymour	Applicant
US5187787(A)	1993-02-01	Skeen et al.	Applicant
US5218699(A)	1993-06-01	Brandle et al.	Applicant
US5257369(A)	1993-10-01	Skeen et al.	Applicant
US5293614(A)	1994-03-01	Ferguson et al.	Applicant
US5297283(A)	1994-03-01	Kelly, Jr. et al.	Applicant
US5307490(A)	1994-04-01	Davidson et al.	Applicant
US5311591(A)	1994-05-01	Fischer	Applicant
US5327559(A)	1994-07-01	Priven et al.	Applicant
US5339435(A)	1994-08-01	Lubkin et al.	Applicant
US5341484(A)	1994-08-01	Tanaka et al.	Applicant
US5386568(A)	1995-01-01	Wold et al.	Applicant
US5390328(A)	1995-02-01	Frey et al.	Applicant
US5390334(A)	1995-02-01	Harrison	Applicant
US5423042(A)	1995-06-01	Jalili et al.	Applicant
US5440744(A)	1995-08-01	Jacobson et al.	Applicant
US5448740(A)	1995-09-01	Kiri et al.	Applicant
US5452459(A)	1995-09-01	Drury et al.	Applicant
US5455952(A)	1995-10-01	Gjovaag	Applicant
US5471629(A)	1995-11-01	Risch	Applicant
US5475792(A)	1995-12-01	Stanford et al.	Applicant
US5475817(A)	1995-12-01	Waldo et al.	Applicant
US5475840(A)	1995-12-01	Nelson et al.	Applicant
US5481721(A)	1996-01-01	Serlet et al.	Applicant
US5504921(A)	1996-04-01	Dev et al.	Applicant
US5511197(A)	1996-04-01	Hill et al.	Applicant
US5524244(A)	1996-06-01	Robinson et al.	Applicant
US5553282(A)	1996-09-01	Parrish et al.	Applicant
US5555367(A)	1996-09-01	Premerlani et al.	Applicant
US5555427(A)	1996-09-01	Aoe et al.	Applicant
US5557798(A)	1996-09-01	Skeen et al.	Applicant
US5560003(A)	1996-09-01	Nilsen et al.	Applicant
US5561785(A)	1996-10-01	Blandy et al.	Applicant
US5577231(A)	1996-11-01	Scalzi et al.	Applicant
US5594921(A)	1997-01-01	Pettus	Applicant
US5603031(A)	1997-02-01	White et al.	Applicant
US5617537(A)	1997-04-01	Yamada et al.	Applicant
US5628005(A)	1997-05-01	Hurvig	Applicant
US5640564(A)	1997-06-01	Hamilton et al.	Applicant
US5644768(A)	1997-07-01	Periwal et al.	Applicant
US5652888(A)	1997-07-01	Burgess	Applicant
US5655148(A)	1997-08-01	Richman et al.	Applicant
US5659751(A)	1997-08-01	Heninger	Applicant
US5664191(A)	1997-09-01	Davidson et al.	Applicant
US5671225(A)	1997-09-01	Hooper et al.	Applicant
US5675796(A)	1997-10-01	Hodges et al.	Applicant
US5680573(A)	1997-10-01	Rubin et al.	Applicant
US5680617(A)	1997-10-01	Gough et al.	Applicant
US5682535(A)	1997-10-01	Knudsen	Examiner
US5684955(A)	1997-11-01	Meyer et al.	Applicant
US5689709(A)	1997-11-01	Corbett et al.	Applicant
US5692192(A)	1997-11-01	Sudo	Applicant
US5706435(A)	1998-01-01	Barbara et al.	Applicant
US5706502(A)	1998-01-01	Foley et al.	Applicant
US5724588(A)	1998-03-01	Hill et al.	Applicant
US5727145(A)	1998-03-01	Nessett et al.	Applicant
US5737607(A)	1998-04-01	Hamilton et al.	Applicant
US5745678(A)	1998-04-01	Herzberg et al.	Applicant
US5745695(A)	1998-04-01	Gilchrist et al.	Applicant
US5745703(A)	1998-04-01	Cejtin et al.	Applicant
US5745755(A)	1998-04-01	Covey	Applicant
US5748897(A)	1998-05-01	Katiyar	Applicant
US5751613(A)	1998-05-01	Doty et al.	Examiner
US5754849(A)	1998-05-01	Dyer et al.	Applicant
US5757925(A)	1998-05-01	Faybishenko	Applicant
US5761656(A)	1998-06-01	Ben-Shachar	Applicant
US5764897(A)	1998-06-01	Khalidi	Applicant
US5768532(A)	1998-06-01	Megerian	Applicant
US5774551(A)	1998-06-01	Wu et al.	Applicant
US5778187(A)	1998-07-01	Monteiro et al.	Applicant
US5778228(A)	1998-07-01	Wei	Applicant
US5778368(A)	1998-07-01	Hogan et al.	Applicant
US5778443(A)	1998-07-01	Swanberg et al.	Applicant
US5787425(A)	1998-07-01	Bigus	Applicant
US5787431(A)	1998-07-01	Shaughnessy	Applicant
US5790548(A)	1998-08-01	Sistanizadeh et al.	Applicant
US5802267(A)	1998-09-01	Shirakihara et al.	Applicant
US5802367(A)	1998-09-01	Held et al.	Applicant
US5808911(A)	1998-09-01	Tucker et al.	Applicant
US5809507(A)	1998-09-01	Cavanaugh, III	Applicant
US5813013(A)	1998-09-01	Shakib et al.	Applicant
US5815149(A)	1998-09-01	Mutschler, III et al.	Applicant
US5815709(A)	1998-09-01	Waldo et al.	Applicant
US5815711(A)	1998-09-01	Sakamoto et al.	Applicant
US5818448(A)	1998-10-01	Katiyar	Applicant
US5822590(A)	1998-10-01	Gupta	Examiner
US5829022(A)	1998-10-01	Watanabe et al.	Applicant
US5832219(A)	1998-11-01	Pettus	Applicant
US5832529(A)	1998-11-01	Wollrath et al.	Applicant
US5832593(A)	1998-11-01	Wurst et al.	Applicant
US5835737(A)	1998-11-01	Sand et al.	Applicant
US5842018(A)	1998-11-01	Atkinson et al.	Applicant
US5844553(A)	1998-12-01	Hao et al.	Applicant
US5845090(A)	1998-12-01	Collins, III et al.	Applicant
US5845129(A)	1998-12-01	Wendorf et al.	Applicant
US5860004(A)	1999-01-01	Fowlow et al.	Applicant
US5860083(A)	1999-01-01	Sukegawa	Applicant
US5860153(A)	1999-01-01	Matena et al.	Applicant
US5864862(A)	1999-01-01	Kriens et al.	Applicant
US5864866(A)	1999-01-01	Henckel et al.	Applicant
US5872928(A)	1999-02-01	Lewis et al.	Applicant
US5872973(A)	1999-02-01	Mitchell et al.	Applicant
US5875335(A)	1999-02-01	Beard	Applicant
US5878411(A)	1999-03-01	Burroughs et al.	Applicant
US5884024(A)	1999-03-01	Lin et al.	Applicant
US5884079(A)	1999-03-01	Furusawa	Applicant
US5887134(A)	1999-03-01	Ebrahim	Applicant
US5890158(A)	1999-03-01	House et al.	Applicant
US5892904(A)	1999-04-01	Atkinson et al.	Applicant
US5913029(A)	1999-06-01	Shostak	Applicant
US5933497(A)	1999-08-01	Beetcher et al.	Applicant
US5935249(A)	1999-08-01	Stern et al.	Applicant
US5940827(A)	1999-08-01	Hapner et al.	Applicant
US5944793(A)	1999-08-01	Islam et al.	Applicant
US5946485(A)	1999-08-01	Weeren et al.	Applicant
US5946694(A)	1999-08-01	Copeland et al.	Applicant
US5961582(A)	1999-10-01	Gaines	Applicant
US5966531(A)	1999-10-01	Skeen et al.	Applicant
US5966702(A)	1999-10-01	Fresko et al.	Applicant
US5969967(A)	1999-10-01	Aahlad et al.	Applicant
US5987506(A)	1999-11-01	Carter et al.	Applicant
US5999179(A)	1999-12-01	Kekic et al.	Applicant
US6003763(A)	1999-12-01	Gallagher et al.	Applicant
US6009103(A)	1999-12-01	Woundy	Applicant
US6009464(A)	1999-12-01	Hamilton et al.	Applicant
US6016496(A)	2000-01-01	Roberson	Applicant
US6016500(A)	2000-01-01	Waldo et al.	Applicant
US6026414(A)	2000-02-01	Anglin	Applicant
US6031977(A)	2000-02-01	Pettus	Applicant
US6044381(A)	2000-03-01	Boothby et al.	Applicant
US6055562(A)	2000-04-01	Devarakonda et al.	Applicant
US6061699(A)	2000-05-01	DiCecco et al.	Applicant
US6061713(A)	2000-05-01	Bharadhwaj	Applicant
US6070173(A)	2000-05-01	Huber et al.	Applicant
US6093216(A)	2000-07-01	Adl-Tabatabai et al.	Applicant
US6094528(A)	2000-07-01	Jordan	Examiner
US6178519(B1)	2001-01-01	Tucker	Examiner
US6199116(B1)	2001-03-01	May et al.	Applicant
US6219675(B1)	2001-04-01	Pal et al.	Applicant
US6253256(B1)	2001-06-01	Wollrath et al.	Applicant
US6256637(B1)	2001-07-01	Venkatesh et al.	Examiner
US6272559(B1)	2001-08-01	Jones et al.	Applicant
US6292934(B1)	2001-09-01	Davidson et al.	Applicant
US6301582(B1)	2001-10-01	Johnson et al.	Applicant
US6339783(B1)	2002-01-01	Horikiri	Applicant
US6345276(B1)	2002-02-01	Lee	Examiner
US6401216(B1)	2002-06-01	Meth et al.	Applicant
US6421739(B1)	2002-07-01	Holiday	Applicant
US6442663(B1)	2002-08-01	Sun et al.	Applicant
US6480862(B1)	2002-11-01	Gall	Applicant
US6496871(B1)	2002-12-01	Jagannathan et al.	Applicant
US6622263(B1)	2003-09-01	Stiffler et al.	Applicant
US6629113(B1)	2003-09-01	Lawrence	Examiner
US6694346(B1)	2004-02-01	Aman et al.	Examiner
US6760815(B1)	2004-07-01	Traversat et al.	Applicant
US6763440(B1)	2004-07-01	Traversat et al.	Applicant
EP300516	1989-01-01		Applicant
EP330087	1989-08-01		Applicant
EP351536	1990-01-01		Applicant
EP384339	1990-08-01		Applicant
EP403124	1990-12-01		Applicant
EP472874	1992-03-01		Applicant
EP474340	1992-03-01		Applicant
EP483525	1992-05-01		Applicant
EP497022	1992-08-01		Applicant
EP555997	1993-08-01		Applicant
EP565849	1993-10-01		Applicant
EP569195	1993-11-01		Applicant
EP625750	1994-11-01		Applicant
EP651328	1995-05-01		Applicant
EP660231	1995-06-01		Applicant
EP697655	1996-02-01		Applicant
EP718761	1996-06-01		Applicant
EP767432	1997-04-01		Applicant
EP778520	1997-06-01		Applicant
EP794493	1997-09-01		Applicant
EP803810	1997-10-01		Applicant
EP803811	1997-10-01		Applicant
EP805393	1997-11-01		Applicant
EP810524	1997-12-01		Applicant
EP817020	1998-01-01		Applicant
EP817022	1998-01-01		Applicant
EP817025	1998-01-01		Applicant
EP836140	1998-04-01		Applicant
GB2253079	1992-08-01		Applicant
GB2262825	1993-06-01		Applicant
GB2305087	1997-03-01		Applicant
JP11-45187	1997-10-01		Applicant
WO92/07335	1992-04-01		Applicant
WO92/09948	1992-06-01		Applicant
WO93/25962	1993-12-01		Applicant
WO94/03855	1994-02-01		Applicant
WO96/03692	1996-02-01		Applicant
WO96/10787	1996-04-01		Applicant
WO96/18947	1996-06-01		Applicant
WO96/24099	1996-08-01		Applicant
WO98/02814	1998-01-01		Applicant
WO98/04971	1998-02-01		Applicant

Non-Patent Literature (119)

“Java ™ Remote Method Invocation Specification,” Sun Microsystems, Inc., <java.sun.com/products/ dkl.2beta1>, 1997.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 for Parallel Applications,” Yale University, pp. 1-23, Dec. 1, 1993.Applicant
Aldrich, et al., “Providing Easier Access to Remote Objects in Client-Server Systems,” System Sciences, 1998, Proceedings of the 31st Hawaii Internat'l. Conference, Jan. 6-9, 1998, pp. 366-375.Applicant
Aldrich, et al., “Providing Easier Access to Remote Objects in Distributed Systems,” Calif. Institute of Technology, www.cs.Caltech.edu/%7Ejedi/paper.html, Nov. 21, 1997.Applicant
Anderson, et al., “Persistent Linda: Linda + Transaction + Query Processing,” Proceedings of the 13th Symposium on Fault Tolerant Systems, pp. 93-109, 1991.Applicant
“Transparent Network Computing,” Locus Computing Corporation, Jan. 5, 1995.Applicant
Alexander, et al., “Active Bridging,” Proceedings of the ACM/SIGCOMM'97 Conference, Cannes, France, Sep., 1997.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. 33-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., “Distributed Garbage Collection for Network Objects,” Digital Systems Research Center, No. 116, pp. 1-18, Dec. 15, 1993.Applicant
Birrell, et al., “Grapevine: An Exercise in Distributed Computing,” Communications fo the ACM, vol. 25, No. 4, pp. 260-274, Apr. 1982.Applicant
Birrell, et al., “Network Objects,” DEC SRC Research Report 115, Feb. 28, 1995.Applicant
Birrell, et al., “Implementing Remote Procedure Calls,” ACM Transactions on Computer Systems, vol. 2, No. 1, pp. 39-59, Feb. 1994.Applicant
Birrell, et al., “Network Objects,” Operating Systems Review, 27(5), pp. 217-230, Dec. 1993.Applicant
Cannon, et al., “Adding Fault-Tolerant Transaction Processing to LINDA,” Software-Practice and Experience, vol. 24(5), pp. 449-466, May 1994.Applicant
Cardelli, “Obliq, A Lightweight Language For Network Objects,” Digital SRC, pp. 1-37, Nov. 5, 1993.Applicant
Carriero, et al., “Distribution Data Structures in Linda,” Principles of Programming Language, pp. 1-16, 1986.Applicant
Carriero, et al., “Distributed Data Structures in Linda,” Yale Research Report YALEU/DCS/RR-438, Nov. 1985.Applicant
Chung, et al., “A Tiny' Pascal Compiler: Part 1: The P-Code Interpreter,” BYTE Publications, Inc., Sep. 1978.Applicant
Chung, et al., “A Tiny' Pascal Compiler: Part 2: The P-Compiler,” BYTE Publications, Inc., Oct. 1978.Applicant
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
Deux, et al., “The O2 System,” Communications Of The Association For Computing Machinery, col. 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
Dollimore, et al., “The design of a System for Distributing Shared Objects,” The Computer Journal, No. 6, Cambridge, GB, Dec. 1991.Applicant
Dourish, “A Divergence-Based Model of Synchrony and Distribution in Collaborative Systems,” Xerox Technical Report EPC-1194-102, pp. 1-10, 1994.Applicant
Drexier, et al., “Incentive Engineering for Computational Resource Management,” The Ecology of Computation, Elsevier Science Publishers B.V., pp. 231-266, 1988.Applicant
Gelernter, et al., “Parallel Programming in Linda,” Yale University, pp. 1-21, Jan. 1995.Applicant
Droms, “RFC 1541 Dynamic Host Configuration Protocol,” <http://www.cis.ohio-state.edu.htbin/rfc/rfc1541.html>, pp. 1-33, Oct. 1993.Applicant
Emms, “A Difinition Of AN Access Control Systems Language,” Computer Standards And Interfaces, vol. 6, No. 4, pp. 443-454, Jan. 1, 1997.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
Gelernter, “Generative Communication in Linda,” ACM Transactions on Programming Languages and Systems, vol. 7, No. 1, pp. 80-112, Jan. 1985.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
Gray, et al. “Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency,” ACM, pp. 202-210, 1989.Applicant
Guth, “JavaOne: Sun to Expand Java Distriubted Computing Effor,” <http://www.sunworld.com/swol-Feb. 1998/swol-02-sunspots.html>, XP-002109935, p.1, Feb. 20, 1998.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
Hamilton, et al., “Subcontract: A Flexible Base for Distributed Programming,” Proceedings of 14th Symposium of Operating System Principles, Dec. 1993.Applicant
Hamilton, “Java and the Shift to Net-Centric Computing,” Computer, pp. 31-39, Aug. 1996.Applicant
Harris, et al., “Proposal for a General Java Proxy Class for Distributed Systems and Other Uses,” Netscape Communications Corp., Jun. 25, 1997.Applicant
Hartman, et al., “Liquid Software: A New Paradigm For Networked Systems,” Technical Report 96-11, Dept. 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
Pier, “A Retrospective on the Dorando, A High-Performance Personal Computer,” Xerox Corporation, Aug. 1983.Applicant
Pinakis, “Using Linda as the Basis of an Operating System Microkernel,” University of Western Australia, Dept. of Computer Science, pp. 1-165, Aug. 1993.Applicant
Riggs, et al., “Picking State in the Java ™ System,” USENIX, Association Conference on Object-Oriented Technologies and Systems, CP-002112719, pp. 241-250, Jun. 17-21, 1996.Applicant
Rosenberry, et al., “Understanding DCE,” Chapters 1-3, 6, 1992.Applicant
Sharrott, et al., “ObjectMap: Integrated High Performance Resources into a Distributed Object-oriented Environment,” ICODP, 1995.Applicant
Stevenson, “Token-Based Consistency of Replicated Servers,” IEEE, CH2686-4/89/0000/0179, pp. 179-183, 1989.Applicant
Thompson, “Regular Expression Search Algorithm,” Communications of the ACM, vol. II, No. 6, p. 149 et seq., Jun. 1968.Applicant
Venners, “Jini Technology, Out of the Box,” JAVAWORLD, 'Online!, pp. 1-4, Dec. 1998.Applicant
Waldo, et al., “Events in An RPC Based Distributed System,” Proceedings Of The 1995 USENIX Technical Conference, Proceedings USENIX Winter 1995 Technical Conference, New Orleans, LA, USA, 16-20, pages 131-142, Jan. 1995.Applicant
Wilson, et al., “Design of the Opportunistic Garbage Collector,” Proceedings of the Object Oriented Programming Systems Languages And Applications Conference, New Orleans, vol. 24, No. 10, Oct. 1989.Applicant
Wollrath, et al., “A Distributed Object Model for theJaca ™ System,” USENIX Association, Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996.Applicant
Wu, “A Type System For An Object-Oriented Database Systems,” Proceedings 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
Yin, et al., “Using Leases to Support Server Driven Consistency in Large-Scale Systems,” Computer Services Department, University of Texas at Austin, p. 285-294, May 26-28, 1998.Applicant
Yin, et al., “Volume Leases for Consistency in Large-Scale Systems,” IEEE Transactions on Knowledge & Data Engineering, vol. 11, No. 4, pp. 563-576, Jul./Aug. 1999.Applicant
Mitchell, et al., “An Overview of the Spring System,” Feb. 1994.Applicant
Mitchell, et al., “Mesa Language Manual,” Xerox Corporation, Palo Alto Research Center, 1978.Applicant
McDaniel, “An Analysis of a Mesa Instruction Set,” Xerox Corporation, May 1982.Applicant
McGrath, “Discovery and its Discontents: Discovery Protocols for Ubiquitous Computing,” Presented at Center for Excellence in Space Data and Information Science, NASA Goddard Space Flight Center, Apr. 5, 2000.Applicant
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 Commercial ORBs, pp. 203-215, John Wiley & Sons, Inc., 1996.Applicant
Ousterhout, et al., “The Sprite Network Operting System,” Computer, IEEE, pp. 23-36, Feb. 1988.Applicant
Pier, “A Retrospective on the Dorando, A High-Performance Personal Computer, IEEE Conference Proceedings, The 10th Annual International Symposium on Computer Architecture,” 1993.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 ™ Technical Disclosure Bulletin, “Object Location Algorithm,” vol. 36, No. 09B, pp. 257-258, Sep. 1993.Applicant
IBM, “Chapter 6—Distributed SOM (DSOM),” SOMobjects Developer Toolkit Users Guide, Version 2.1, pp. 6-1-6-90, Oct. 1994.Applicant
Anonymous, “Change-Notification Service for Shared Filed,” IBM Technical Disclosure Bulletin, vol. 36, No. 8, pp. 77-82, XP002109435 New York, US, Nov. 1973.Applicant
IBM ™ Technical Disclosure Bulletin, “Retrieval of Qualified Variables Using Extendible Hashing,” vol. 36, No. 12, pp. 301-303, Dec. 1993.Applicant
Anonymous, “Resource Preemption for Priority Scheduling,” IMB Technical Disclosure Bulletin, vol. 16, No. 6, p. 1931, XP002109435 New York, US, Nov. 1973.Applicant
IBM ™ Technical Disclosure Bulletin, “Local Network Monitoring to Populate Access Agent Directory,” vol. 36, No. 09A, pp. 403*405, Sep. 1993.Applicant
MUX-Electronik, Java 1.1 Interactive Course, www.lls.se/˜mux/javaic.html, 1995.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, “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
Liskov, et al., “Distributed Object Management in Thor,” International Workshop on Distributed Object Management, 1992.Applicant
Gosling, et al., “The Java ™ Language Specification,” Addison-Wesley, 1996.Applicant
Jaworski, “Java 1.1 Developer's Guide, 2nd Edition,” Sams.net, 1997.Applicant
Coulouris, et al., “Distributed Systems Concepts and Designs,” Second Edition, Addison-Wesley, 1994.Applicant
Mullender, “Distributed Systems,” Second Edition, Addison-Wesley, 1993.Applicant
Lindholm, et al., “The Java ™ Virtual Machine Specification,” Addison Wesley, 1996.Applicant
“SOAP: Simple Ojbect Access Protocol,” msdn online Web Workshop, Microsoft, Apr. 26, 2000, http://msdn.Microsoft.com/xml/general/soapspec.asp, 34 pages.Applicant
Rob Guth, “Sun tries on JacaSpaces for Distributed OS,” Aug. 1997, vol. 19, Issue 34, 2 pages.Applicant
Microsoft, “Microsoft.NET: Realizing the Next Generation Internet,” A Microsoft White Paper, Jun. 2000, 8 pages.Applicant
K. F. Eustice, et al., “A Universal Information Appliance,” IBM Systems Journal, vol. 38, No. 4, 1999, pp. 575-601.Applicant
Wycoff et al., “T Spaces,” IBM Systems Journal, vol. 37, No. 3-Java Technology, Aug. 1998, 36 pages.Applicant
Steve Morgan, “Jini to the Rescue,” IEEE Spectrum, Apr. 2000, vol. 37, No. 4, 8 pages.Applicant
Randy Kath, Managing Heap Memory in Win32, Microsoft Developer Network Technology Group, Apr. 3, 1993, 10 pages.Applicant
Randy Kath, “Managing Memory-Mapped Files in Win32,” Microsoft Developer Network Technology Group, Feb. 9, 1993, 9 pages.Applicant
Murali R. Krishnan, “Heap: Pleasures and Pains,” Microsoft Corporation, Feb. 1999, 6 pages.Applicant
Randy Kath, “The Virtual-Memory Manager in Windows NT,” Microsoft Developer Network Technology Group, Dec. 21, 1992, 12 pages.Applicant
“Verteilte Systeme,” Michael Weber, 1998 Spektrum Akademischer Verlag GmbH, pp. 258-261.Applicant
“Checkpointing and Its Applications,” Wang, et al., IEEE, 1995, pp. 22-31.Applicant
“Mobile Assistant Programming for Efficient Information Access on the WWW,” Perret, et al., Published by Elsevier Science B.V., 1996, pp. 1373-1383.Applicant
ColEm-DOS, “The Portable ColecoVision Emulator,” Version 1.0a, Oct. 27, 1998, by Marat Gayzulling, 3 pages.Applicant
“SourceForge.net: user-mode-linux-user,” Internet Document, Dec. 1999, XP002215321, retrieved from http://sourceforge.net/mailarchive/forum.php?forum_id=3647&max_rows=100&style=nested&viewmonth=1999 12, 10 pages.Applicant
Daniel Quinlan, “PCI NVRAM Card for Linux?,” Internet Document, Online!, Mar. 24, 1999, XP-002215322, 1 page.Applicant
Art Greenberg, “Re: Flash Memory Based System,” Internet Document, Online!, Jan. 26, 1998, XP-002215323, 1 page.Applicant
Bartosz Klimek, “Re: Against Virtual Memory,” Internet Document, Online!, Aug. 9, 1999, XP-002215324, 1 page.Applicant
Fransesco Lacapra, et al., “The Virtual Memory Scheme of Cosmos,” Proceedings of the Hawaii International Conf. On System Sciences, Jan. 6, 1992, XP-000856970, pp 43-51.Applicant
Andrew P. Black, “The Eden Project: Overview and Experiences,” EUUG, Sep. 22-25, 1986, (pp. 177-189).Applicant
Guy T. Almes, “The Evolution of the Eden Invocation Mechanism” Technical Report 83-01-03, Jan. 19, 1983, (15 pages).Applicant
Beogle et al., “Transparent Sharing of Java ™ Applets: A Replicated Approach”, IIST 97 Banff, 1997 (pp. 55-64).Applicant
Jul et al., “Fine-Grained Mobility in the Emerald System,” ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, (pp. 109-133).Applicant
Andrew P. Black, “The Eden Programming Language,” Technical Report 85-09-01, Sep., 1985, (19 pages).Applicant
Eric Jul, “Object Mobility in a Distributed Object-Oriented System,” Department of Computer Sciemce, 1989 (pp. 1-155).Applicant
Ken Arnold, “The Jini ™ Architecture: Dynamic Services in a Flexible Network,” ACM 1-58113-109-7/99, Jun. 1999, (7 pages).Applicant
Kolodner et al., “Atomic Garbage Collection: Managing a Stable Heap,” Laboratory for Computer Science, Massachusetts Institute of Technology, 1989 (pp. 15-25).Applicant
Oprchal, et al., “Efficient Object Serialization in Java,” Department of Electrical and Computer Science, University of Michigan, 1998 (6 pages).Applicant
“Class Object Input Stream,” Java ™ 2 Platform Std. Ed. V.13.1 (18 pages).Applicant
“Java ™ Object Serilization Specification,” Revision 1.43, JDK ™ 1.2, Nov. 30, 1998,)pp. 1-66).Applicant

Abstract

Description

Background of the Invention

[0001] 1. Field of the Invention

[0002] The present invention relates to the field of virtual machines, and more particularly to a database store method and system for a virtual persistent heap.

[0003] 2. Description of the Related Art

Java™

Java Remote Method Invocation (RMI)

K Virtual Machine (KVM)

Application Migration and Java

Orthogonal Persistence for Java

[0018] Still yet another limitation of the OPJ model is that it requires two separate garbage collectors, one for the “in-memory” heap and one for the persistent heap.

JVM Separation Models

Summary of the Invention

Database Store Method for a Virtual Persistent Heap

[0031] In one embodiment, the database store API may provide calls to manage the virtual persistent heap in the store. The calls may include, but are not limited to, calls to perform the following:

- [0032] Open the store
- [0033] Close the store
- [0034] Atomic read transaction (read a set of cache lines)
- [0035] Atomic write transaction (write a set of cache lines)
- [0036] Atomic delete transaction (delete a set of cache lines)
- [0037] Abort (stop a transaction)