Abstract: According to the presently disclosed subject matter, malware induced data compression is harnessed for detecting infection of a host computer by the malicious software, which caused data compression. To this end, compressed ratio of the compressed data received from a host computer is compared with an expected compression ratio and based on the comparison it is determined whether the received data is suspected of being infected by a malware.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed to direct read access of a host computer device to a share storage space in a data storage system, as well as control of the direct read of the host computer device by a control computer device in the data storage system.

Abstract: A system for finding differences between a given block in two periodical snapshots. Data indicative of a coarse grain data structure corresponding to the given logical unit and including a plurality of entries wherein each entry is representative of a write or no-write operation to a respective memory chunk of in the logical unit. Data indicative of at least one bloom filter, each bloom filter includes a plurality of bits wherein each group of bits is representative of a probable false positive write indication or no-write operation to a block in the chunk. In response to a request to compare between a given block in at least two periodic snapshots: an older snapshotj and a younger snapshotk, perform: with respect to the block in a chunk, test in a selected bloom filter if the corresponding group of bits is representative of a false positive, and provide “possible snapshots difference” indication.

Abstract: The presently disclosed subject matter includes a data storage system and method for the purpose of migrating data in a distributed storage system comprising a plurality of separate storage areas.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed for enabling execution of deduplication during data writes in a distributed storage-system.

Abstract: The presently disclosed subject matter includes a computerized method and system of implementing a secret management scheme. According to the proposed approach, values derived from a secret are not distributed to the participating entities. Instead, each participating entity provides a respective preexisting identifier that is not derived from the secret.

Abstract: The presently disclosed subject matter includes a computer system and method that enable to encrypt and persist data stored on a volatile memory during an event that may result in the data being unavailable or destroyed. According to the disclosed technique, once the computer system regains its ability to safely store data on the volatile memory, the encrypted data is copied from the non-volatile memory used for persisting the data “as is” i.e. without being decrypted. The decryption is performed by the system's processing circuitry external to the non-volatile memory.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed to direct access of a host computer device to a share storage space in a storage system, as well as secured access control of the direct access of the host computer device by a control computer device in the storage system, the direct access including direct read access and direct write access.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed to direct read access of a host computer device to a share storage space in a data storage system, as well as control of the direct read of the host computer device by a control computer device in the data storage system.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed to protecting data stored in a data storage system using a RAID protection scheme, which enables, responsive to a storage device failure, to execute a rebuild process that uses a total number of storage devices which is greater than the number of segments in a RAID stripe.

Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed for enabling execution of garbage collection process in a distributed storage-system.

Abstract: According to an aspect of the presently disclosed subject matter, there is provided a system for managing data in a storage system, the system including a storage layer which provides storage resource, and a snapshot layer that includes: a volume-version data structure, a chunk-version data structure and a IO handler.

Abstract: The presently disclosed subject matter includes a data storage system and method for the purpose of migrating data in a distributed storage system comprising a plurality of separate storage areas.

Abstract: A IO handler receives a write command including write data that is associated with a LBA. The IO handler reserves a deduplication ID according to the LBA with which the write data is associated, within the scope of each LBA, each deduplication ID is unique. The IO handler computes a hash value for the write data. In case a deduplication database does not include an entry which is associated with the hash value, the IO handler: provides a reference key which is a combination of the LBA and the deduplication ID; adds to the deduplication database an entry which is uniquely associated with the hash value and references the reference key; and adds to a virtual address database an entry, including: the reference key; a reference indicator indicating if there is an entry that is associated with the present entry; and a pointer to where the write data is stored.

Abstract: A storage system, including: (a) a primary storage entity utilized for storing a data-set of the storage system; (b) a secondary storage entity utilized for backing-up the data within the primary storage entity; (c) a flushing management module adapted to identify within the primary storage entity two groups of dirty data blocks, each group is comprised of dirty data blocks which are arranged within the secondary storage entity in a successive sequence, and to further identify within the primary storage entity a further group of backed-up data blocks which are arranged within the secondary storage entity in a successive sequence intermediately in-between the two identified groups of dirty data blocks; and (d) said flushing management module is adapted to combine the group of backed-up data blocks together with the two identified groups of dirty data blocks to form a successive extended flush sequence and to destage it to the secondary storage entity.

Abstract: According to an aspect of the presently disclosed subject matter, there is provided a system for managing data in a storage system, the system including a storage layer which provides storage resource, and a snapshot layer that includes: a volume-version data structure, a chunk-version data structure and a IO handler.

Abstract: There is provided a computerized method, computerized system, a non-transitory program storage device and a computer program product for enabling allocation of segments in a RAID stripe to respective storage devices in a corresponding RAID group. A randomized distribution scheme is generated for randomly distributing the data segments and syndrome segments in a RAID stripe to respective storage devices in the RAID group. The randomized distribution scheme is used for distributing the segments in the at least one RAID stripe to the storage devices in the RAID group, such that any two failed storage devices in the RAID group would have the same first probability (P) for being protected by the same type-1 syndrome segment and the same second probability (1-P) for each one of the two failed storage devices being protected by a different type-1 syndrome segment, irrespective of the relative location of the two failed storage devices.

Abstract: The presently disclosed subject matter includes a data storage system and method for the purpose of migrating data in a distributed storage system comprising a plurality of separate storage areas.

Abstract: The disclosure presents examples of a RAID storage system, method and computer program product where a stripe is logically partitioned into two or more sub-stripes and at least one RAID erasure code is applied to each sub-stripe independently of any other of the sub-stripe(s). Consequently, in some of these examples, a larger packet size may be used than if the stripe had not been partitioned. A larger packet size may in some cases allow for accelerated encoding and/or decoding.

Abstract: There is provided a computerized method, computerized system, a non-transitory program storage device and a computer program product for enabling allocation of segments in a RAID stripe to respective storage devices in a corresponding RAID group. A randomized distribution scheme is generated for randomly distributing the data segments and syndrome segments in a RAID stripe to respective storage devices in the RAID group. The randomized distribution scheme is used for distributing the segments in the at least one RAID stripe to the storage devices in the RAID group, such that any two failed storage devices in the RAID group would have the same first probability (P) for being protected by the same type-1 syndrome segment and the same second probability (1-P) for each one of the two failed storage devices being protected by a different type-1 syndrome segment, irrespective of the relative location of the two failed storage devices.