Abstract: A storage system receives a request to read data that is located in a wordline undergoing a program operation. Instead of waiting for the program operation to complete, which would increase read latency, the storage system aborts the program operation and reconstructs the data from successfully-programmed memory cells in the wordline and from data latches associated with unsuccessfully-programmed memory cells in the wordline. The reconstructed data is then sent to the host. The program abort command can be similar to one used to provide a graceful shutdown in a power-loss situation.

Abstract: Techniques are provided for multi-tier write allocation. A storage system may store data within a multi-tier storage environment comprising a first storage tier (e.g., storage devices maintained by the storage system), a second storage tier (e.g., a remote object store provided by a third party storage provider), and/or other storage tiers. A determination is made that data (e.g., data of a write request received by the storage system) is to be stored within the second storage tier. The data is stored into a staging area of the first storage tier. A second storage tier location identifier, for referencing the data according to a format utilized by the second storage tier, is assigned to the data and provided to a file system hosting the data. The data is then destaged from the staging area into the second storage tier, such as within an object stored within the remote object store.

Abstract: An information handling system may include at least one processor and a memory. The information handling system may be configured to store a first set of data comprising an operating system in a first location; store a second set of data comprising application data in a second location; expose the first and second sets of data in a combined union mount filesystem; and create a backup of the second set of data, but not the first set of data, by creating a copy of the second location.

Abstract: The present disclosure provides techniques for deduplicating files. The techniques include creating a cache or subset of a large data structure. The large data structure organizes information by random hash values. The random hash values result in a random organization of information within the data structure, with the information spanning a large number of storage blocks within a storage system. The cache, however, is within memory and is small relative to the data structure. The cache is created so as to contain information that is likely to be needed during deduplication of a file. Having needed information within memory rather than in storage results in faster read and write operations to that information, improving the performance of a computing system.

Abstract: Disclosed herein are systems and method for moving a process from a host to a virtual machine (VM). In one exemplary aspect, a method comprises freezing the process at a host operating system (OS) of the host; transferring at least one kernel object of the process from the host OS to a VM OS of the VM; reconfiguring at least one input-output (IO) resource of the process to point to a host-VM channel such that data flow between the host and the VM is enabled; remapping at least one page of the memory into the VM OS; in response to determining that at least one library mapped into the process matches between the host OS and the VM OS, configuring a corresponding memory map of the process to point to at least one library in the VM OS; and unfreezing the process at the VM OS.

Abstract: The disclosed embodiments provide a system that identifies a user of an electronic device. During a training mode, the system uses an initial training data set, comprising sensor data from electronic devices associated with a set of initial users, to train a multilayer neural network model to authenticate the initial users. Next, the system uses an additional training data set, which includes sensor data from electronic devices associated with one or more new users, to update a portion of the weights in the trained model so that the updated model can be used to authenticate both the initial users and the one or more new users. During a subsequent mode, the system uses the updated model to authenticate a user of the electronic device based on sensor data contemporaneously received from the electronic device.

Abstract: A memory apparatus and method of operation are provided. The memory apparatus includes memory cells configured to retain a threshold voltage. The memory cells are connected to one of a plurality of word lines and are arranged in strings comprising a plurality of blocks. A control means is coupled to the plurality of word lines and the strings and is configured to periodically determine a read frequency metric associated with a plurality of read operations of one of the plurality of blocks of the memory cells. The control means is also configured to relocate data of the one of the plurality of blocks and cause the one of the plurality of blocks to remain unused for a predetermined relaxation time based on the read frequency metric.

Abstract: A first cluster and a second cluster include at least one single-threaded main controller, the at least one single-threaded main controller processes one access request requesting for data at a time, and the data accessed by the access request is jointly managed by the first cluster and the second cluster. A database server determines hot data managed by the first cluster and determines whether a migration condition for migrating the hot data to the second cluster is met. The second cluster manages hot data that meets the migration condition. The database server migrates the hot data that meets the migration condition to the second cluster and triggers an update of an access path of the hot data.

