An apparatus is disclosed. The apparatus may be implemented in a database node or a storage node and includes one or more processors and memory storing instructions for causing the processor to perform a number of operations. Responsive to a page write request, the apparatus determines an identifier corresponding to the requested page, sends component blocks corresponding to the page to a storage node for appending to an append-only storage log of the storage node, receives the physical location of the stored component blocks, and associates the physical storage location of the stored component blocks with the logical identifier corresponding to the page.

An information processing apparatus includes: a memory configured to store a storage controlling program; and a processor configured to execute a process based on the storage controlling program, wherein the process includes: storing, in the memory, address information regarding an address of a unit region for which duplicate deletion of data was performed in the past and data information regarding data in the unit region as past information; generating, using the address information, first data information of a first unit region in a state in which duplicate deletion of data has been performed currently; and specifying a data region to be a target of garbage collection based on the data information in the past information and the generated first data information.

A data storage device includes a controller including a flash translation layer (FTL) for controlling an operation of a nonvolatile memory device. The FTL may monitor a first read operation on the plurality of data storage regions, collect first read operation information of a first subset of data storage regions on which the first read operation is performed, the first read operation information including read counts of the first subset of data storage regions on which the first read operation is performed, and information of the first subset of data storage regions on whether soft decision has been performed on the data storage regions, change a garbage collection (GC) threshold value based on the collected first read operation information, and control the nonvolatile memory device to perform GC on the plurality of data storage regions based on the changed GC threshold value.

Embodiments of the application provide a resource reclamation method and a resource reclamation apparatus. The method includes: determining a memory region corresponding to a target tenant included by a heap memory as a target region; and performing resource reclamation on the target region to release the target region.

A method for providing data immutability using a deduplication filesystem for data objects stored in the cloud by defining a protection duration from a first date to a fixed future date, and applying a retention lock to one or more data objects stored in cloud storage during the protection duration, the retention lock preventing deletion, modification or movement of the data objects by an unauthorized entity. The method defines a renew threshold date within the protection duration, and performs a garbage collection (GC) operation at the renew threshold date to permanently delete dead data objects and carry forward live data objects, and extends the retention lock on remaining live data objects and subsequently written data objects upon completion of the GC operation.

Fast modern interconnects may be exploited to control when garbage collection is performed on the nodes (e.g., virtual machines, such as JVMs) of a distributed system in which the individual processes communicate with each other and in which the heap memory is not shared. A garbage collection coordination mechanism (a coordinator implemented by a dedicated process on a single node or distributed across the nodes) may obtain or receive state information from each of the nodes and apply one of multiple supported garbage collection coordination policies to reduce the impact of garbage collection pauses, dependent on that information. For example, if the information indicates that a node is about to collect, the coordinator may trigger a collection on all of the other nodes (e.g., synchronizing collection pauses for batch-mode applications where throughput is important) or may steer requests to other nodes (e.g., for interactive applications where request latencies are important).

Computer systems and methods for scheduling garbage collection in a distributed environment that includes multiple partitions that reference various data blocks that store data objects. A global occupancy aggregator may access occupancy information for each of the partitions from an occupancy index of each of the partitions. This occupancy information specifies a portion of storage resources occupied by those data blocks referenced by each of the partitions. The global occupancy aggregator may aggregate the accessed occupancy information to generate a global occupancy index that combines the occupancy information of the partitions. The global occupancy aggregator may generate a global schedule for garbage collection for the partitions based on the global occupancy index. The global schedule specifies which of the data blocks included in the global occupancy index are to be subjected to garbage collection.

A method for use with a garbage collector to provide garbage collection is disclosed. The garbage collection is a concurrent garbage collection provided in a dedicated thread concurrently running in a computing device with a mutator thread. The concurrent garbage collection is triggered based on a dynamically tunable parameter from a previous garbage collection in closed loop feedback.

A computing resource service provider implements a verification engine for hierarchical data structures. The verification engine uses a work item queue, a node allocation counter list, and a memory deallocation list to increase parallelism and thread utilization during verification operations involving ordered, nominally sorted data structures.

Embodiments of the application provide a resource reclamation method and a resource reclamation apparatus. The method includes: determining a memory region corresponding to a target tenant included by a heap memory as a target region; and performing resource reclamation on the target region to release the target region.