International Business Machines Corporation

Emc Corporation

Marvell International Limited

Infinidat Ltd.

Quantum Corporation

Haim Bitner

Michael Hirsch

Lior Aronovich

Ron Asher

Eitan Bachmat

Shmuel Tomi Klein

Abhijeet Prakash Gole

Nadav Kedem

Sanjyot Tipnis

Samuel Krikler

Shay Haim Akirav

Yuval Ofek

Dan Arnon

Elena Drobchenko

Ariel J Ish-Shalom

Zoran Cakeljic

Sharon Galtzur

Shira Bash

Yechiel Yochai

Dana Hall

A method for monitoring a storage system event, the method may include receiving, by a control unit of a storage system, a request to access a gauge that is associated with the storage system event; updating, by the control unit, a value of the gauge based on (a) a time difference between a time related to the request to access the gauge and a time related to a previous request to access the gauge, and (b) a length of a sliding time window; wherein when the request to access the gauge is triggered by an occurrence of an instance of the storage system event then the updating is further responsive to the occurrence of the instance of the storage system event; and wherein the value of the gauge provides an approximation of an average rate of instances of the storage system event during the sliding time window.

Gauge for monitoring instances of a storage system event

A computer-implemented method, according to one embodiment includes, for each repository data chunk in repository data that comprises a plurality of the repository data chunks, generating a corresponding set of repository distinguishing characteristics (RDCs). Each set of RDCs is generated by: applying a hash function to the respective input data chunk or repository data chunk to generate a plurality of hashes, each hash comprising a hash value and a hash position within the data chunk, applying a first function to the plurality of generated hashes to identify a first subset of hashes distributed across the data chunk, applying a second function to the hash positions of the hashes of the first subset to identify a second subset of the plurality of generated hashes, and defining the second subset of hashes as the set of RDCs.

Systems and methods for efficient data searching, storage and reduction

The present disclosure includes apparatus, systems, computer readable storage media and techniques relating to virtualization of data storage space. In one aspect, a method performed by a data processing device includes identifying a subset of physical disks within a node. The identified subset includes at least one of the physical disks having at least one subdisk with free storage space. The node includes processing units and the physical disks arranged to form at least one group. A priority value is assigned to the identified subset of the physical disks. The identified subset of the physical disks is sorted based on the assigned priority value, and subdisks are selected from the sorted subset of the physical disks to form a logical disk.

Storage space allocation for logical disk creation

A computer program product for searching a repository of binary uninterpretted data, according to one embodiment, includes a computer readable storage medium having program instructions executable by a computer to cause the computer to perform a method comprising: analyzing, by the computer, segments of each of the repository and input data to determine a repository segment that is similar to an input segment, the analyzing including searching an index of representation values of the repository data for matching representation values of the input in a time independent of a size of the repository and linear in a size of the input data; and analyzing, by the computer, the similar repository segment with respect to the input segment to determine their common data sections while utilizing at least some of the matching representation values for data alignment, in a time linear in a size of the input segment.

The present disclosure includes apparatus, systems, computer readable storage media and techniques relating to virtualization of data storage space. In one aspect, a system includes: solid-state drive (SSD) devices, wherein each of the SSD devices includes contiguous portions; and a data storage controller configured to assign a priority value to each of available ones of the contiguous portions of the respective SSD devices, based on weighted criteria, and choose a subset of the available ones of the contiguous portions of the respective SSD devices, in accordance with the assigned priority values, to form a logical disk; wherein the logical disk includes at least one available portion from each of two or more of the SSD devices.

Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.

A system includes brick(s); and at least one processor programmed to operate a storage space manager for the brick(s); wherein each brick includes processing units and storage devices coupled therewith and having assigned primary processing units; wherein the storage space manager assigns a priority value to each available contiguous portion of the storage devices, based on weighted criteria, and chooses a subset of the available contiguous portions, in accordance with the assigned priority values, to form a logical disk, wherein the logical disk includes at least one available portion from each of two or more of the storage devices; and wherein the weighted criteria comprise capacity of a given processing unit to provide all storage device portions needed to complete a logical disk request from two or more storage devices to which the given processing unit is assigned as the primary processing unit.

The present disclosure includes apparatus, systems, computer readable storage media and techniques relating to virtualization of data storage space. In some implementations, a system includes storage devices, wherein each of the storage devices includes contiguous portions; and a data storage controller configured to assign a priority value to each of available ones of the contiguous portions of the respective storage devices, based on weighted criteria, and choose a subset of the available ones of the contiguous portions of the respective storage devices, in accordance with the assigned priority values, to form a logical disk; wherein the logical disk includes at least one available portion from each of two or more of the storage devices.

A method for managing read requests, the method may include receiving from a requesting entity a read request for reading an information unit stored in a storage system; determining by a control entity of the storage system whether the information unit is cached in a cache memory of the storage system and whether at least a predetermined number of disk drives of the storage system are currently overloaded; introducing a delay to a response to the read request thereby increasing a time difference between a time of the receiving of the read request and a time of a provision of the information unit to the requesting entity, if it is determined that the information unit is not cached in the cache memory and that the at least predetermined number of disk drives of the storage system are currently overloaded; and providing the information unit to the requesting entity.

System, method and a non-transitory computer readable medium for read throtling

The presently disclosed subject matter includes a method, system and apparatus, for dynamically controlling resource allocation in a storage system, the storage system comprises at least one storage device and at least one processing unit, the resources being associated with the processing unit. Responsive to a request from a connection for processing data, information in respect of an Allocation state of the processing unit is obtained. The Allocation state is defined as a Limiting Allocation state if the quantity of free resources associated with the processing unit, is lower than a first threshold value. In case the Allocation state of the processing unit is Limiting Allocation state, information in respect of a Connection state of the connection is obtained. The required memory resources are dynamically allocated to the connection according to the current Allocation state of the processing unit and the current Connection state of the connection.

Resources allocation in a computer storage system

Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. Additionally, remote operations are accomplished with significantly reduced system bandwidth by implementing remote differencing operations.

Growing community of inventors

Raanana, Israel

Haim Bitner