Abstract: Methods, systems, and devices for providing for providing computer implemented services using managed systems are disclosed. To improve the likelihood of the computer implemented services being provided, a subscription based model may be used to manage the managed systems. The subscription based model may provide for automatic configuration of and software deployment to any number of managed systems to provide subscribed to solutions to various users. Over time, the solutions desired by users may change. The subscription based model may facilitate automatic disablement of existing solutions thereby allowing users to only receive subscribed to solutions using managed systems. To provide for continuity of solutions, the automated disablement may take into account data compatibility, and may proactively reformat or otherwise modify data to reduce data incompatibility. Consequently, users of the solutions may be provided with a continuous experience through solution data retention.

Abstract: An information handling system is configured, during a pre-extensible firmware interface initialization phase of the information handling system, to learn capabilities of components of the information handling system, create a hand-off block for storage of a virtual graphical browser firmware volume payload, and store learned capabilities of the components of the information handling system in the hand-off block. During a driver execution environment phase, the information handling system may retrieve the learned capabilities of the components of the information handling system stored in the hand-off block, publish learned capabilities retrieved from the hand-off block, retrieve the virtual graphics browser firmware volume payload stored in the hand-off block, and dispatch a virtual graphics browser learning driver and a virtual graphics browser interpreter driver based on retrieved virtual graphics browser firmware volume payload.

Abstract: A method and apparatus for data transfer in RRC_INACTIVE state is provided. Method for data transfer in RRC_INACTIVE state includes receiving configuration information for second resume procedure, initiating second resume procedure and transmitting a uplink RRC message together with data in a MAC PDU.

Abstract: Techniques described herein relate to a method for distributed data management. The method may include obtaining data descriptors for an application executing on a data host, performing a dataset policy analysis using the data descriptors to determine a data placement for a dataset associated with the application using a global name repository, performing, based on the data policy analysis, the data placement, and based on the data placement, updating the global name repository.

Abstract: Described are techniques for modeling processing performed in a data storage system. Inputs received may include a plurality of workloads each denoting a workload for one of a plurality of storage groups, a plurality of service level objectives each denoting a target level of performance for one of the plurality of storage groups, a plurality of capacities each denoting a storage capacity of one of a plurality of storage tiers, and a plurality of maximum workloads each denoting a maximum workload capability of one of the plurality of storage tiers. Using the inputs, placement of data of the plurality of storage groups on the plurality of storage tiers may be modeled. Output(s) may be generated based on the modeling where the output(s) may include an amount of each of the plurality of storage tiers allocated by modeling to each of the plurality of storage groups.

Abstract: A request to perform a program operation at a memory device is received. Whether a firmware block record is to be modified to correspond with a device block record is determined based on parameters associated with the program operation. The firmware block record tracks entries of the device block record. Responsive to determining that the firmware block record is to be modified, the firmware block record is modified to correspond with the device block record.

Abstract: A vehicle travel locus transmission system to be mounted on a vehicle includes a GNSS receiver, a vehicle-side transceiver, a locator processor, a wheel speed sensor, a gyro sensor, and an acceleration rate sensor. The locator processor generates, on predetermined cycles, a latest first linear coordinate as a linear function parameter that couples latest first positional coordinates and second positional coordinates on a previous cycle. The first and second positional coordinates are to be acquired on the basis of a positioning signal received by the GNSS receiver. On the condition that an angle formed by the first linear coordinate with an extension of a second linear coordinate generated on the previous cycle exceeds a predetermined threshold, the locator processor sends data regarding the first linear coordinate together with vehicle identification data, from the vehicle-side transceiver to an external device.

Abstract: According to one embodiment, in response to receiving a first namespace create command specifying a first attribution from a host, a controller creates a first namespace having the first attribution and a first logical address range. The first logical address range includes logical addresses. The controller sets each of the logical addresses to an unallocated state in which a physical address of the nonvolatile memory is not mapped, during a first period from a time when receiving a power loss advance notification or when detecting an unexpected power loss until a time when the controller becomes a ready state by resupply of a power to the memory system.

Abstract: Various embodiments provide for one or more processor instructions and memory instructions that enable a memory sub-system to predict a schedule for migrating data between memory devices, which can be part of a memory sub-system.

Abstract: Systems, apparatuses, and methods related to storage device operation orchestration are described. A plurality of computing devices (or “tiles”) can be coupled to a controller (e.g., an “orchestration controller”) and an interface. The controller can control operation of the computing devices. For instance, the controller can include circuitry to request a block of data from a memory device coupled to the apparatus, cause a processing unit of at least one computing device of the plurality of computing devices to perform an operation on the block of data in which at least some of the data is ordered, reordered, removed, or discarded, and cause, after some of the data is ordered, reordered, removed, or discarded, the block of data to be transferred to the interface coupled to the plurality of computing devices.

