Abstract: Storage processing units or SPUs (120) operate backend storage (150) to provide scalable storage services, redundancy, and disaster recovery to an enterprise. Each SPU (120) may reside in a host server (110) and may include an processor domain (490) with backup power (440) and isolation from a host domain (480) to allow the SPU (120) to operate after the host (110) fails or otherwise stops providing power. A cloud-based management system (180) may assess the storage needs of the enterprise, identify a storage style suited to the enterprise, and direct the SPUs (120) to create virtual volumes (122, 124, 128) having characteristics according to the storage style identified. The cloud based management system (180) may eliminate the need for the enterprise to have expertise in storage management.

Abstract: Storage redundancy may be resynchronized without determining a snapshot difference. A storage component (210) owning a volume (122) can maintain current and expected generation numbers (212, 214) based on modification requests received and modification requests that a backup component (220) acknowledges completing. The backup (220) can maintain current and expected generation numbers (222, 224) based on modification requests received and applied to a backup volume (124). If either component (210, 220) fails and later returns to service, differences between the owner's current and expected generation numbers (212, 214) and the backup's current and expected generation numbers (222, 224) indicate which modification requests may have been missed and need to be reconstructed to restore synchronization.

Abstract: A storage system (400) includes a storage processor (420-1) such as a storage card resident in a host server (410-1) and coupled to the storage device (450-1). The storage processor (420-1) may be configured to create a virtual volume (428-1), store content derived from an image (492) downloaded from a URL storage corresponding to the virtual volume (428-1), and present the virtual volume (428-1) to the host server as a boot LUN. A management infrastructure (480) can be used to create a library (490) of images (492, 494) corresponding to different storage system characteristics and used to selected which URL is provided to the storage processor (420-1).

Abstract: A resynchronization operation (300) adapts according to activity histories (148) within a storage platform (100). An owner node (A) and a backup storage node (B) may track activity such as the IO operations begun and use recent activity to determine respective amounts of data the owner (A) and backup (B) can expect to process without unacceptably degrading storage services. The owner (A) transfer resynchronization data in chunks, each having a size limited by the current amounts the owner (A) and backup (B) determined from current activity. When activity is low or idle, large chunks may be sent to quickly complete resynchronization, while a busy system uses smaller chunks such that the system performance is not adversely affected.

Abstract: An initiating node (C) in a storage platform (100) receives a modification request (312, 314) for changing an object (O). The initiating node (C), using system configuration information (127), identifies an owner node (A) and a backup node (B) for the object (O) and sends change data (324, 334) to the owner node (A) and the backup node (B). The owner node (A) modifies the object (O) with the data (324) from the initiating node (C) and sends an update request (352) that does not include the data (324) to the backup node (B). The backup node (B) modifies a backup object (O?) with data (334) from the initiating node (C).

Abstract: In some examples, sectors of a solid-state drive are unmapped to initialize the sectors. The sectors include a data portion and a protection portion. When an unmapped sector is read, the solid-state drive can return a pre-set value for the unmapped sector, where the pre-set value includes a known fixed value to represent the protection portion of the unmapped sector. The storage controller is to recognize the known fixed value returned by the solid-state drive responsive to the read as representing the unmapped sector as being initialized, but not written to.

Abstract: A technique includes changing a configuration setting of a virtual volume of data stored in a storage system. The technique includes converting data of the virtual volume in place to reflect the changing of the configuration setting.

Abstract: Storage systems and methods provide efficient deduplication with support for fine grained deduplication or deduplication with variable sized blocks. The storage system does not overwrite data in backend media but tracks operations such as writes using generation numbers, for example, to distinguish writes to the same virtual storage locations. A deduplication index, a data index, and a reference index may be used when performing operations such as reads, writes with deduplication, relocation of data blocks within backend media, and garbage collection.

Abstract: A method for a storage system to process input and output operations. The method includes receiving writes over time to an address at a base virtual volume, storing each of the writes in a physical storage at a new location that is without existing data, tagging each stored write with a different generation number to distinguish between different versions of data written to the address at the base virtual volume, receiving a read of the address at the base virtual volume, and, in response to the read of the address at the base virtual volume, returning one of the stored writes that is tagged with a newer generation number than a remainder of the stored writes.

