Abstract: 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.

Abstract: A computer-implemented method for reclaiming storage space from virtual machine disk images may include (1) identifying a virtual machine that uses a virtual machine disk image as a virtual disk for storage, the virtual machine disk image being stored on a thin-provisioned volume within a host file system, (2) determining that a portion of the virtual machine disk image represents a portion of the virtual disk that is unused by a file system of the virtual machine, (3) based on determining that the portion of the virtual machine disk image represents the portion of the virtual disk that is unused by the file system of the virtual machine, marking the portion of the virtual machine disk image for reclamation from the thin-provisioned volume, and (4) reclaiming the marked portion of the virtual machine disk image from the thin-provisioned volume. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: 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.

Abstract: A control method for a Flash memory array and a Flash memory is disclosed. The Flash memory array includes a plurality of blocks which are classified into groups and each group includes at least one block. The control method includes the steps of: recognizing an attribute of data transferred from a host, obtaining a storage group selected from the groups based on the attribute of the data, and storing the data into the blocks of the storage group and thereby the blocks of a same group store data of a same attribute; and performing a valid data collection, restricted to the blocks belonging to a same group, to release blocks of space.

Abstract: Embodiments of the invention enhance a garbage collection process running on a parallel system or distributed computing environment. Using a garbage collector in such an environment allows a more in-depth analysis to be performed than is possible on other systems. This is because the number of compute nodes present in many parallel systems, and the connections between them, allows the overhead of doing advanced analysis to be spread across the nodes and the results of that analysis to be shared among the nodes.

Abstract: Locking allocated data space is disclosed. An indication is received that certain previous version data is required to be retained. A map of metadata records, each associated with a journaling process write of previous version data which write includes previous version data required to be retained beyond the protection window, is built. In some embodiments, the map associates a write time with each record in the map. A reclamation process checks to determine whether any storage proposed to be reclaimed is included in the map of record identifiers. In some embodiments, the determination is made based at least in part on the write time associated in the map with at least a first record identifier in time sorted order.

Abstract: An apparatus is provided that includes a processor and a memory storing executable instructions that in response to execution by the processor cause the apparatus to at least perform a number of functions. The apparatus is caused to direct presentation of a list for a plurality of patients and that is clustered by patient. The apparatus is caused to apply a keyword filter to identify a subset of the patient exams that match the keyword filter, and rank the respective exams by relevance to the keyword filter. The apparatus is caused to direct presentation of a filtered list of patient exams that is clustered by patient in the filtered list of patient exams. And for each patient having patient exams in the subset of the patient exams, the respective patient exams are in ranked order in the filtered list of patient exams according to the keyword filter.

Abstract: An instruction processing method includes generating a translated code block for an instruction, among instructions included in a target program to be executed and for which a number of executions through sequential interpretation is greater than or equal to a threshold, and storing the generated translated code block in a first storage unit and removing part or all of the translated code block from the first storage unit at a given timing, wherein the generating reduces the threshold with respect to the number of executions over a given period of time after the part or all of the translated code block is removed.

Abstract: A computing device is provided and includes a memory module, a sweep engine, a root snapshot module, and a trace engine. The memory module has a memory implemented as at least one hardware circuit. The memory module uses a dual-ported memory configuration. The sweep engine includes a stack pointer. The sweep engine is configured to send a garbage collection signal if the stack pointer falls below a specified level. The sweep engine is in communication with the memory module to reclaim memory. The root snapshot engine is configured to take a snapshot of roots from at least one mutator if the garbage collection signal is received from the sweep engine. The trace engine receives roots from the root snapshot engine and is in communication with the memory module to receive data.

Abstract: Methods, systems, and computer program products for memory garbage collection via object grouping are disclosed. Normative objects are allocated in a non-native memory referencing respective one or more native objects in a native memory. The non-native objects are grouped into non-native object groups based upon information regarding object references associated with respective ones of the native objects. Objects in respective ones of the one or more non-native object groups are provided one or more references to other said objects of the non-native object groups to create connected object groups. Unused ones of the connected object groups are detected. And objects of the detected unused ones of the connected object groups are de-allocated.

Abstract: 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.

Abstract: 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.

Abstract: Systems, methods and computer program products for bookkeeping of download stamps are described herein. An embodiment includes augmenting database table (or mobile business object) metadata with a synchronization (“sync”) key and assigning a unique identifier to each sync key. A sync key is assigned to one or more rows (or records) in the database table and a download timestamp is associated with each sync key. The embodiment further includes identifying a sync key associated with each row in the database table. Links between rows occurring in different database tables are maintained using sync keys. In this way, embodiments of the invention allow a server to record a download timestamp of database table subsets, where such subsets may include one or more rows in the database tables. This allows data to be downloaded by a client at subset granularity.

