A disk managing method includes: receiving a host Frame Information Structure (FIS) including multiple host logical Block Address Range Entries (LBA Range Entries) from a host; determining whether the LBA Range Entries satisfy a speed up processing condition; generating a first and a second addresses corresponding to a first and a second hard disks according to the host LBA Range Entries; and outputting a first and a second hard disk FIS to the first and the second hard disk for management. The number of first and second hard disk LBA Range Entries in the first and the second hard disk FIS are respectively half of the number of the host LBA Range Entries.

A system and method for adaptive RAID geometries. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array is configured to determine a first RAID layout for use in storing data, and write a first RAID stripe to the device group according to the first RAID layout. In response to detecting a first condition, the controller is configured to determine a second RAID layout which is different from the first RAID layout, and write a second RAID stripe to the device group according to the second layout, whereby the device group concurrently stores data according to both the first RAID layout and the second RAID layout.

In one embodiment, updating and searching of entries in a hardware content-addressable memory is coordinated to provide more searching bandwidth (e.g., for determining packet processing information), including, but not limited to, when vectors are moved among entries to free up desired entry positions for insertion of other vectors. A lookup operation in performed in content-addressable memory entries in a hardware content-addressable memory based on a lookup word to generate a content-addressable memory lookup result. Typically overlapping in time, a matching operation is performed in one or more transitory entries to generate a transitory matching result based on the lookup word. These transitory entries are populated with transitory vectors and have an associated index within the content-addressable memory, with these transitory vectors are subsequently inserted in the content-addressable memory at their associated index positions. A matching result is determined from the content-addressable memory lookup result and the transitory matching result.

Computer system and method for managing storage requests in a distributed storage system uses congestion data related to processing of storage requests for local storage to adaptively adjust a bandwidth limit for a first class of storage requests to be processed. The bandwidth limit is enforced on the storage requests belonging to the first class of storage requests without enforcing any bandwidth limit on the storage requests belonging to a second class of storage requests.

A method includes dispersed storage error encoding a data object into a plurality of sets of encoded data slices. The method further includes determining a local slice storage number, a local area network (LAN) slice storage number, and a wide area network (WAN) slice storage number, wherein a sum of the local slice number, the LAN slice storage number, and the WAN slice storage number equals the pillar width number. For at least some sets of encoded data slices, the method further includes sending the local slice storage number of encoded data slices to the local slice storage number of local memory devices; sending the LAN slice storage number of encoded data slices to the LAN slice storage number of LAN storage units of the DSN; and sending the WAN slice storage number of encoded data slices to the WAN slice storage number of WAN storage units of the DSN.

Embodiments of the present disclosure relate to managing volatile and non-volatile memory. A set of volatile memory sensor data may be obtained. A set of non-volatile memory sensor data may be obtained. The set of volatile memory sensor data and the set of non-volatile memory sensor data may be analyzed. A memory condition may be determined to exist based on the analysis. In response to determining that the memory condition exists, one or more memory actions may be issued.

An apparatus is described. The apparatus includes peer-to-peer intelligence to be integrated into a mass storage system having a cache and a backing store. The peer-to-peer intelligence is to move data between the cache and backing store without the data passing through main memory.

Apparatuses and methods are disclosed for protection of data servers configured for data replication of a database. As an example, one apparatus includes at least one processing circuit configured to receive records indicating respective modifications performed on a first version of the database stored in a first data server of the plurality of data servers. The at least one processing circuit is configured to delay replication of the modification in one or more additional servers in the plurality of data servers for a respective length of time specified for the servers in a security profile. While delaying replication of the modification, the processing circuit determines a probability that the modification is malicious based on a first set of factors indicated in a security profile. If the probability is greater than a threshold specified in the security profile, the processing circuit prevents the modification from being performed.

A memory system includes: a plurality of types of memory devices; and a controller including: a counter configured to determine R/W ratio; a data manager configured to generate meta data corresponding to the target data; and a selector configured to compare the R/W ratio with a threshold of each of the plurality of memory devices, respectively, and select a memory device for storing the target data and select a memory device for storing the meta data; a processor configured to store the target data and meta data in the each selected memory device.

Systems, methods, and computer programs are disclosed for managing memory channel connectivity. One embodiment of a system comprises a high-bandwidth memory client, a low-bandwidth memory client, and an address translator. The high-bandwidth memory client is electrically coupled to each of a plurality of memory channels via an interconnect. The low-bandwidth memory client is electrically coupled to only a portion of the plurality of memory channels via the interconnect. The address translator is in communication with the high-bandwidth memory client and configured to perform physical address manipulation when a memory page to be accessed by the high-bandwidth memory client is shared with the low-bandwidth memory client.