Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-06-30
2003-09-30
Jung, David (Department: 2175)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06629113
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention provides an improved data processing system and, in particular, provides a method and apparatus for memory management in a data processing system. Still more particularly, the present invention provides an improved functionality within a garbage collector in a data processing system.
2. Description of Related Art
A virtual machine, such as a Java virtual machine (JVM), typically allocates memory for the instantiation of an object from a free memory area called a heap. The allocation and freeing of memory in the heap is usually allocated and freed in set blocks. A single heap exists within a Java virtual machine instance. A separate heap, however, exists for each instance of the Java virtual machine. Since each application is associated with a single instance of a Java virtual machine, two Java applications will not trample or use each other's heap data. The Java virtual machine has instructions to allocate memory on the heap for a new object but includes no instructions for freeing or deallocating previously allocated memory. Hence, the Java virtual machine is responsible for deciding whether and when to free or deallocate memory occupied by objects that are no longer referenced by a running application. A garbage collector in the Java virtual machine performs garbage collection to reclaim the memory space used by objects that are no longer referenced by an application. The reclaimed memory is then recycled by reallocating the memory space for other objects.
The Java Virtual Machine (JVM) architecture relies heavily on the use of garbage collection as a core part of its memory management strategy. Garbage collection is the name given to the task of: automatically determining which blocks of memory can be freed by marking them as no longer needed by an application when they fall “out of scope” during program execution; collecting all of these blocks of memory at periodic intervals; returning them to the heap; and marking the blocks as available for use. This process of “collecting the garbage” must be done skillfully as the garbage collection process, while freeing resources, can itself consume system resources, particularly processor time.
Virtual machine platforms are an evolving computing platform with Java being the most prevalent of these platforms. One of the most touted features of Java is its portability. With the “write once, run anywhere” concept, it is envisioned that a Java application or applet could run on a mainframe computer, and without modification, also run on a hand-held device, a Personal Digital Assistant (PDA), a printer, or some other output device. Obviously, a PDA and a mainframe computer have widely varying computing resources. A Java virtual machine running on each of these platforms may have widely varying amounts of memory or bandwidth at its disposal, and a properly designed JVM should take advantage of the available resources while accomplishing the goal of portability. In order to achieve these goals with respect to memory management, it is desirable to have a single design of a JVM that addresses the common problems of performance and portability.
The exact garbage collection strategy used by a JVM will vary depending on the type of system upon which the JVM is executing. In current JVM implementations, the garbage collector is a “built-in” component in the JVM, i.e. different garbage collectors cannot be plugged in for different circumstances. Hence, the deployment of a particular JVM for a particular computer platform usually dictates the garbage collection strategy that will be employed within the JVM.
Many different algorithms have been employed in different garbage collector implementations. These algorithms are typically tailored to the type of environment in which the Java programs are executing. For example, server applications in a multi-user multiprocessor environment tend to have a memory-use profile that differs from a desktop computer environment. Furthermore, embedded-Java devices, such as cell phones, and handheld devices, such as those that use the Microsoft WinCE operating system, have different memory-use profiles.
Maintaining different garbage collectors for different JVMs can be expensive for providers of JVMs. A single garbage collector is designed to implement one particular strategy and cannot be modified “on-the-fly” to change its strategy, and a single garbage collector is built into each JVM instance depending upon the computer platform on which the JVM executes. Providers of JVMs must then track, service, and support these JVM instances.
Moreover, one cannot guarantee that an installed JVM will have a given level of performance. On any given day, a particular set of garbage collection characteristics, i.e. garbage collection algorithm metrics, will be better for one device but possibly not for another device. For example, a device with a small amount of memory may require a very aggressive garbage collector whereas as a large server with lots of memory may require a relaxed approach. However, if at some later point in time, more memory is added to a device that already has an installed JVM, the garbage collection strategy of the JVM cannot be modified to conform with the larger amount of memory. In another example, a server with an installed JVM may be modified by adding additional processors. In each case, a different JVM would need to be installed with a different type of garbage collection algorithm in order to adapt the performance of the garbage collector to the performance characteristics of the hardware platform. Reinstallation of a complete Java environment may be expensive and time-consuming.
Therefore, it would be advantageous to have an improved method and apparatus for managing memory in a data processing system. It would be particular advantageous to have a method and apparatus for managing memory with an improved garbage collector.
SUMMARY OF THE INVENTION
The present invention provides a method, system, and computer-program product for a dynamically adjustable and configurable garbage collector. Values for an environment variable or set of variables or parameters are obtained by the dynamic garbage collector. The variables may be set through user input or upon configuration of a computer platform. The values of the variables may be modified or updated during execution of the garbage collector, which receives or retrieves the newly modified values. The garbage collector then performs memory management functions according to a behavioral algorithm that incorporates the values of the environment variables or parameters or according to a behavioral algorithm that is selected by the environment variable.
REFERENCES:
patent: 5734861 (1998-03-01), Cohn et al.
patent: 5784553 (1998-07-01), Kolawa et al.
patent: 5787431 (1998-07-01), Shaughnessy
patent: 5832529 (1998-11-01), Wollrath et al.
patent: 5842016 (1998-11-01), Toutonghi et al.
patent: 5845298 (1998-12-01), O'Connor et al.
patent: 5848423 (1998-12-01), Ebrahim et al.
patent: 5857210 (1999-01-01), Tremblay et al.
patent: 6519615 (2003-02-01), Wollrath et al.
patent: 6529909 (2003-03-01), Bowman-Amuah
patent: 6539396 (2003-03-01), Bowman-Amuah
patent: 0383097 (1990-08-01), None
Cook et al., “Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Oject Databases”, SIGMOD 96, Jun., 1996.*
Kordale et al., Distributed/concurrent garbage collection in distributed shared memory systems, Object Orientation in Operating Systems, 1993, Proceedings of the Third International Workshop on, Dec. 9-10, 1993, pp. 51-60.*
Willard et al., Autonomous garbage collection: resolving memory leaks in long running network applications, Computer Communications and Networks, 1998, Proceedings, 7th International Conference on, Oct. 12-15, 1998, pp. 886-896.*
Ding et al., Cache performance of chronological garbage collection, Electrical and Computere Engineering, 1998, IEEE Candadian Conference on, vol. 1, May 24-28, 1998, pp. 1-4, vol. 1.*
Venner, Bill; Inside the Java Virtual Machine; 1
Formby Betty G.
Jung David
Yee Duke W.
LandOfFree
Method and system for dynamically adjustable and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for dynamically adjustable and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for dynamically adjustable and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3031073