Abstract: Object store management operations within compute-centric object stores are provided herein. An exemplary method may include transforming an object storage dump into an object store table by a table generator container, wherein the object storage dump includes at least objects within an object store that are marked for deletion, transmitting records for objects from the object store table to reducer containers, such that each reducer container receives object records for at least one object, the object records comprising all object records for the at least one object, generating a set of cleanup tasks by the reducer containers, and executing the cleanup tasks by a cleanup agents.

Abstract: 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#.

Abstract: A Dynamic Live System for collecting, inputting, storing, and reporting Element Effort Event Data, whose processes upon query enable the reporting of well formatted Formulaic Conjoined Project Effort Instance (CPEI) Reports per the Systems Who did What in Phasetime Effort Instance Formulas in Primary, Secondary, Tertiary, Auto Displays, and Inferences, not stored as displayed in Systems base tables. The formulas 5th Element permits effort instances to be reported as past, present and future CPEI displays, regardless if said effort event data was inputted by an element directly or generated automatically by the system's use of AI type techniques. Dynamically generated well formatted CPEI report displays incorporate functional interaction designed attributes that hyperlink formula primitives by their CPEI associations, whether or not said associations are acknowledged as credited efforts by a project owner.

Abstract: Scaling Asynchronous reclamation of free space in de-duplicate multi-controller storage systems is disclosed. In one example, a set of de-duplicated data segments/blocks organized in a hierarchical data structure is received, the set of de-duplicated data segments/blocks are allocated across a plurality of controllers of the file system, where each de-duplicated data segment is restricted to be co-allocated to the same controller as the reference(s) referencing the de-duplicated data segment/block in the hierarchical data structure. In various embodiments, the file system is traversed, each controller of the file system updates its own local live vector and reclaim storage space that are not marked as alive.

Abstract: A garbage collection process performs garbage collection operations in an object-based memory system associated with a processing environment. The garbage collection process receives, at a first garbage collection unit, object references derived from root data from a processor associated with the first garbage collection unit. In addition, the garbage collection process processes, at the first garbage collection unit, the root data received from the processor associated with the first garbage collection unit. The garbage collection process also determines which object references derived from the root data are associated with a second garbage collection unit. Upon determining that an object reference is associated with a second garbage collection unit, the garbage collection process communicates information representative of the object reference to the second garbage collection unit associated with the object reference.

Abstract: 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 in

Abstract: 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.

Abstract: Systems and methods are provided for handling uncorrectable errors that may occur during garbage collection of an index page or block in non-volatile memory.

Abstract: A method and apparatus for managing thread priority based on object creation rates. Embodiments of the invention provide a thread monitor configured to reduce the execution priority of a thread creating a sufficient number of new objects to be disruptive of system performance. Thus, although the thread may still create a large number of objects, by monitoring object creation rates and reducing the execution priority of such a thread, overall system performance may be improved. In other words, a given thread may still “misbehave,” but receive fewer opportunities to do so.

Abstract: A current key is received at a current arrival time at a computer. An index in an array corresponding to the current key is determined using a hash function. A previous key and a previous arrival time are retrieved from the array at the index. The array is transformed by replacing the previous key and the previous arrival time with the current key and the current arrival time in the array at the index. The previous key and the previous arrival time are inserted into a nearest eligible sequential index in the array.

Abstract: 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.

Abstract: A system and method are provided to inspect memory leaks and copy garbage collection files. In one embodiment, an original garbage collection file is selected from a plurality of garbage collection files at a file system. The original garbage collection file is periodically copied into a duplicate garbage collection file. The duplicate garbage collection file serves as a backup file to the original garbage collection file.

Abstract: Object store management operations within compute-centric object stores are provided herein. An exemplary method may include transforming an object storage dump into an object store table by a table generator container, wherein the object storage dump includes at least objects within an object store that are marked for deletion, transmitting records for objects from the object store table to reducer containers, such that each reducer container receives object records for at least one object, the object records comprising all object records for the at least one object, generating a set of cleanup tasks by the reducer containers, and executing the cleanup tasks by a cleanup agents.

