Entries |
Document | Title | Date |
20100049775 | Method and System for Allocating Memory in a Computing Environment - A method and product for allocating memory in a computing environment, the method comprising providing a memory allocation routine adapted to use mmap( ) with a MAP SHARED or equivalent flag specified so that the memory is allocated from a file system buffer cache. In one embodiment, the method comprises allocating the memory by using mmap( ) with a MAP_SHARED or equivalent flag specified so that the memory is allocated from a file system buffer cache. | 02-25-2010 |
20100057818 | PERFORMING DEFRAGMENT ON HARD DISK OF HOST MACHINE HAVING A VIRTUAL MACHINE - A method, system, and article of manufacture tangibly embodying computer readable instructions for performing defragment on a physical hard disk of a host machine system having a virtual machine (VM) system. The host machine system performs contiguous storage of each file on the VM and the host machine with only one defragment. The host machine obtains a physical position distribution of data blocks in the hard disk constituting a VM file in the VM system according to VM file allocation information of the VM system and the host machine system file allocation information. | 03-04-2010 |
20100082710 | SYSTEM AND METHOD FOR OPTIMIZING WRITE BARRIER IN GARBAGE COLLECTION - A system and associated method for optimizing a write barrier in garbage collection. The method marks a bit in a bitmap corresponding to a slot when the slot content is modified to refer to a new object. The method also logs the address of the slot when the object referred by the slot is updated. The method pops the address of the slot to clean from the log and clears the bit corresponding to the slot in the bitmap and when the object referred to by the slot is not already marked, marking said object and pushing its address to the mark stack. When the slot is located within an active object range, the method puts the address of the slot in a deferred log for a later processing. | 04-01-2010 |
20100114997 | ALLOCATION CACHE PREMARKING FOR SNAP-SHOT-AT-THE-BEGINNING CONCURRENT MARK-AND-SWEEP COLLECTOR - Tracking newly created objects during a garbage collection cycle includes marking newly allocated objects in the GC cycle during the allocation cache population phase. The goal is to take a high performance system for tracing live objects, such as the mark map, and combine the SATB with a cached allocation system for heap memory such that SATB representation is preserved. Embodiments combine both efficient support for an SATB model during a collection cycle and a highly optimized allocation path for heap objects in an allocation scheme (which may optionally be a size segregated class allocation scheme) that allows both mechanisms to co-exist effectively. Specifically, embodiments track newly created objects during a GC cycle such that they are kept alive during the trace phase while continuing to support a highly efficient allocating caching strategy. | 05-06-2010 |
20100114998 | Incremental lock-free stack scanning for garbage collection - Concurrent, incremental, and lock-free stack scanning for garbage collectors is disclosed. This method uses a summary table and return barriers to allow high responsiveness. The method also supports programs that employ fine-synchronization to avoid locks, imposes negligible overhead on program execution, can be used with existing concurrent collectors, and supports the special in-stack references existing in languages such as C#. | 05-06-2010 |
20100138460 | MEMORY POWER CONTROL METHOD AND MEMORY POWER CONTROL PROGRAM - A method and a computer readable article of manufacture for controlling memory power consumption on a computer. The method includes a memory having a power saving mode and performs a garbage collection for collecting no-longer-needed objects in groups the no-longer-needed objects being allocated to memory blocks obtained by dividing a memory's address space by a predetermined constant size. The method includes the steps of dividing a heap area of the memory into a number of sub-heap areas; managing the sub-heap areas; and changing the number of sub-heap areas used for garbage collection based on a magnitude correlation between a required time for the garbage collection and a predefined target value. | 06-03-2010 |
20100161687 | SYSTEM AND METHOD FOR OPTIMIZING GARBAGE COLLECTION WITH ALLOCATION MODIFIERS - A system and associated method for optimizing memory allocation and garbage collection. An allocation modifier is employed to declare a data object in a source code. The allocation modifier describes an expected lifespan of the data object being declared. The interpreter allocates the data object in an area of a heap space that is associated with the expected lifespan such that a garbage collector suffers from less overhead in scanning data objects that will survive a garbage collection cycle. Also, the heap space also has less fragmentation as the data object is allocated in the area associated with the expected lifespan such that the data object does not need to be relocated. | 06-24-2010 |
20100161688 | ASYNCHRONOUS DISTRIBUTED GARBAGE COLLECTION FOR REPLICATED STORAGE CLUSTERS - A method may be performed by a device of a group of devices in a distributed data replication system. The method may include storing objects in a data store, at least one or more of the objects being replicated with the distributed data replication system, and conducting a scan of the objects in the data store. The method may further include identifying one of the objects as not having a reference pointing to the object, storing a delete negotiation message as metadata associated with the one of the objects, and replicating the metadata with the delete negotiation message to one or more other devices of the group of devices. | 06-24-2010 |
20100198885 | METHOD AND SYSTEM FOR EXECUTING A TASK AND MEDIUM STORING A PROGRAM THEREFOR - A method of executing a task includes executing, by using a processor, a first task including a low-frequency task in which garbage is collected using a garbage collector, initializing a second task including a high-frequency task by constructing an instance of a class that implements a standard runnable thread interface, and creating a data structure for supporting communication between the second task and lower priority threads, the data structure being accessible by a thread running in a garbage-collected heap in the first task to communicate data between the high-frequency task and the low-frequency task, validating the second task to ensure that the second task is executable without synchronizing with the first task, instantiating the second task to create a class for executing the second task; and after the instantiating the second task, executing the second task, the garbage collector being preemptable by the second task. | 08-05-2010 |
20100205230 | Method and System for Inspecting Memory Leaks and Analyzing Contents of Garbage Collection Files - A system and method is provided to inspect memory leaks and analyze contents of garbage collection files. In one embodiment, a garbage collection file is selected from a plurality of garbage collection files at a file system. The garbage collection file includes histograms. Each histogram is compared with other histograms in the garbage collection file to identify objects associated with memory leaks The results of such comparison are provided. | 08-12-2010 |
20100235412 | METHOD TO REDUCE WASTED CHARACTER DATA AREAS OF JAVA STRINGS - A string handling method, program, and information processing apparatus capable of reducing the amount of data stored in a storage. An information processing apparatus handles strings. The information processing apparatus includes a storage storing a group of strings including a plurality of strings each of which consists of a plurality of pieces of character data, a reference section which refers to a particular string in the group of strings, a character data detecting section which detects character data that is not referenced as the particular string in the group of strings, and a character data deleting section which deletes the detected character data from the group of strings. | 09-16-2010 |
20100250629 | MEMORY MANAGEMENT METHOD AND COMPUTER - A memory management method is provided to manage a memory in which areas of a garbage collected Java heap memory and a non-garbage collected external heap memory can be secured, by using a program executed by a processor in a computer. If it is judged that there is no reference to all data arranged in the external heap memory or starting point data of reference relations included in the all data, from data arranged outside the external heap memory, then the external heap memory is judged to be capable of being deallocated. As a result, it becomes possible to implement memory management in which garbage collection needing a long time program stop is not conducted and an additional API is not used. | 09-30-2010 |
20100262636 | 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 points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier. | 10-14-2010 |
20100268750 | METHOD AND ELECTRONIC DEVICE FOR MANAGING CONTENT - The invention provides a method and an electronic device. The electronic device ( | 10-21-2010 |
20100274827 | TIER-BASED DATA MANAGEMENT - The present invention addresses the deficiencies of the related art by providing a tier-based data storage solution. Specifically, the present invention evaluates the data contained in database tables by analyzing several metrics for the data, and creating a valuation score. The valuation score is used to determine the storage tier that would meet the performance and availability requirements of the database with the goal of reducing the costs associated with storing that data. The metrics that are used to evaluate database tables include (among others): table purpose, data retention, disk requirements, data criticality, data relevance, and desired performance. As such, the present invention will develop a data (lifecycle) storage plan for each set of data. This storage plan not only identifies an initial storage tier where the data should be stored, but also identifies, if, when and to where the data should be moved thereafter. | 10-28-2010 |
20100274828 | Electronic Device, Storage Area Allocation Method for File System, and Computer Product - According to one embodiment, an electronic device includes a dividing module and an allocation module. The dividing module divides a data storage area, to which file data constituting a file is to be written, into a plurality of management areas. The data storage area is in the storage area of a storage medium. The allocation module allocates, upon receipt of a write request to write file data, an area to the file data corresponding to the write request as a write area. The write area is subsequent to an area where file data is written in a management area where file data constituting the same file as the file data corresponding to the write request is written. | 10-28-2010 |
20100281080 | Use of Delete Notifications By File Systems And Applications To Release Storage Space - In accordance with one or more aspects, one or more portions of each of multiple files that have been freed are determined. One or more delete notifications are generated identifying the one or more portions of the multiple files. Each portion is identified as a range of data on a storage device, and each delete notification includes one or more ranges of data on the storage device. These generated delete notifications are then sent to a storage stack. Additionally, an application can determine that one or more ranges of data of a storage device are to be freed and send a delete notification, in the absence of a file system on the device, to the storage stack identifying the one or more ranges of data of the storage device that are to be freed. | 11-04-2010 |
20100287216 | Grouped space allocation for copied objects - A method of efficiently allocating space for copied objects during garbage collection by grouping many objects together, and after determining which objects belong to a group, allocating space for them in one unit and copying the objects to the allocated space (possibly in parallel). | 11-11-2010 |
20100287217 | HOST CONTROL OF BACKGROUND GARBAGE COLLECTION IN A DATA STORAGE DEVICE - An apparatus includes a flash memory data storage device and a host operably coupled to the data storage device via an interface. The flash memory data storage device includes a plurality of memory chips. The host includes a host activity monitoring engine configured to monitor activity of the host and a garbage collection control engine configured to control the background garbage collection performed by the data storage device's garbage collector. | 11-11-2010 |
20100293206 | Clustering related objects during garbage collection - Clustering related objects in a region-based garbage collector is solved by associating one or more regions with each cluster, and allocating objects from a region belonging to the primary cluster for the object. Relatedness may refer to, e.g., proximity to a cluster center (such as topic) in a persistent knowledge base or a home node in a distributed object system. The cluster for an object may be determined, e.g., from reachability from particular roots or objects during global tracing. For new objects, the initial cluster may be guessed based on history of where objects allocated in that call site have recently been clustered (possibly several stack frames deep). | 11-18-2010 |
20100318584 | Distributed Cache Availability During Garbage Collection - Techniques are described herein for managing access to a distributed cache during garbage collection. When garbage collection is to be performed with respect to a node, the node may send a request to a data manager requesting to have an instance of data module(s) included in the node that are in a primary state placed in a secondary state. The data manager may change the state of the data module(s) to the secondary state. The data manager may change the state of another instance of the data module(s) that is included in another node to the primary state. When the garbage collection is complete with respect to the node, the node may send another request to the data manager requesting that the data module(s) that were placed in the secondary state be returned to the primary state. The data manager may return those data module(s) to the primary state. | 12-16-2010 |
20100332563 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM - An information processing apparatus includes, a file output detector configured to detect a request for performing a process of outputting a file from a first storage medium, and a program addition processing unit configured to add a data deleting program to the file to be output when the file output detector detects the request for performing the process of outputting a file, wherein the data deleting program causes an apparatus which received the file to perform a method, the method including determining whether a preset period of time has been elapsed, and deleting at least part of data of the file when it is determined that the preset period of time has been elapsed. | 12-30-2010 |
20110004641 | Parallelized, Incremental Garbage Collector - A method for garbage collection in which resources used by data objects in a computer program that are not accessed in the future are reclaimed, the method consists of the following steps of 1. Providing a tracing garbage collector which is both parallelized and incremental; 2. Integrating the collector with the computer program to create the mutator; 3. Instructing the mutator to scan and collect resources used by data objects in a computer program that are not accessed in the future simultaneously on all threads in small amounts; and 4. Interleaving the mutator scanning and collection with unrelated processing by the computer program such that all of the threads in the application are never stopped simultaneously for any portion of the collection cycle. | 01-06-2011 |
20110016164 | Image Processing Apparatus - An image processing apparatus having: an image data inputting section; a storage section that stores image data that has been input from the inputting section; a processing section that carries out output processing of the image data; a history management section that establishes correspondence between history information of the output processing and the image data and manages the history information; a warning section; and a control section that, in response to a deleting request for the image data stored in the storage section, based on the history information of the output processing, changes a mode of the warning given out by the warning section of confirming the deleting of the image data. | 01-20-2011 |
20110055294 | CELLULAR TERMINAL DEVICE, E-MAIL DELETION METHOD, AND RECORDING MEDIUM - A cellular terminal device including a memory for storing a received e-mail, a deletion order determiner for determining a deletion order of a plurality of e-mails stored on the memory based on an operation of a user or history information related to a mail sender and a deletion processor for deleting an e-mail stored on the memory in accordance with the deletion order determined by the deletion order determiner. | 03-03-2011 |
20110113075 | GARBAGE COLLECTION PROGRAM, GARBAGE COLLECTION METHOD, AND GARBAGE COLLECTION SYSTEM - A computer-readable storage medium storing a garbage collection program allows a computer to execute: copying valid data from a first block in a first storage device to a second storage device; instructing an exclusive mechanism to perform exclusive control of accessing to the valid data in the first block; switching an access path to the valid data in the first block, to the valid data in the second storage device; instructing the exclusive mechanism to release the exclusive control; copying the valid data in the second storage device to a second block in the first storage device to collect; instructing the exclusive mechanism to perform exclusive control of accessing to the valid data in the second storage device; switching an access path to the valid data in the second storage device, to the valid data in the second block; and instructing the exclusive mechanism to release the exclusive control. | 05-12-2011 |
20110125812 | Managing Memory - Methods, systems, and products for managing memory. In one general embodiment, the method includes assigning an isolated virtual heap in a global kernel heap of a global operating system environment to each of a plurality of isolated virtual operating system environments operating in a global operating system environment; and in response to an invocation of kernel heap memory allocation from one of the isolated virtual operating system environments, dynamically allocating memory to the invoking isolated virtual operating system environment from the virtual kernel heap assigned to the invoking isolated virtual operating system environment. The method may also include running the plurality of isolated virtual operating system environments in the global operating system environment. The plurality of isolated virtual operating system environments may share a single common kernel. The isolated virtual operating system environments may run under the same operating system image. | 05-26-2011 |
20110153689 | CONFIRMING THE SENSITIVITY OF A DATA OBJECT IN A MANAGED OBJECT HEAP - A method, system and computer program product for confirming the sensitivity of a data object in a managed object heap software runtime environment based on a determination that the object is accessible only via other objects known to be sensitive. | 06-23-2011 |
20110196901 | System and Method for Determining the Age of Objects in the Presence of Unreliable Clocks - A system and method for determining an age of an object is provided. A first index for a timestamp entry in a sequence of timestamps corresponding to a time at which an object was created is identified. At least one subsequence of timestamps from the sequence of timestamps having indexes for entries in the sequence of timestamps that are between the first index in the sequence of timestamps and a last index for a last timestamp entry in the sequence of timestamps is identified, wherein the at least one subsequence of timestamps conforms to a function of a time interval between storage of consecutive current timestamps reported by clock of the computer system. Timestamps from the sequence of timestamps that are not included in the at least one subsequence of timestamps are removed. An age of the object is determined based on the at least one subsequence of timestamps. | 08-11-2011 |
20110202578 | SEMICONDUCTOR MEMORY DEVICE - According to one embodiment, a semiconductor memory device performs writing of data to a semiconductor memory element in response to a request to write the data with a specified logical block address from a host and performs writing of valid data to the semiconductor memory element for compaction according to a log-structured method. The semiconductor memory device adjusts a frequency of the writing response to a request from the host and a frequency of the writing for compaction according to a predetermined ratio. | 08-18-2011 |
20110225213 | LOOP CONTROL FLOW DIVERSION - Loop control flow diversion supports thread synchronization, garbage collection, and other situations involving suspension of long-running loops. Divertible loops have a loop body, a loop top, an indirection cell containing a loop top address, and a loop jump instruction sequence which references the indirection cell. In normal execution, control flows through the indirection cell to the loop top. After the indirection cell is altered, however, execution flow is diverted to a point away from the loop top. Operations such as garbage collection are performed while the loop (and hence the thread(s) using the loop) is thus diverted. The kernel or another thread then restores the loop top address into the indirection cell, and execution flow again continues through the restored indirection cell to the loop top. | 09-15-2011 |
20110225214 | Systems and Methods for Garbage Collection in Deduplicated Data Systems - A computer-implemented method for garbage collection in deduplicated data systems may include: 1) identifying a deduplicated data system, 2) identifying at least one segment object added to the deduplicated data system during a garbage-collection process of the deduplicated data system, 3) locking the segment object to prevent removal of the segment object by the garbage-collection process, and 4) unlocking the segment object after the garbage-collection process. The method may allow a small possibility of incorrectly removing useful segment objects. The method may also verify data objects during the garbage-collection process and recover incorrectly removed segment objects. Various other methods, systems, and computer-readable media are also disclosed. | 09-15-2011 |
20110276610 | METHOD AND SYSTEM FOR SCRUBBING INFORMATION - In production applications that process and transfer secure and sensitive customer data, the heap dump files of these applications, which may be useful for debugging production issues and bugs, may contain secure and sensitive information. Thus, to make the useful debugging information available in heap dumps from production applications without compromising secure client data to those assigned to debugging and fixing production issues, these heap dumps may be scrubbed of sensitive information without scrubbing information that is useful for debugging. | 11-10-2011 |
20110282920 | REQUEST PROCESSING SYSTEM, METHOD AND PROGRAM PRODUCT - A processing method has been claimed for reducing the average wait time of requests in a queue in a system environment where garbage collection may occur. In the method, a computer system treats as a unit each request in a queue and a completion time of garbage collection that may occur at the time of processing the request, and processes requests preferentially and systematically in ascending order of the processing times of the units including the garbage collection times, thereby, reducing the average wait time of the requests. While, the computer system managing the queue knows the remaining amount of heap just before processing a certain request, the computer system statistically calculates in advance the amounts of heap to be consumed on a request type basis and holds the values. Accordingly, before processing a certain request, the computer system can predict whether or not the processing of the request will cause garbage collection, in consideration of the estimated heap consumption of the request and the remaining amount of heap in the memory. | 11-17-2011 |
20110302223 | Anti-Item for Deletion of Content In A Distributed Datastore - The invention provides an efficient apparatus and method for deleting items within a distributed datastore. Deletion of items is accomplished using anti-items having the same structure as a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item, wherein the single tag, flag, or bit but does not affect the location at which a data item or anti-item is ultimately stored within the datastore, thereby ensuring that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item. | 12-08-2011 |
20110307529 | AUTOMATICALLY RECLAIMING MEMORY SPACE - A method, in one embodiment, can include determining whether an administrative task for a file system is to be performed within a thin storage memory array. Furthermore, if the administrative task for the file system is to be performed, a determination is made as to whether memory space is freed up while performing the administrative task. If memory space is freed up while performing the administrative task, a determination is made as to whether the freed up memory space satisfies a predefined contiguous memory space threshold. If the predefined contiguous memory space threshold is satisfied by the freed up memory space, a determination is made as to whether a memory space reclamation process is to be performed. If the memory space reclamation process is to be performed, the freed up memory space is reclaimed from the file system. | 12-15-2011 |
20110307530 | INCREMENTAL GARBAGE COLLECTION OF DATA IN A SECONDARY STORAGE - A method and apparatus for different embodiments of incremental garbage collection of data in a secondary storage. In one embodiment, a method comprises locating blocks of data in a log that are referenced and within a range at a tail of the log. The method also includes copying the blocks of data that are referenced and within the range to an unallocated segment of the log. | 12-15-2011 |
20120011174 | Methods and Apparatus For Controlled Removal of Content from A Distributed Network - Described herein are techniques for managing content stored on a distributed network. Content is initially placed onto the network and populated across one or more nodes. The content is distributed in association with decay parameters that define a lifetime for the population of the content on the network. Various communication nodes of the distributed network are configured to process the content decay parameters to determine whether to delete the content during subsequent time periods. | 01-12-2012 |
20120023144 | Managing Wear in Flash Memory - At least two groupings are established for a plurality of erase units. The erase units include flash memory units that are available for writing subsequent to erasure. The groupings are based at least on a recent write frequency of data targeted for writing to the erase units. A wear criteria is determined for each of the erase units and the erase units are assigned to one of the respective groupings based on the wear criteria of the respective erase units and further based on a wear range assigned to each of the at least two groupings. | 01-26-2012 |
20120078982 | Garbage Collection Extensibility Via Managed Code - A garbage collector includes a core, and extension handlers to support collection of objects of a designated managed class. The handler, which may be implemented in managed code, receives notification of garbage collection phases, and receives control from the core when the core encounters an object of the designated class. The handler can then thread together discovered objects of the designated class, walk a list of objects and detect whether any are unreachable, and/or provide an executor for the designated class. The core notifies handlers about progress in tracing strong pointers, tracing weak pointers, pointer update, pinning, weak pointer forwarding, and untraced pointer relocation. A pointer can be marked as untraced, so the core ignores it during pointer tracing phases. If the core encounters an object which has a weak pointer field, the core can pass control to a handler's tracing method. The core may perform generational garbage collection. | 03-29-2012 |
20120124105 | SYSTEM AND METHOD FOR IMPROVED GARBAGE COLLECTION OPERATIONS IN A DEDUPLICATED STORE BY TRACKING TEMPORAL RELATIONSHIPS AMONG COPIES - Systems and methods are disclosed for performing garbage collection to identify content segments no longer referenced in a deduplicating storage system in which redundant mark operations in a mark-and-sweep technique are avoided. An organized arrangement of hash structures is created for each data object, wherein each structure includes a hash signature for a corresponding content segment and is associated with a reference to the corresponding content segment, and the logical organization of the arrangement represents the logical organization of the content segments as they are represented within the data object. Additionally, for each data object, temporal states are maintained over time. Garbage collection iterates over the temporal structures and, for each temporal structure, marks the garbage collection state for the associated content segments for only the content segments that have changed relative to an immediately prior temporal state of the data object. | 05-17-2012 |
20120131069 | OBJECT CONSOLIDATION TO A GRID OF A VIRTUAL MACHINE - A method for consolidating objects to a grid of a virtual machine may include allocating, by a virtual machine operating on a processing device, each new object into an allocate space of a new memory area for newly created objects in a virtual machine memory of the virtual machine. The new memory area may include the allocate space and a survivor space. The method may also include performing a garbage collection process in response to the allocate space becoming substantially full of objects and copying at least some objects in the allocate space into either the survivor space or a tenured space in the virtual machine memory in response to the garbage collection process. The method may also include transferring a selected object from the tenured space to the grid of the virtual machine in response to a predetermined criterion. | 05-24-2012 |
20120136906 | FIXUP CACHE TOOL FOR OBJECT MEMORY COMPACTION IN AN INFORMATION HANDLING SYSTEM - An operating system or virtual machine of an information handling system (IHS) initializes a garbage collector to provide object memory compaction during application execution. The operating system or virtual machine performs move and fixup management within heap or object memory stores. The garbage collector identifies holes or unused portions of heap memory and moves one or more objects during compaction operations. After the garbage collector moves the object, a fixup cache tool fixes up the object pointers within the object. The fixup cache tool maintains a fixup cache that includes pointer information corresponding to the objects that the garbage collector moves. The fixup cache tool employs the pointer information within the fixup cache to update or otherwise fixup the objects within the heap that the garbage collector moves during compaction operations. The fixup cache may provide predictive pointer update information during fixup operations for each object move within the heap. | 05-31-2012 |
20120166498 | GARBAGE COLLECTION IN A MULTIPLE VIRTUAL MACHINE ENVIRONMENT - Garbage collection processes are automatically tuned on a system comprising a plurality of virtual machines running on a physical processing device with multiple physical processors. Tuning is implemented for each garbage collection process, by updating a load variable to reflect that a new garbage collection process has started, the load variable having a value that is based at least in part on a number of garbage collection processes that are currently running on the system. Tuning further comprises creating a number of garbage collection threads based at least in part on the current value of the load variable and/or number of processors, where the garbage collection threads are used to perform at least a portion of at least one phase of the new garbage collection process. Tuning further comprises re-updating the load variable to reflect completion of the new garbage collection process. | 06-28-2012 |
20120215818 | REQUEST PROCESSING SYSTEM, METHOD AND PROGRAM PRODUCT - A processing method has been claimed for reducing the average wait time of requests in a queue in a system environment where garbage collection may occur. In the method, a computer system treats as a unit each request in a queue and a completion time of garbage collection that may occur at the time of processing the request, and processes requests preferentially and systematically in ascending order of the processing times of the units including the garbage collection times, thereby, reducing the average wait time of the requests. While, the computer system managing the queue knows the remaining amount of heap just before processing a certain request, the computer system statistically calculates in advance the amounts of heap to be consumed on a request type basis and holds the values. | 08-23-2012 |
20120233224 | DATA PROCESSING - Disclosed is a method for identifying inactive objects in an entity. The inactive objects may be purged from an entity to reduce the size of the entity. | 09-13-2012 |
20120246203 | RECONSTRUCTION OF GARBAGE COLLECTION INFORMATION - The reconstruction of garbage collection information corresponding to an application. Upon accessing a portion of compiler generated application code, a computing system generates computational results that identifies one or more program state storage locations that track live references or memory pointers that can be displaced during garbage collection. This may be performed for multiple application code portions (such as methods or functions of an application), and may be performed just before garbage collection. To generate the computational results, the application code portion may first be subjected to a liveness analysis to generate liveness analysis results in the form of one or more live program state storage locations in the application code portion. The computational results may then be generated using the liveness analysis results and type information from a type service to provide the set of storage locations referencing live memory objects. | 09-27-2012 |
20120284313 | MONITORING HEAP IN REAL-TIME BY A MOBILE AGENT TO ASSESS PERFORMANCE OF VIRTUAL MACHINE - A method, system and computer program product for monitoring a heap in real-time to assess the performance of a virtual machine. A mobile agent is created to be preloaded with boundary settings for each heap metric. Boundary settings are thresholds that are used to diagnose the effectiveness of operation of the heap. The mobile agent is deployed onto an application server to monitor the effectiveness of operation of the heap of a virtual machine within the application server. If a boundary setting for one of the heap metrics is exceeded, then the mobile agent determines whether a non-critical, a critical or a fatal error has occurred. An appropriate response is then performed. By monitoring the heap in real-time, undesirable behavior characteristics of the heap can be detected early thereby allowing remedial actions to be enacted to address such problems before those problems escalate into more serious problems. | 11-08-2012 |
20120290628 | Memory Management for Garbage Collection of Critical Real Time Threads - Mechanisms of memory management in a real time runtime environment having a garbage collected memory heap are provided. The runtime environment includes a critical real time thread that is precluded from accessing the garbage collected memory heap. The runtime environment further includes a scoped memory area for the allocation of objects therein for access by the critical real time thread. The mechanisms determine whether the critical real time thread currently accessing the scoped memory area is in a defined state so as to accommodate garbage collection of the scoped memory area. The mechanisms further initiate, in response to a determination that the critical real time thread currently accessing the scoped memory area is in the defined state, a process of garbage collection of the scoped memory area. | 11-15-2012 |
20120310998 | EFFICIENT REMEMBERED SET FOR REGION-BASED GARBAGE COLLECTORS - A method for efficiently implementing a remembered set for a region-based garbage collector includes maintaining, for each region in an object heap, a remembered set card list (RSCL). Each card in the RSCL identifies an area in the object heap that includes at least one object that references an object in the region associated with the RSCL. The method further establishes a collection set identifying a subset of regions in the object heap on which to perform partial garbage collection. Prior to performing the partial garbage collection, the method flushes cards from RSCLs associated with the collection set to the card table, globally discards cards that are about to be rebuilt from all RSCLs, and globally cleans the card table. The method then adds cards to the RSCLs for inter-region references discovered while traversing live objects in the collection set. A corresponding computer program product and apparatus are also disclosed. | 12-06-2012 |
20120323979 | GARBAGE COLLECTION BASED ON TOTAL RESOURCE USAGE AND MANAGED OBJECT METRICS - A method includes selectively controlling, at a computing device having a memory, initiation of a full garbage collection operation based on a total resource usage metric and a managed object metric. The managed object metric is based on objects managed by a runtime application. | 12-20-2012 |
20120331018 | SYSTEM AND METHOD FOR USE WITH GARBAGE COLLECTED LANGUAGES FOR ENABLING THE ALLOCATED HEAP MEMORY TO BE UPDATED AT RUNTIME - A system and method for use with garbage collected systems and languages, for enabling an allocated heap memory to be updated (e.g., increased or decreased) at runtime, subject to sufficient availability of physical memory. In accordance with an embodiment, a Java Virtual Machine (JVM) is associated with a management console, which allows a systems administrator to monitor current heap utilization at runtime. The heap is visualized as a contiguous chunk of memory with one or more extension points, e.g., by use of a trailing pointer to a null list. If later, at runtime, the heap size needs to be incremented then the trailing pointer can be set to a new chunk of memory with a size of (new value−old value), so that the cumulative new size is made equal to a new value specified on the console. The new chunk of memory can again end with a trailing pointer, to allow for further extension. The features can help ensure that an alert administrator will have the means to prevent an out-of-memory situation when the allocated heap proves insufficient at runtime. | 12-27-2012 |
20120331019 | REPLACEMENT POLICY FOR RESOURCE CONTAINER - A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue indicating a second order of second resources stored in the memory, the second order based on respective second timestamps associated with the stored second resources. | 12-27-2012 |
20130007073 | CONSERVATIVE GARBAGE COLLECTION AND ACCESS PROTECTION - A method of memory management can include creating an initial root set of pointers for a program during execution of the program and performing a marking process by iteratively marking referred objects of each pointer of the root set and expanding the root set with filtered, encoded pointers. The method also can include identifying each non-live object for any marked object as red-marked and performing, using a processor, a re-marking process on the root set in which red-marked objects are excluded. Each object of the root set not marked can be designated as including a memory leak. | 01-03-2013 |
20130041926 | INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND COMPUTER READABLE MEDIUM - An information processing system includes a first information processing apparatus, a second information processing apparatus, and a third information processing apparatus. The first information processing apparatus includes a collecting unit that collects information, a generating unit that generates first and second deleting conditions, an adding unit that adds the first and second deleting conditions to the information, and a first transmitting unit that transmits the information including the first and second deleting conditions added thereto. The second information processing apparatus includes a first receiving unit that receives the transmitted information, a first storing unit that stores the received information, a second transmitting unit that transmits the stored information, and a first deleting unit that deletes the information. The third information processing apparatus includes a second receiving unit that receives the transmitted information, a second storing unit that stores the received information, and a second deleting unit that deletes the information. | 02-14-2013 |
20130041927 | Shrinking Virtual Hard Disk Image - The present disclosure introduces a method and an apparatus of shrinking virtual hard disk image file. The present techniques search a garbage data block in a file and revise a record of the garbage data block in a block allocation table (BAT). The file includes one or more data blocks and a BAT that records information of each data block. The garbage data block is a data block that does not store effective data. The present techniques move an effective data block subsequent to the garbage data block, revise a record of the effective data block in the BAT after the moving, and shrink a size of the file after the movement. | 02-14-2013 |
20130091186 | WORK STEALING OF PARTIALLY-MARKED OBJECTS - A process may utilize multiple garbage collector threads, each having the capability to steal partially-marked object references from an accessible mark stack having additional work that has yet to be processed. A partially-marked object reference may be represented as a pair of entries on a mark stack. A garbage collector thread may utilize an atomic operation to access the pair of entries in a prescribed manner to steal an unprocessed partially-marked object reference. In this manner, the workload of an overloaded garbage collector thread is offloaded to another garbage collector thread that may be idle thereby balancing the workload more evenly among multiple garbage collector threads. | 04-11-2013 |
20130097210 | EFFICIENT GARBAGE COLLECTION IN A COMPRESSED JOURNAL FILE - Exemplary method, system, and computer program product embodiments for efficient garbage collection in a compressed journal file system are provided. In one embodiment, by way of example only, a map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. Additional system and computer program product embodiments are disclosed and provide related advantages. | 04-18-2013 |
20130138703 | OPTIMIZED MEMORY MANAGEMENT FOR CLASS METADATA - A method for managing class metadata in a garbage collected system, including (i) allocating a metaspace to a class loader of a mutator using a memory heap, where the metaspace is configured to store the class metadata generated by the class loader, (ii) storing, in the metaspace, class metadata items associated with classes defined by the class loader, where the class metadata items and the class loader are coterminous, and where all of the class metadata items are identified by a garbage collector as live if any of the class metadata items is reachable by the mutator, (iii) updating a linkset graph during resolution of symbolic links to sumarize cross-metaspace references, and (iv) reclaiming, by the garbage collector based on a pre-determined algorithm using the metaspace, memory locations unreachable by the mutator, where all memory locations allocated to the class metadata items are reclaimed together as a group. | 05-30-2013 |
20130185337 | MEMORY ALLOCATION BUFFER FOR REDUCTION OF HEAP FRAGMENTATION - Systems and methods of a memory allocation buffer to reduce heap fragmentation. In one embodiment, the memory allocation buffer structures a memory arena dedicated to a target region that is one of a plurality of regions in a server in a database cluster such as an HBase cluster. The memory area has a chunk size (e.g., 2 MB) and an offset pointer. Data objects in write requests targeted to the region are received and inserted to the memory arena at a location specified by the offset pointer. When the memory arena is filled, a new one is allocated. When a MemStore of the target region is flushed, the entire memory arenas for the target region are freed up. This reduces heap fragmentation that is responsible for long and/or frequent garbage collection pauses. | 07-18-2013 |
20130185338 | EFFICIENT GARBAGE COLLECTION IN A COMPRESSED JOURNAL FILE - A map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. | 07-18-2013 |
20130204912 | METHOD, PROGRAM AND SYSTEM FOR GENERATING HASH CODES TO IDENTIFY OBJECTS - A computer-implemented method, system, and article of manufacture for generating hash codes to identify objects. The method increases variation in object hash codes to reduce conflict between object hash codes and enables them to be added to pinned objects. The method includes: generating a seed value for each heap area and generating the hash code on the basis of address of the object and seed value of the heap area to which the object is allocated. The article of manufacture includes computer readable instructions which, when implemented, cause a computer to perform the steps of the above method. The computer-implemented system includes a processor; and a memory which includes a hash code, an object, a seed value, and a heap area, wherein the processor is configured to perform the steps of the above method. | 08-08-2013 |
20130282771 | SYSTEM AND METHOD FOR OPTIMIZING DATA REMANENCE OVER HYBRID DISK CLUSTERS USING VARIOUS STORAGE TECHNOLOGIES - A method is implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions. The programming instructions are operable to optimize data remanence over hybrid disk clusters using various storage technologies, determine one or more data storage technologies accessible by a file system, and determine secure delete rules for each of the one or more storage technologies accessible by the file system. The secure delete rules include a number of overwrites required for data to be securely deleted from each of the one or more storage technologies. The programming instructions are further operable to provide the secure delete rules to the file system upon a request for deletion of data for each of the one or more storage technologies a specific amount of times germane to secure delete data from the one or more storage technologies. | 10-24-2013 |
20130290382 | COMPUTER, CONTROL METHOD OF COMPUTER, AND RECORDING MEDIUM - A computer includes a storage region in which an object generated by executing a program is disposed, and a control unit that performs execution of the program and releasing of the storage region. The control unit updates time information using garbage collection, a capacity of objects in a memory, or similar as a trigger, acquires information of a program generating an object and time information at the time of generation of the object which are recorded in a recording device so as to be correlated with each other when the object is generated. The control unit further detects an object which is unnecessary to execute a subsequent program and acquires the time information, and records a difference between the time information at the time of the generation and at the time of the detection in the recording device so as to be correlated with the information of the program. | 10-31-2013 |
20130304771 | SYSTEM AND METHOD FOR USE WITH GARBAGE COLLECTED LANGUAGES FOR ENABLING THE ALLOCATED HEAP MEMORY TO BE UPDATED AT RUNTIME - A system and method for use with garbage collected systems and languages, for enabling an allocated heap memory to be updated (e.g., increased or decreased) at runtime, subject to sufficient availability of physical memory. In accordance with an embodiment, a Java Virtual Machine (JVM) is associated with a management console, which allows a systems administrator to monitor current heap utilization at runtime. The heap is visualized as a contiguous chunk of memory with one or more extension points, e.g., by use of a trailing pointer to a null list. If later, at runtime, the heap size needs to be incremented then the trailing pointer can be set to a new chunk of memory with a size of (new value−old value), so that the cumulative new size is made equal to a new value specified on the console. | 11-14-2013 |
20130318131 | METHOD AND APPARATUS FOR PROGRESSIVELY DELETING MEDIA OBJECTS FROM STORAGE - A system for managing storage space on an electronic storage medium is provided in which a file format for stored data allows for progressive deletion of low-significance data, for example in a video or audio file, while allowing the remaining portions of the file to be subsequently retrieved. The file format allows for the ready deletion of low-significance data without having to open, edit and subsequently rewrite the data. Furthermore, rules-based algorithms for the deletion of low-significance data allow a user to store and progressively delete such low-significance data in accordance with time parameters, available storage space and the like, without having to delete the full file. | 11-28-2013 |
20130325912 | BALLOON OBJECT FEEDBACK FOR JAVA VIRTUAL MACHINES - A mechanism is provided for managing balloon objects of a memory balloon for a runtime environment executing in a virtual machine. The mechanism includes a balloon agent that evaluates a relative value of each balloon object. The balloon agent may set an allocation rate of rebuilding balloon objects based on life spans of previously garbage-collected balloon objects. The balloon agent may also modify a percentage of balloon objects to be weak-referenced based on an amount of application data freed in a previous garbage collection. | 12-05-2013 |
20140082029 | REMEMBERED SET OVERHEAD REDUCTION BY DEFERRED GARBAGE COLLECTION OF STABLE REGIONS - At least one region of a heap that includes memory allocations is analyzed, using age and occupancy criteria, across a number of local garbage collection cycles using a processor executing a region-based garbage collector. Based upon the analyzed age and occupancy criteria of the at least one region, at least one stable region in age and occupancy is identified among the at least one region of the heap across the number of local garbage collection cycles. Maintenance of a remembered set (RS) of external references into the at least one stable region is temporarily stopped for each identified stable region during at least one additional local garbage collection cycle. | 03-20-2014 |
20140089355 | METHOD AND APPARATUS FOR AUTOMATIC SYSTEM CLEANING, AND STORAGE MEDIUM - The invention relates to a method and an apparatus for automatic system cleaning, and a storage medium. The method includes obtaining a triggering occasion and a triggering condition which are selected by a user; determining whether the triggering occasion and the triggering condition are satisfied; and if yes, cleaning a system according to a preset running manner and a preset running policy. Through combination of system cleaning functions and scheduled task functions, and expansion of existing triggering conditions of a tasks scheduler, a user can self-define a triggering occasion, a triggering condition, a running manner and a running policy of system cleaning. When the triggering occasion and the triggering condition designated by the user are satisfied, system cleaning is automatically performed according to the selected running manner and policy, thereby improving the system performance and the system cleaning efficiency, and protecting the computer security and the individual privacy. | 03-27-2014 |
20140101209 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR CONDITIONALLY PERFORMING GARBAGE COLLECTION - In accordance with embodiments, there are provided mechanisms and methods for conditionally performing garbage collection. These mechanisms and methods for conditionally performing garbage collection can enable reduced application delay, improved data management efficiency, enhanced customer response, etc. | 04-10-2014 |
20140136575 | LOG-STRUCTURED GARBAGE COLLECTION - System and method for log-structured garbage collection are provided. In particular, some embodiments use write pointer to read pointer offsets to enable reclamation of space within a log-structured storage medium (e.g., sequential forward only write mechanisms such as SSD, Tape, Shingled Drives, Flash Drives, etc.). These techniques allow the garbage collection system to reclaim space without copying data from one storage medium to another. Instead of copying the data, various embodiments reset the write and read pointers. In addition, different retention policies can be easily enforced while allowing for efficient garbage collection. For example, in a backup storage, each log-structured media can be designated with a retention time and only allow workloads with the specified retention time to be stored. As a result, the garbage collection incurs only read pointer movements. | 05-15-2014 |
20140136576 | DESTRUCTION OF SENSITIVE INFORMATION - Provided are techniques for deleting sensitive information in a database. One or more objects in a database that are accessed by a statement are identified. It is determined that at least one object among the identified one or more objects contains sensitive information by checking an indicator for the at least one object. One or more security policies associated with the at least one object are identified. The identified one or more security policies are implemented for the at least one object to delete sensitive information. | 05-15-2014 |
20140136577 | DESTRUCTION OF SENSITIVE INFORMATION - Provided are techniques for deleting sensitive information in a database. One or more objects in a database that are accessed by a statement are identified. It is determined that at least one object among the identified one or more objects contains sensitive information by checking an indicator for the at least one object. One or more security policies associated with the at least one object are identified. The identified one or more security policies are implemented for the at least one object to delete sensitive information. | 05-15-2014 |
20140149472 | METHOD, DEVICE AND STORAGE MEDIUM FOR CLEANING UP FILE SYSTEMS - Examples of the present disclosure may provide a method, device and storage medium for clearing up a file system. A volume may be opened and locked according to a clearing-up instruction. The clearing-up instruction may indicate the volume which is to be cleared up. Garbage information on a disk corresponding to the volume may be cleared up. The volume may be unlocked after the garbage information is cleared up. The device may include a locking module, a clearing-up module and an unlocking module. With the example of the present disclosure, when the clearing-up instruction is received, the garbage information on the disk corresponding to the volume may be cleared up. Therefore, the privacy of the user remained in the file system may be thoroughly cleared up, the leakage of the privacy of the user may be avoided and the security of the file system may be enhanced. | 05-29-2014 |
20140237004 | Lock-Free, Scalable Read Access To Shared Data Structures Using Garbage Collection - At least one read operation of at least one object of a data container is initiated. The data container includes an anchor object, a first internal data object and a first garbage collection object, the anchor object comprising a pointer to a versioned structure tree. Thereafter, in response to the at least one incompatible write operation, a second internal data object and a second garbage collection object are created for the data container. The second garbage collection object has a reference to the second internal data object. Subsequently, the second internal data object is installed in the anchor object and the first garbage collection object is passed to a garbage collection process so that space used by the first garbage collection object in a database can be reused. Related apparatus, systems, techniques and articles are also described. | 08-21-2014 |
20140289286 | SYSTEM AND METHOD FOR PERFORMANCE TUNING OF GARBAGE COLLECTION ALGORITHMS - Methods and apparatus are provided for tuning a garbage collection algorithm. The apparatus includes a request generator configured to generate a transaction request including parameters Ta, Te, and M, where Ta represents a transaction request inter-arrival time, Te represents a transaction request execution time, and M represents a transaction request memory allocation amount. The apparatus also includes a memory allocation module, an active request queue, and a garbage collection (GC) module. The memory allocation module is configured to admit the formatted transaction request to the queue if at least M heap memory is available, and to initiate a GC routine if M heap memory is not available. | 09-25-2014 |
20140324924 | SYSTEM AND METHOD FOR TWO-TIER ADAPTIVE HEAP MANAGEMENT IN A VIRTUAL MACHINE ENVIRONMENT - In accordance with an embodiment, described herein is a system and method for two-tier adaptive heap management (AHM) in a virtual machine environment, such as a Java virtual machine (JVM). In accordance with an embodiment, a two-tier AHM approach recognizes that more virtual machines can be run on a particular host, or the same number of virtual machines can support higher load while minimizing out-of-memory occurrences, swapping, and long old garbage collection pauses, if the heap is divided into tiers, so that a garbage collection policy that minimizes pause time can be used in a first (normal) tier, and a garbage collection policy that favors heap compaction and release of free memory to the host can be used in another (high-heap) tier. | 10-30-2014 |
20140330873 | METHOD AND SYSTEM FOR DELETING GARBAGE FILES - A method and system that can completely delete garbage data in a distributed network system are provided. Because it is impossible to initially access a data server, data to delete is not deleted, and thus when a garbage file is generated, a generated garbage file can be completely deleted. In this case, by performing a deletion operation of a garbage file in a distributed data server unit, operation efficiency can be maximized. | 11-06-2014 |
20150058381 | SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS - A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time. | 02-26-2015 |
20150317247 | OPTIMIZED GARBAGE COLLECTION ALGORITHM TO IMPROVE SOLID STATE DRIVE RELIABILITY - A method for managing memory operations in a storage device having a plurality of data blocks, the method including steps for determining a number of page reads for each of the plurality of data blocks and determining a dwell time for each of the plurality of data blocks. In certain aspects, the method further includes steps for associating the plurality of data blocks with a plurality of rank groups based on the number of page reads and the dwell time associated with each of the plurality of data blocks and selecting a data block, from among the plurality of data blocks, for memory reclamation based on the associated rank group and the selected data block. A storage system and computer-readable media are also provided. | 11-05-2015 |
20150317326 | INLINE GARBAGE COLLECTION FOR LOG-STRUCTURED FILE SYSTEMS - Exemplary methods, apparatuses, and systems receive a command to overwrite or delete data stored within an allocated portion of a file system. In response to the command, an entry is added to a first data structure. A write command is received. The portion of the file system added to the first data structure is formatted for reallocation. In performance of the write command, the portion of the file system is reallocated. Portions of the file system are allocated from a second data structure when the second data structure includes a sufficient amount of space to satisfy the write command and from the first data structure when the second data structure does not include a sufficient amount of space. The second data structure includes free portions of the file system that have been formatted for allocation. The first data structure includes free portions that have yet to be formatted. | 11-05-2015 |
20220138098 | TRACKING GARBAGE COLLECTION STATES OF REFERENCES - Garbage collection (GC) states are stored within references stored on a heap memory to track a progress of GC operations with respect to the references. GC state may be stored in a non-addressable portion of references. Based on the GC state of a particular reference, a set of GC operations are selected and performed for the reference. However, references stored on a call stack do not include any indication of GC state. Hence, loading a reference from heap to call stack involves removing the indication of GC state. Writing a reference to heap involves adding the indication of GC state. References embedded within a compiled method also do not indicate any GC state. Metadata of the compiled method indicate a GC state, which is implicated to the embedded references. GC operations are selected and performed for each embedded reference based on the GC state of the compiled method. | 05-05-2022 |