Abstract: The disclosed technology relates determining a first subset of a plurality drives having a first zone size and a second subset of the plurality of drives having a second zone size different from the first zone size, within a redundant array of independent disks (RAID) group. A prevailing zone size between the first zone size and the second zone size is determined. One or more logical zones within the determined first subset of the plurality of drives and the determined second subset of the plurality of drives for a received input-output operation is reserved based on the determined prevailing zone size. The received input-output operation is completed within the reserved one or more logical zones within the determined first subset of the plurality of drives and the determined second subset of the plurality of drives.

Abstract: A memory controller includes a map buffer and a map update controller. The map buffer includes storage areas that respectively correspond to one or more indices. The map update controller stores metadata in a storage area corresponding to a target index among the one or more indices, and updates the metadata based on an update of mapping data for a first logical address. The metadata includes history information of a physical address mapped to the first logical address.

Abstract: A request to write data corresponding to at least a first portion of a file is received. It is determined whether to perform the request either as an in-place write or as an out-of-place write. Performing the in-place write comprises performing a write to a low latency storage device, and performing the out-of-place write comprises performing a write to a higher latency storage device. The request is performed as either the in-place write or the out-of-place write based on the determination. Performing the request as the in-place write includes writing the data to a first location on a storage tier storing the first portion of the file, and performing the request as the out-of-place write includes writing the data to a second location on one of a plurality of storage tiers of a computing node, other than the first location.

Abstract: A variety of applications can include apparatus and/or methods of operating the apparatus in which storage in the memory device is managed. An allocation can include conducting a garbage collection procedure to free up one or more blocks. In various embodiments, execution of a garbage collection procedure can be based on operation of two tables with respect to a logical to physical mapping table split into logical to physical mapping table regions saved in the memory device. The first table can maintain counts of valid pages in blocks for a logical to physical mapping table region. The second table can include bits to identify logical to physical mapping table regions involved in the garbage collection procedure based on the entries in the first table. Search of the second table can determine logical to physical mapping table regions involved in the garbage collection. Additional apparatus, systems, and methods are disclosed.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a first storage pool to a second storage pool; identifying entries in a first table corresponding to rank extents in the first storage pool containing the data; allocating and synchronizing a plurality of second tables for the identified entries of the first table that are located in the volume; transferring the data associated with the volume from the rank extents in the first storage pool containing the data to one or more rank extents in the one or more ranks of the second storage pool; and updating the second tables to correspond to the transferred data in the one or more rank extents in the one or more ranks of the second storage pool.

Abstract: Solutions for supporting storage using a multi-writer log-structured file system (LFS) are disclosed that include receiving incoming data from an object of a plurality of objects that are configured to simultaneously write to the LFS from different nodes; based at least on receiving the incoming data, determining whether sufficient free segments are available in a local segment usage table (SUT) for writing the incoming data; based at least on determining that insufficient free segments are available, requesting allocation of new free segments; writing the incoming data to a log; acknowledging the writing to the object; determining whether the log has accumulated a full segment of data; based at least on determining that the log has accumulated a full segment of data, writing the full segment of data to a first segment of the free segments; and updating the local SUT to mark the first segment as no longer free.

Abstract: Various examples are directed to systems and methods in which a flow controller of a first synchronous flow may receive an instruction to execute a first loop using the first synchronous flow. The flow controller may determine a first iteration index for a first iteration of the first loop. The flow controller may send, to a first compute element of the first synchronous flow, a first synchronous message to initiate a first synchronous flow thread for executing the first iteration of the first loop. The first synchronous message may comprise the iteration index. The first compute element may execute an input/output operation at a first location of a first compute element memory indicated by the first iteration index.

Abstract: A method for mitigating cold starts in recommendations includes receiving a request that identifies a requested page and identifying a content vector of the requested page. The content vector is generated based on providing text of the requested page to a neural network text encoder. The method further includes selecting, based on the content vector, a link to a cold start page that does not satisfy a threshold level of interaction data. The selected link is ranked above a second link to a warm page that does satisfy the threshold level of the interaction data. The method further includes presenting the requested page with the selected link.