Abstract: A method to implement parallel, single-pass compaction in a garbage collector is described. In one embodiment, such a method includes conducting a planning phase for multiple regions to be compacted. During the planning phase, the method determines new locations for data entities in the multiple regions. The method then performs a move phase for the multiple regions to move the data entities to their new locations. During the move phase, the method initiates multiple compaction threads to move the data entities to their new locations. While executing, the compaction threads dynamically build a dependency graph of the regions being compacted. The dependency graph guarantees that no data entity is moved to its new location until all data entities that it overwrites have been moved to their new locations. A corresponding computer program product and apparatus are also disclosed herein.

Abstract: The present invention extends to methods, systems, and computer program products for memory pinning through buffer encapsulation. Within a managed execution environment, a wrapper object encapsulates a memory buffer that is to be shared with a native routine executing in a native execution environment. The wrapper object manages operation of a memory manager on a memory heap corresponding to the memory buffer. The wrapper object includes a first function which sets a pin on the memory buffer and returns a pointer identifying the memory buffer. Setting the pin causes the memory manager to cease moving the memory buffer within the memory heap. The wrapper object also includes a second function which releases the pin on the memory buffer.

Abstract: A nonvolatile memory device includes a memory area having free segments and first to fourth regions having used segments. The garbage collection method includes selecting a target segment from the used segments, moving a valid data block from the selected target segment to the used segments, and erasing data of all data blocks in the selected target segment and making the selected target segment into a free segment. When the number of free segments is greater than a predefined value, the target segment is selected by a first method and valid data blocks in the target segment are moved by a second method. When the number of free segments is less than the predefined value, the target segment is selected by a third method and valid data blocks in the target segment are moved by a fourth method.

Abstract: Embodiments of the invention relate to converting infrared, radar, and photographic sensor data using an apparatus having a graphical user interface, a user-selection device, and an electronic processor configured to convert sensor data and output the converted sensor data. An infrared, radar, and photographic sensor data conversion computer program (abbreviated “computer program”) is associated with the electronic processor. A sensor standard definition file is consistent with a sensor standard (abbreviated “the standard”) and is configured for input to the computer program. The sensor standard definition file is a programmable external file defining specifics (elements used to communicate sensor data in the computer program) of the standard. The sensor standard definition file is editable and extendable to support changes in the standard.

Abstract: Apparent performance delays in a computer application are reduced by scheduling garbage collection during periods when a user cannot modify program data within the application. Garbage collection may be initiated in response to detecting a user interface event that prevents user modification of program data being processed by the computer application. Systems and methods herein reduce the appearance of performance delays associated with garbage collection.

Abstract: A storage apparatus includes: a memory allowing an operation to be carried out in order to additionally write new write data into a storage area already used for storing previous write data so as to store the new data in the storage area along with the previous write data; an input/output section configured to receive write data in a write access; and a control section configured to write the write data into the memory on the basis of the write access, wherein, in internal processing based on the write access, the control section carries out an additional-write operation for a storage area already used for storing the previous write data in the internal processing.

Abstract: Provided are methods, systems, and computer readable media for user interaction with database methods and systems. In an aspect, a user interface can be generated to permit dynamic display generation to view data. The system can comprise a visualization component to dynamically generate one or more visual representations of the data to present in the state space.

Abstract: A similarity analysis framework is described herein which leverages two or more similarity analysis functions to generate synonyms for an entity reference string re. The functions are selected such that the synonyms that are generated by the framework satisfy a core set of synonym-related properties. The functions operate by leveraging query log data. One similarity analysis function takes into consideration the strength of similarity between a particular candidate string se and an entity reference string re even in the presence of sparse query log data, while another function takes into account the classes of se and re. The framework also provides indexing mechanisms that expedite its computations. The framework also provides a reduction module for converting long entity reference strings into shorter strings, where each shorter string (if found) contains a subset of the terms in its longer counterpart.

Abstract: 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.

Abstract: The present invention is directed to a system and method for creating a non-redundant data set from a plurality of data sources. Generally, the system and method operate by creating unique hash keys corresponding to unique data files; compiling the hash keys along with seeking information for the corresponding data files; de-duplicating the hash keys; and retrieving/storing the data files corresponding to the de-duplicated hash keys. Thus, in accordance with the system and method of the present invention, a non-redundant data set can be created from a plurality of data sources. The system of the present invention can operate independently or in conjunction with any de-duplicating methods and systems. For example, a de-duplicating method and system can be used to read and obtain data from a variety of media, regardless of the application used to generate the backup media. The component parts of a file may be read from a medium, including content and metadata pertaining to a file.