Abstract: Examples include compressed pages having data and compression metadata. Some examples include receiving a write request containing write data, storing the write data in data cache, and applying a page fit process to the write data. In some such examples, a virtual page table entry in a virtual page table may be generated for the processed write data. The virtual page table entry may include a compression index and a page address. An inline compression of the processed write data may be performed to compress and store the processed write data in a compressed page at a location associated with the compression index. In some examples, the compressed page may include a compression metadata having a reference count, a compressed page offset, and a virtual page address.

Abstract: A computer-implemented integrated framework for managing real-time financial trades and risk management is described herein. Quantitative and sentimental parameters of trading market are identified and analyzed. A stock selection module having a deep learning architecture performs future predictions based on the analyzed quantitative and sentimental parameters, wherein the stock selection module comprises. A probability number in percentage is assigned to a trading decision. Based on the assigned probabilities to different trading decisions, entrance and exit signals are provided to a user based on their preferences such as the user's risk tolerance.

Abstract: Methods and systems for collision handling during an asynchronous replication are provided. A system includes a cache memory system comprising a number of cache memory pages. A collision detector detects when a host is attempting to overwrite a cache memory page that has not been completely replicated. A revision page tagger copies the cache memory page to a free page and tags the copied page as protected.

Abstract: Examples include transaction management for a multi-node cluster. Some examples include generating a request log entry at an owner node that identifies a duplicate data location, tagging the duplicate data location with a requested tag, and issuing a zero-copy request that identifies the duplicate data location. In some such examples, a service node may generate a service log entry based on the zero-copy request that identifies the duplicate data location, process the zero-copy request, and tag the duplicate data location with a serviced tag. A determination may be made as to whether at least one of the owner node and the service node have failed and based on the determination that at least one has failed, the failed node may be recovered via at least one of the requested tag and the serviced tag of the duplicate data location.

Abstract: A port processor to receive a read command in a target port. In response, use the target to process a data transfer that includes use of memory for the read transfer allocated by a storage array controller prior to receipt of the read command by the target port or while processing the data transfer and selectively mark such memory as repurposable. The port processor to receive a write command in the target port. In response to receipt of the write command, use the target to process a data transfer for the initiator associated with the write operation, wherein the process includes use of memory that the storage array controller pre-allocated or allocated based on receipt of the read command by the target port for the transfer to the storage array controller and marked as repurposable.

Abstract: Disclosed herein are techniques for managing the performance of a storage system. A subset of a plurality of storage units is associated with a rule that specifies a number of input and output transactions and a number of bits per time unit. The associations are adjusted in accordance with a performance policy and changes in the subset of the plurality of storage units.

Abstract: Example implementations relate to determining lengths of acknowledgment delays for input/output (I/O) commands. In example implementations, a length of an acknowledgment delay for a respective I/O command may be based on cache availability, and activity level of a drive at which the respective I/O command is directed, after the respective I/O command has been executed. Acknowledgments for respective I/O commands may be transmitted after respective periods of time equal to respective lengths of acknowledgment delays have elapsed.

Abstract: A computer-implemented integrated framework for managing real-time financial trades and risk management is described herein. Quantitative and sentimental parameters of trading market are identified and analyzed. A stock selection module having a deep learning architecture performs future predictions based on the analyzed quantitative and sentimental parameters, wherein the stock selection module comprises. A probability number in percentage is assigned to a trading decision. Based on the assigned probabilities to different trading decisions, entrance and exit signals are provided to a user based on their preferences such as the user's risk tolerance.

Abstract: An example storage system may include storage media and a storage controller. The storage controller may be to establish virtual volumes, private data stores, and a deduplication data store, each being a virtual storage space of the storage media, wherein each of the private data stores is associated with one of the virtual volumes and the deduplication data store is shared among the virtual volumes. The storage controller may, in response to receiving input data that is to be stored in a given one of the virtual volumes, determine a signature for the input data and select between storing the input data in the private data store associated with the given one of the virtual volumes and storing the input data in the deduplication data store.

Abstract: A technique includes changing a configuration setting of a virtual volume of data stored in a storage system. The technique includes converting data of the virtual volume in place to reflect the changing of the configuration setting.

Abstract: Examples include compressed pages having data and compression metadata. Some examples include receiving a write request containing write data, storing the write data in data cache, and applying a page fit process to the write data. In some such examples, a virtual page table entry in a virtual page table may be generated for the processed write data. The virtual page table entry may include a compression index and a page address. An inline compression of the processed write data may be performed to compress and store the processed write data in a compressed page at a location associated with the compression index. In some examples, the compressed page may include a compression metadata having a reference count, a compressed page offset, and a virtual page address.