Abstract: Method and system are provided for storage allocation enhancement of microservices. A method carried out at a microservice orchestrator, includes: categorizing a microservice container, wherein the categorization defines a predicted storage behavior of the microservice container input/output operations; and providing the categorization in association with the microservice container input/output operations to a storage system for use in storage allocation of the input/output operations. A method at a storage controller includes: receiving microservice container input/output operations with an associated categorization, wherein the categorization defines a predicted storage behavior of the microservice container input/output operations; and using the associated categorization for optimizing storage allocation for the input/output operations and/or optimizing garbage collection performance.

Abstract: Methods, systems, and devices for dynamic superblocks are described. In some examples, a superblock may be established across one or more dice of a memory device. A superblock may include one or more blocks from a plurality of planes of a memory die, and may be associated with a first performance cursor or a second performance cursor. The superblock may be established based on one or more criteria, such as a quantity of available blocks in a plane, a quantity of access operations performed on one or more blocks in a plane, or other criteria. Establishing a superblock associated with a first performance cursor may allow for performance criteria established by a host device to be maintained, while establishing a superblock associated with a second performance cursor may allow for garbage collection, wear leveling, and other maintenance operations to be performed on the memory device.

Abstract: Systems, devices, and methods discussed herein enable the provisioning of one or more virtual resources within a cloud-computing environment based at least in part on user-defined constraints. By way of example, a request to provision one or more virtual resources within the cloud-computing environment may be received. The request may include a set of user-defined constraints. Placement data indicating a mapping of a particular virtual resource to a particular hardware resource may be obtained based at least in part on the set of user-defined constraints. The virtual resource(s) may be provisioned within the cloud-computing environment in accordance with the set of user-defined constraints based at least in part on utilization of the placement data.

Abstract: Various embodiments disclosed herein are related to a non-transitory computer readable storage medium. In some embodiments, the medium includes instructions stored thereon that, when executed by a processor, cause the processor to send an indication of a first storage location to a destination host. In some embodiments, the first storage location includes content that is swapped out from a memory location in a source host. In some embodiments, the indication includes one or more of a logical address and a first physical address. In some embodiments, the medium includes instructions stored thereon that, when executed by a processor, cause the processor to map the logical address of the first storage location to a second physical address of a second storage location. In some embodiments, the destination host accesses the content of the first storage location.

Abstract: IO traces on a high-speed memory that provides temporary storage for multiple storage volumes are stored in a trace buffer. IO operations on different storage volume are considered separate workloads on the high-speed memory. Periodically, the IO traces are processed to extract workload features for each workload. The workload features are stored in a feature matrix, and the workload features from multiple IO trace buffer processing operations are aggregated over time. A HDBSCAN unsupervised clustering machine learning process is used to create a set of four workload clusters and an outlier cluster. A dominant feature of each workload cluster is used to set a policy for the workload cluster. IO percentages for clusters with the same policies are used to set minimum sizes for policy regions in the high-speed memory. Histograms based on the workloads are used to determine segmentation rules specifying slot sizes for the policy regions.

Abstract: In one embodiment, a system for managing a virtualization environment includes a set of host machines, each of which includes a hypervisor, virtual machines, and a virtual machine controller, and a data migration system configured to identify one or more existing storage items stored at one or more existing File Server Virtual Machines (FSVMs) of an existing virtualized file server (VFS). For each of the existing storage items, the data migration system is configured to identify a new FSVMs of a new VFS based on the existing FSVM, send a representation of the storage item from the existing FSVM to the new FSVM, such that representations of storage items are sent between different pairs of FSVMs in parallel, and store a new storage item at the new FSVM, such that the new storage item is based on the representation of the existing storage item received by the new FSVM.

Abstract: A storage device communicably coupled to a host device and another storage device includes a memory and a processor coupled to the memory and configured to: write, in a case where an area release command of a transaction volume is issued from the host device while data backup processing is performed with the another storage device using a generation-managed transmission buffer, the area release command in a first generation of the transmission buffer; and switch, in a case where a range of data write processing requested by the host device overlaps a range specified by the area release command written in the first generation, a generation of the transmission buffer from the first generation to a second generation.