Abstract: A search request received at a computer of a search support system is processed by analyzing the received search request to identify request parameters and connecting to a system index of the search support system that is referenced in the request parameters. An external result provider (ERP) process is initiated that establishes communication between the search support system and a data source external to the search support system, for a virtual index referenced in the request parameters. Thus, the ERP process provides an interface between the search support system and external data sources, such as by third parties. The ERP process can operate in a streaming mode (providing real-time search results with minimal processing) and/or a reporting mode (providing results with a greater delay and processing extent) and can switch between modes. The search request results are received from the connected system indexes and the referenced virtual indexes.

Abstract: Hybrid caching techniques and garbage collection using hybrid caching techniques are provided. A determination of a measure of a characteristic of a data object is performed, the characteristic being indicative of an access pattern associated with the data object. A selection of one caching structure, from a plurality of caching structures, is performed in which to store the data object based on the measure of the characteristic. Each individual caching structure in the plurality of caching structures stores data objects has a similar measure of the characteristic with regard to each of the other data objects in that individual caching structure. The data object is stored in the selected caching structure and at least one processing operation is performed on the data object stored in the selected caching structure.

Abstract: A processing system capable of downloading and executing firmware at the same time, and from multiple storages, is disclosed. The processing system includes a first storage unit for storing firmware; a second storage unit for storing frequently accessed firmware, the second storage unit having a higher operating speed than the first storage unit; a download unit for downloading firmware from the first storage unit to the second storage unit; an execution unit for executing firmware from the first storage unit or the second storage unit; and a processor for controlling the download unit and execution unit to operate concurrently.

Abstract: A system and method for searching a product model number database having a plurality of product model numbers stored therein receives a string to be searched in the product model number database from a client device. Multiple queries are then created based on the string and the model number database is queried using the created queries. Query results responsive to the created queries are then received from the model number database and transmitted to the client device.

Abstract: Discovering environment objects for information management in a networked environment. Information management provides services such as data protection, backup, retention, compliance, etc., by classifying the objects and/or infrastructure of an entity according to its value to the entity. Information management begins by discovering the data in a network and by discovering the servers and services operating in a network. The servers and services are discovered using adapters that can collect information regarding the environment objects. This information can then by used by information management systems to assign or orchestrate various services.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries. The directory entry types can define whether a cluster chain corresponding to a file can be contiguously allocated.

Abstract: Memory management includes identifying a region of virtual memory to be reclaimed, the region including an object that is currently located at an original virtual memory location, and the region being supported by at least a portion of a memory resource; relocating the object from the original virtual memory location to a target virtual memory location; releasing the portion of the memory resource so that the portion of memory resource can be reused; and after the portion of the memory resource is released, replacing a reference of the object that points to the original virtual memory location with a reference of the object that points to the target virtual memory location.

Abstract: Many computer applications involve event driven programming. Unfortunately, it may be burdensome on application developers to develop event handlers in unmanaged code for all relevant events within their computer application. For example, when using COM objects in connection with event handling, the burden of lifetime management may be placed on the application developer. Accordingly, one or more systems and/or techniques for event handling in unmanaged code are disclosed herein. A delegate comprising a first interface and a second interface is provided. The delegate may receive event data from a software platform connected to the first interface and may notify a function of a process connected to the second interface. The delegate self destructs when both the computing platform and the process have released their connections to the respective interfaces, thus mitigating manual coding of lifetime management functionality within the process.

Abstract: A method for generating a probabilistic relational database based on a previous relational database, wherein the probability estimation is carried out within the relational paradigm. The method may include frequency-based and information theoretic based (idf-based) estimation of tuple probabilities. The method generalises the use of information retrieval ranking methods such that these and new ranking methods are available for relational databases.

Abstract: A media content delivery interface for delivering media content based on a geographic location of a user. The media content delivery interface may include a mapping device configured to receive a positioning signal and determine a geographic location of a media playing device based on the positioning signal, a processor configured to receive the geographic location from the mapping device and generate a search signal for searching a media database for a media file having a geographic property related to the geographic location, and a distribution device coupled to the processor, configured to selectively distribute the searched media file from the media database to the media player device.

Abstract: Embodiments of the invention relate to converting infrared, radar, and photographic sensor data using an apparatus having a graphical user interface, a user-selection device, and an electronic processor configured to convert sensor data conversion computer program (abbreviated “computer program”) is associated with the electronic processor. A sensor standard definition file is consistent with a sensor standard (abbreviated “the standard”)and is configured for input to the computer program. The sensor standard definition file is a programmable external file defining specifies (elements used to communicate sensor data in the computer program) of the standard. The sensor standard definition file is editable and extendable to support changes in the standard. A sensor standard rules file, sensor external standard file, and sensor external data file are consistent with the standard and are operatively associated with the computer program.