REGISTER now for FREE 
|
FREE patent keyword monitoring and additional FREE benefits. REGISTER now for FREE
|
|
|
Data Processing: Database And File Management Or Data Structures > File Or Database Maintenance > File Allocation > Garbage Collection Garbage CollectionGarbage Collection patent applications listed are from June 2005 to current and include Date, Patent Application Number, Patent Title, Patent Abstract summary and are linked to the corresponding patent application page.10/12/06 - 20060230087 - System and method for adaptive garbage collection in a virtual machine environment A system and method for adaptive or dynamic garbage collection and memory management in computer systems and virtual machine environments, including Java virtual machines. Adaptive techniques attempt to constrain the system to consistently move towards the desired goal. In accordance with an embodiment, the system successively calculates a value of ... 08/24/06 - 20060190510 - Write barrier for data storage integrity A system that facilitates the storage of data using a write barrier. The system interfaces to a hardware component that stores data, and includes a write barrier component that dynamically employs instructions compatible with the hardware component to ensure data integrity during storage of the data. The write barrier component ... 08/03/06 - 20060173940 - Managed peer-to-peer file sharing A system and method for managed peer-to-peer (p2p) file sharing. The peer nodes can include a web browser and a p2p agent. The web browser can connect to the Internet and can interface with the p2p agent. The p2p agent provides the file sharing utilities for implementing the p2p network. ... 08/03/06 - 20060173939 - Garbage collection and compaction Provided are a method, system, and article of manufacture, wherein a plurality of objects are allocated in dynamic memory. Reversed references are determined for the plurality of objects, wherein a reversed reference corresponding to an object is an address of a location that has a valid reference to the object. ... 08/03/06 - 20060173938 - Method, apparatus and program stroage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints A method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints. The reorganization system identifies memory constraints, identifies processing capabilities and determines a number of reorganization processes and a combination of reorganization processes that provides a ... 07/27/06 - 20060167961 - Autonomic cache object array based on heap usage A method, apparatus and computer instructions for automatically regulating a cache object array based on the amount of available heap. The free space of the heap is determined after each garbage collection cycle and the amount of space allocated for cache object array growth is adjusted accordingly. Additionally, a default ... 07/27/06 - 20060167960 - Lazy timestamping in transaction time database Lazy timestamping in a transaction time database is performed using volatile reference counting and checkpointing. Volatile reference counting is employed to provide a low cost way of garbage collecting persistent timestamp information about a transaction by identifying exactly when all record versions of a transaction are timestamped and the versions ... 07/13/06 - 20060155792 - Methods and apparatus for managing a shared memory in a multi-processor system Methods and apparatus provide for associating memory allocation table (MAT) entries with nodes in a binary tree such that the nodes and the entries are grouped into hierarchical levels, each entry including status information; associating the nodes and the entries with segments of a shared memory of a multi-processor system ... 07/13/06 - 20060155791 - System and method for concurrent compacting self pacing garbage collection using loaded value and access barriers A method, system, and computer program product for managing a heap of memory allocated to a program being executed on a data processing system is disclosed. A limited amount of memory is allocated to a program being executed by a mutator on a data processing system. The memory comprises memory ... 06/29/06 - 20060143256 - Cache region concept Methods for a treatment of cached objects are described. In one embodiment, an application is configured to cache objects according to different caching treatments, each different caching treatment associated with its own region of cache. The configuring also involves installing a different combination of storage and eviction policy plug-ins for ... 06/22/06 - 20060136530 - System and method for detecting and certifying memory leaks within object-oriented applications A method is described by defining one or more classes within a software application as being in scope, any class not defined as being in scope are defined as being out of scope, all classes comprise at least one method. The method further determines an amount of allocated memory for ... 05/25/06 - 20060112155 - System and method for managing quality of service for a storage system The present invention provides a system and method for managing quality of service for a storage system that includes several file systems that share resources. The system may include a Quality of Service (QoS) manager and a request limitation process or “throttle” for limiting requests to the file systems based ... 05/04/06 - 20060095483 - Modified computer architecture with finalization of objects The present invention discloses a modified computer architecture (50, 71, 72) which enables an applications program (50) to be run simultaneously on a plurality of computers (M1, . . . Mn). Shared memory at each computer is updated with amendments and/or overwrites so that all memory read requests are satisfied ... 04/20/06 - 20060085494 - System and method for performing garbage collection based on unmanaged memory allocations The techniques and mechanisms described herein are directed to a method for performing garbage collection based on the total memory consumed by managed objects on a heap. The total memory includes heap memory and unmanaged memory. The garbage collector accepts input that indicates the amount of unmanaged memory and associates ... 04/20/06 - 20060085493 - Dual journaling store method and storage medium thereof The present invention provides a dual journaling storing method and a storage medium thereof, in which data are stored toward a central portion of a storage space of the storage medium from start and end locations when a flash memory or the like is used as a storage medium for ... 04/13/06 - 20060080372 - Compiler-driven dynamic memory allocation methodology for scratch-pad based embedded systems A highly predictable, low overhead and yet dynamic, memory allocation methodology for embedded systems with scratch-pad memory is presented. The dynamic memory allocation methodology for global and stack data (i) accounts for changing program requirements at runtime; (ii) has no software-caching tags; (iii) requires no run-time checks; (iv) has extremely ... 04/06/06 - 20060075007 - System and method for optimizing a storage system to support full utilization of storage space A system and method for optimizing a storage system to support full utilization of storage space are provided. With the system and method, data objects/containers of data objects are assigned retention values when they are created. These retention values may be dynamically modified based on a modification function associated with ... 02/16/06 - 20060036663 - Method and apparatus for effective data management of files A method and apparatus for effective data management of files are provided. A method for efficient data management of a file includes receiving a request to delete a file, searching for mapping blocks constituting the file in a block map which is constructed with a set of the mapping blocks, ... 01/05/06 - 20060004897 - Data structure and method for sorting using heap-supernodes An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further described a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for ... 01/05/06 - 20060004896 - Managing unwanted/unsolicited e-mail protection using sender identity A multi-test management of unwanted, unsolicited e-mail for potential SPAM wherein components of an e-mail from a sender directed to a recipient comprising any one of an envelope, one or more headers or a body, the sender having a sender identity are used to verify the sender identity. When the ... 11/17/05 - 20050256913 - System and method for regeneration of methods and garbage collection of unused methods A system and method for improving the effectiveness of a data processing application when using a virtual machine, where the program includes many methods, i.e. program sections, that are stored in the memory of the computer used, and where garbage collecting is used by said program. Thread stacks are first ... 10/27/05 - 20050240641 - Method for predicting and avoiding danger in execution environment Measurement/analysis unit in a Java virtual machine has the function of measuring data when an event of garbage collection occurs, and the function of periodically measuring data. The measurement/analysis unit analyzes the measured data and predicts a danger of a memory shortage, and predicts a danger using an algorithm depending ... 09/29/05 - 20050216539 - Integration of mark bits and allocation bits A method, apparatus, and system are provided for integrating mark bits and allocation bits. According to one embodiment, a single space is allocated for accommodating a mark bit and an allocation bit. The mark bit and the allocation bit are integrated into a mark/allocation bit using the single space allocated. ... 09/08/05 - 20050198088 - Method and system for improving the concurrency and parallelism of mark-sweep-compact garbage collection An arrangement is provided for using only one bit vector per heap block to improve the concurrency and parallelism of mark-sweep-compact garbage collection in a managed runtime system. A heap may be divided into a number of heap blocks. Each heap block has only one bit vector used for marking, ... 07/21/05 - 20050160120 - Methods and apparatus for modifying a retention period for data in a storage system One embodiment is a method and apparatus for modifying retention periods in a storage system, in which previously defined retention periods for units of data may be reduced. In another embodiment, the retention period of a unit of data may be modified in response to the occurrence of an event ... 07/07/05 - 20050149589 - Garbage collector with eager read barrier A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally ... 07/07/05 - 20050149588 - Method and apparatus for optimizing away a null-check A garbage collection system that needs to meet real-time requirements combines a null-check required for an application with a null check required by its read barrier. The null-check for the application may be the null-check required for a Java object dereference and may be performed via explicit comparisons or implicit ... 07/07/05 - 20050149587 - Breaking read barrier to apply optimizations A garbage collection system that needs to meet real-time requirements utilizes a read barrier that is implemented in an optimizing compiler. The read barrier is implemented with a forwarding pointer positioned in a header of each object. The forwarding pointer points to the object unless the object has been moved. ... 06/23/05 - 20050138092 - Relative positioning and access of memory objects A garbage collector including a bit mapper operative to designate a plurality of regions within a memory, associate any of a plurality of objects with any of the regions if the start address of the object to be associated lies within the region, and record the relative location of a ... 06/02/05 - 20050120064 - Method and mechanism for determining life intervals for a key in an index Disclosed is a mechanism, system, interface, and process to determine one or more life intervals when given a key. In addition, one or more life intervals can be determined for each key within a range of keys. This type of process is useful for auditing purposes or if it is ... ### FreshPatents.com Support |