Abstract: A self-healing data synchronization process includes an initial stage in which a collection of data change events is received, a set of data record(s) corresponding to the data change event(s) is identified, and a syncing of the set of data record(s) is initiated. Data that indicates which data record(s) successfully synced and which failed is stored. During a subsequent stage of the self-healing process, data change events that occurred during a preceding time horizon are identified, a corresponding first set of data record(s) are identified, a difference between the first set and a second set of data record(s) that successfully synced during the time horizon is determined as a third set of data record(s), and any data record that was attempted to be synced during the time horizon but failed is excluded from the third set. A sync of any data record remaining in the third set is then initiated.

Abstract: Disclosed herein are systems and method for moving a process from a host to a virtual machine (VM). In one exemplary aspect, a method comprises freezing the process at a host operating system (OS) of the host; transferring at least one kernel object of the process from the host OS to a VM OS of the VM; reconfiguring at least one input-output (IO) resource of the process to point to a host-VM channel such that data flow between the host and the VM is enabled; mapping memory utilized by the process to the VM by remapping at least one page of the memory into the VM OS; and unfreezing the process at the VM OS.

Abstract: A storage system includes a storage drive that stores data and a plurality of storage apparatuses, each generating access data and writing data into the storage drive, and accessing data in the storage drive using the access data, and in a case of migrating the volume together with the access data between the storage apparatuses, one responsible for the write processing on the volume being migrated to a migration destination storage apparatus at a time of migration of the access data, and one responsible for the read processing on the volume being performed by a migration source storage apparatus using the access data, and the one responsible for the read processing being migrated to the migration destination storage apparatus after the access data is available for the migration destination storage apparatus.

Abstract: Techniques are disclosed relating to performing database defragmentation operations by autonomously rebuilding index objects stored in one or more tablespaces of a database. In various embodiments, the disclosed techniques include autonomously performing defragmentation operations for one or more tablespaces in a database in an online manner such that a server system may continue to service data access requests while performing the defragmentation operations. In one non-limiting embodiment, for example, the disclosed techniques include selecting a first tablespace to defragment based on its level of fragmentation (e.g., relative to the other tablespaces). The server system may then rebuild index objects, from the first tablespace, to a new tablespace such that the index objects are stored in the new tablespace without fragmentation.

Abstract: A processor tracks a frequency of access requests of a first index corresponding to a first data page of a plurality of data pages stored in a database. The processor determines the first index corresponding to the first data page having a frequency of access requests that exceeds a configurable target, and the processor retains, with preference, the first data page that corresponds to the first index, within the cache memory.

Abstract: A heterogeneous memory system is implemented using a low-latency near memory (NM) and a high-latency far memory (FM). Pages in the memory system include NM blocks stored in the NM and FM blocks stored in the FM. A page is assigned to a region in the memory system based on the proportion of NM blocks in the page. When accessing a block, the block address is used to determine a region of the memory system, and a block offset is used to determine whether the block is stored in NM or FM. The memory system may observe memory accesses to determine the access statistics of the page and the block. Based on a page's hotness and access density, the page may be migrated to a different region. Based on a block's hotness, the block may be migrated between NM and FM allocated to the page.

Abstract: A data processing system may include a plurality of memory modules, a controller, a power supply and a plurality of switches. Each of the memory modules may include a plurality of pages. The controller may control operations of the memory modules. The power supply may provide the memory modules with a power. The switches may be arranged corresponding to each of the memory modules. The switches may be selectively driven in response to a switch drive signal from the controller.

Abstract: A method, computer program product, and computing system for selecting target volumes within a storage system that are currently accessible to computing devices via first storage protocol paths via a first storage protocol for accessing via second storage protocol paths via a second storage protocol. For each of the selected target volumes, a first storage protocol identifier specific to each selected target volume may be associated with a second storage protocol identifier specific to each selected target volume. The first storage protocol paths and the second storage protocol paths may be grouped into a multipath group based upon the association between the first storage protocol identifier and the second storage protocol identifier. Access between the computing devices and the selected target volumes may be switched from the first storage protocol paths to the second storage protocol paths without application disruption and across multiple host platforms, including host-clusters.

Abstract: Methods, apparatus and computer software product for optimization of data transfer between two memories includes determining access to master data stored in one memory and/or to local data stored in another memory such that either or both of the size of total data transferred and the number of data transfers required to transfer the total data can be minimized. The master and/or local accesses are based on, at least in part, respective structures of the master and local data.

Abstract: A distributed data storage system using erasure coding (EC) provides advantages of EC data storage while retaining high resiliency for EC data storage architectures having fewer data storage nodes than the number of EC data-plus-parity fragments. To ameliorate the effects of certain storage node outages or fatal disk failures, incoming data is temporarily replicated so that read and write operations can continue from/to the storage system. The system automatically heals failed EC write attempts in a manner transparent to users and/or applications: when all storage nodes are operational, the distributed data storage system automatically converts the temporarily replicated data to EC storage and reclaims storage space previously used by the temporarily replicated data. Individual hardware failures are healed through migration techniques that reconstruct and re-fragment data blocks according to the governing EC scheme. An illustrative embodiment is a three-node data storage system using EC 4+2.

Abstract: A technique to facilitate efficient, parallelized execution of a program using a multiprocessor system having two or more processors includes detecting and, optionally, minimizing broadcast data communication between a shared memory and two or more processors. To this end, the broadcast space of a data structure is generated as an intersection of the reuse space of the data structure and the placement space of a statement accessing the data structure. A non-empty broadcast space implies broadcast data communication that can be minimized by rescheduling the statement accessing the data structure.

Abstract: Techniques for transmitting data may include: statically allocating a first buffer by a first entity; determining, by the second code entity, whether first data to be returned to the first entity fits into a data area of the first buffer; storing the first data in the data area of the first buffer responsive to determining the first data fits into the data area of the first buffer; and responsive to determining the first data does not fit into the data area of the first buffer, performing first processing by the second entity to store the first data in a dynamically allocated second buffer having a descriptor stored in the first buffer. The descriptor may include the address and size of the second buffer. The first and second entity may be code entities in the same system, or may be different systems that communicate using a remote direct memory access protocol.

Abstract: Techniques involve: detecting whether a first set of disks include an inaccessible disk, respective disk sections in the first set of disks forming a first set of stripes; in response to detecting the first set of disks including the inaccessible disk, determining faulty stripes in the first set of stripes, the faulty stripes including a first number of inaccessible disk sections; and in response to the first number exceeding a second number of free sections of the first set of disks, moving data in at least one stripe in the first set of stripes to free sections of the second set of disks to release sections of the at least one stripe, respective disk sections in the second set of disks forming a second set of stripes, each stripe in the first set of stripes and the second set of stripes having the same number of sections.

Abstract: A variety of applications can include apparatus and/or methods of operating the apparatus in which storage in the memory device is managed. An allocation can include conducting a garbage collection procedure to free up one or more blocks. In various embodiments, execution of a garbage collection procedure can be based on operation of two tables with respect to a logical to physical mapping table split into logical to physical mapping table regions saved in the memory device. The first table can maintain counts of valid pages in blocks for a logical to physical mapping table region. The second table can include bits to identify logical to physical mapping table regions involved in the garbage collection procedure based on the entries in the first table. Search of the second table can determine logical to physical mapping table regions involved in the garbage collection. Additional apparatus, systems, and methods are disclosed.

Abstract: Methods and systems are provided for modifying configuration of a storage system using artificial intelligence. An exemplary method comprises collecting, over a period of time, health and parameter information of the storage system. The method comprises predicting, using a machine learning algorithm, upcoming events that may degrade performance of the storage system based on the health and parameter information. The method comprises determining that the storage system will not operate in accordance with a set of goals based on the upcoming events. In response to determining that the storage system will not operate in accordance with the set of goals, the method comprises generating parameter changes, and applying the parameter changes to the storage system.

Abstract: Data replication groups may be used to store data in a distributed computing environment. A data replication group may include a set of nodes executing a consensus protocol to maintain data durably. In order to increase efficiency and performance of the data replication group leadership and/or fitness information may be determined for each node of the set of nodes executing the consensus protocol. The fitness information may be based at least in part on information associated with computing resource in the distributed computing environment and one or more constraints on assignment of a role of master node in the data replication group. The master node may be responsible for advancing the data replication group.

Abstract: Techniques involve: determining a source disk slice from a plurality of disk slices of a plurality of storage arrays providing redundant storage, target data on the source disk slice needing to be removed; determining a destination disk slice for storing the target data needing to be removed from the source disk slice, a destination disk where the destination disk slice is located being different from a source disk where the source disk slice is located; and moving the target data from the source disk slice to the destination disk slice. Accordingly, such techniques can improve efficiency of a storage system.