公开(公告)号：US08458145B2

公开(公告)日：2013-06-04

申请号：US13010337

申请日：2011-01-20

申请人： Haim Kopylovitz ,  Julian Satran ,  Yechiel Yochai

发明人： Haim Kopylovitz ,  Julian Satran ,  Yechiel Yochai

IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F3/06

CPC分类号： G06F3/0641 ,  G06F3/0608 ,  G06F3/0689

摘要： A method and system are disclosed for storage optimization. Data parts and metadata within a source data unit are identified and the data parts are compared with data which is already stored in the physical storage space. In case identical data parts are found within the physical storage, the data parts from the source data unit are linked to the identified data, while the data parts can be discarded, thereby reducing the required storage capacity. The metadata parts can be separately stored in a designated storage area.

摘要翻译： 公开了用于存储优化的方法和系统。 识别源数据单元内的数据部分和元数据，并将数据部分与已经存储在物理存储空间中的数据进行比较。 在物理存储器内发现相同的数据部分的情况下，来自源数据单元的数据部分被链接到所识别的数据，同时可以丢弃数据部分，从而减少所需的存储容量。 元数据部分可以单独存储在指定的存储区域中。

公开(公告)号：US07957398B1

公开(公告)日：2011-06-07

申请号：US11682049

申请日：2007-03-05

申请人： Yechiel Yochai ,  Helen S. Raizen ,  Harold M. Sandstrom ,  Edith Epstein

发明人： Yechiel Yochai ,  Helen S. Raizen ,  Harold M. Sandstrom ,  Edith Epstein

IPC分类号： H04L12/28

CPC分类号： G06F13/385 ,  G06F3/0613 ,  G06F3/0635 ,  G06F3/0683 ,  G06F13/102 ,  G06F2213/3802 ,  H04L45/00 ,  H04L47/10 ,  H04L49/90

摘要： Methods and systems are disclosed that relate to selecting a path for sending an I/O request from a host to a data storage subsystem from among a plurality of paths from the host to the subsystem. An exemplary method includes identifying a limitation on the traffic level for the plurality of paths, tracking a first metric corresponding to the limitation on the traffic level for each path, and transmitting a first I/O request having an urgency level other than the highest urgency level by one of the plurality of paths whose first metric does not exceed its limitation on the traffic level.

摘要翻译： 公开了涉及从从主机到子系统的多个路径中选择用于从主机向数据存储子系统发送I / O请求的路径的方法和系统。 一种示例性方法包括识别针对多个路径的业务级别的限制，跟踪与每个路径的业务级别的限制相对应的第一度量，以及发送具有紧急度级别而不是最高紧急度的第一I / O请求 通过其第一度量不超过其对业务量的限制的多个路径中的一个路由。

公开(公告)号：US07406574B1

公开(公告)日：2008-07-29

申请号：US10081682

申请日：2002-02-25

申请人： Amnon Naamad ,  Yechiel Yochai ,  Sachin More

发明人： Amnon Naamad ,  Yechiel Yochai ,  Sachin More

IPC分类号： G06F12/06

CPC分类号： G11B20/1217 ,  G06F12/0866 ,  G11B20/1883 ,  G11B2020/1238 ,  G11B2020/1285 ,  G11B2020/1826 ,  G11B2220/20

摘要： A method for implementing the invention is carried out in a data-storage system having a data storage unit that includes at least two constituent data storage elements. Each of the constituent data storage elements is either in a first state or a second state. The method includes providing a data structure having an entry corresponding to the data storage unit. The entry includes status information indicating whether at least one constituent data storage element of the data storage unit is in the first state. These entries are updated as necessary following any changes in state of the constituent data storage element. Scanning the data storage units instead of the data storage elements provides a more efficient way to locate data storage elements in the first state, particularly where such data storage elements are rare.

摘要翻译： 实现本发明的方法在具有数据存储单元的数据存储系统中进行，所述数据存储单元包括至少两个构成数据存储元件。 每个组成数据存储元件处于第一状态或第二状态。 该方法包括提供具有与数据存储单元对应的条目的数据结构。 该条目包括指示数据存储单元的至少一个构成数据存储元件是否处于第一状态的状态信息。 在组成数据存储元件的状态的任何改变之后，根据需要更新这些条目。 扫描数据存储单元而不是数据存储元件提供了一种更有效的方式来将数据存储元件定位在第一状态，特别是在这种数据存储元件是罕见的情况下。

公开(公告)号：US06954833B1

公开(公告)日：2005-10-11

申请号：US09895941

申请日：2001-06-29

申请人： Yechiel Yochai ,  Sachin More ,  Ron Arnan

发明人： Yechiel Yochai ,  Sachin More ,  Ron Arnan

IPC分类号： G06F12/00 ,  G06F12/16

CPC分类号： G06F11/2069 ,  G06F3/0605 ,  G06F3/061 ,  G06F3/0631 ,  G06F3/065 ,  G06F3/0653 ,  G06F3/0689 ,  G06F11/201 ,  G06F11/2071 ,  G06F11/2089

摘要： A seek minimizing process for use in storage controller of a data storage system is presented. The process collects statistics for physical devices storing mirrored logical volumes. The statistics include utilization and activity level. The process determines from the statistics the top n busiest physical devices. The process evaluates each of the n physical devices for mirror policy adjustment that will result in reduced seek time when the utilization of the physical device is greater than a threshold, for example, 50%.

摘要翻译： 提出了一种用于数据存储系统的存储控制器的搜索最小化过程。 该进程收集存储镜像逻辑卷的物理设备的统计信息。 统计资料包括利用率和活动水平。 这个过程从统计数据中确定了最繁忙的物理设备。 该过程评估用于镜像策略调整的n个物理设备中的每一个，这将导致当物理设备的利用率大于阈值（例如，50％）时减少的寻道时间。

公开(公告)号：US06529998B1

公开(公告)日：2003-03-04

申请号：US09705991

申请日：2000-11-03

申请人： Yechiel Yochai ,  Robert S. Mason

发明人： Yechiel Yochai ,  Robert S. Mason

IPC分类号： G06F1200

CPC分类号： G06F12/0862 ,  G06F12/0866

摘要： A method for adaptively selecting an optimal pre-fetch policy between a first pre-fetch policy, in which a request for desired data from a data-set is satisfied by reading the desired data, and a second pre-fetch policy, in which a request for desired data from a data-set is satisfied by reading the data-set. The method includes collecting statistics on a number of avoidable read-misses. On the basis of the statistics, a first threshold value is defined and frequently updated. Upon detection of an unavoidable read-miss, a random number is generated and the optimal pre-fetch policy is selected on the basis of a sign of a difference between the threshold value and the random number.

摘要翻译： 一种用于在第一预取策略之间自适应地选择最佳预取策略的方法，其中通过读取所需数据来满足来自数据集的期望数据的请求以及第二预取策略，其中， 通过读取数据集来满足来自数据集的期望数据的请求。 该方法包括收集关于多个可避免的读取错误的统计信息。 在统计的基础上，定义并频繁地更新第一阈值。 在检测到不可避免的读 - 未命中时，产生随机数，并且基于阈值和随机数之间的差的符号来选择最佳预取策略。

公开(公告)号：US09645943B2

公开(公告)日：2017-05-09

申请号：US14000889

申请日：2012-02-22

申请人： Haim Kopylovitz ,  Leo Corry ,  Yechiel Yochai

发明人： Haim Kopylovitz ,  Leo Corry ,  Yechiel Yochai

IPC分类号： G06F12/00 ,  G06F12/109 ,  G06F3/06

CPC分类号： G06F3/0631 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0664 ,  G06F3/0665 ,  G06F3/067

摘要： There is provided a storage arrangement and a method of operating thereof. The storage arrangement comprises a first storage system and one or more second storage systems operatively coupled to the first storage system. First control layer is operable to handle a first logical address space comprising a first logical group characterized by a plurality of logical block addresses; first control layer comprises a first mapping module handling a first mapping structure associated with first logical group. Each second control layer comprises, respectively, a second mapping module handling a second mapping structure associated with first logical group. The first mapping structure is configured to provide mapping between logical addresses related to first logical group and corresponding addresses related to first physical address spaces, and/or to point to respective second mapping structure configured to provide mapping between these logical addresses and corresponding addresses related to respective second physical address spaces.

公开(公告)号：US20140372394A1

公开(公告)日：2014-12-18

申请号：US13915645

申请日：2013-06-12

申请人： Amir Frankel ,  Yechiel Yochai

发明人： Amir Frankel ,  Yechiel Yochai

IPC分类号： G06F17/30

CPC分类号： G06F3/0619 ,  G06F3/0665 ,  G06F17/30088 ,  G06F17/30227

摘要： A method for generating transaction aware snapshots, the method may include: (a) starting a creation of a certain point in time snapshot for a consistency group that comprises at least one logical volume; (b) detecting that at the certain point in time there is an uncompleted transaction for writing multiple information units to the consistency group; the uncompleted transaction started at a transaction start point in time that precedes the certain point in time; (c) preventing an access to the certain point in time snapshot until a completion of the uncompleted transaction; and (d) associating the multiple information units with at least the certain point in time snapshot.

摘要翻译： 一种用于产生事务感知快照的方法，所述方法可以包括：（a）为包括至少一个逻辑卷的一致性组启动特定时间点快照的创建; （b）检测在某一时间点有一个未完成的交易，用于向一致性组写入多个信息单元; 未完成的交易从在特定时间点之前的交易开始点开始; （c）防止访问某个时间点快照，直到完成未完成的交易; 以及（d）将所述多个信息单元至少与所述特定时间点快照相关联。

公开(公告)号：US08868856B2

公开(公告)日：2014-10-21

申请号：US13173749

申请日：2011-06-30

申请人： Michael Dorfman ,  Yechiel Yochai

发明人： Michael Dorfman ,  Yechiel Yochai

IPC分类号： G06F13/00 ,  G06F13/28 ,  G06F12/08 ,  G06F17/30 ,  G06F1/32 ,  G06F11/14

CPC分类号： G06F12/0866 ,  G06F1/3221 ,  G06F1/3268 ,  G06F11/1448 ,  G06F17/30088 ,  G06F2212/261 ,  G06F2212/312 ,  Y02D10/154

摘要： A control layer of a data storage system is configured to identify one or more physical data units in the physical storage, which are associated only with corresponding logical snapshot data units, and to reallocate such physical snapshot data units to a dedicated storage space. The dedicated storage space can be a low-power storage space, which includes one or more disks designated as low power disks. The reallocation of snapshot data units to low power disks can be carried out according to an energy-aware migration policy, directed for minimizing the activation of the low power disks, and maintaining the disks in an inactive state for longer periods of time.

摘要翻译： 数据存储系统的控制层被配置为识别物理存储器中仅与对应的逻辑快照数据单元相关联的一个或多个物理数据单元，并且将这样的物理快照数据单元重新分配到专用存储空间。 专用存储空间可以是低功率存储空间，其包括被指定为低功率磁盘的一个或多个磁盘。 将快照数据单元重新分配到低功率磁盘可以根据能量感知迁移策略来执行，该策略旨在最小化低功率磁盘的激活，并将磁盘维持在非活动状态较长的时间段。

公开(公告)号：US08838889B2

公开(公告)日：2014-09-16

申请号：US13008946

申请日：2011-01-19

申请人： Yechiel Yochai ,  Leo Corry ,  Haim Kopylovitz

发明人： Yechiel Yochai ,  Leo Corry ,  Haim Kopylovitz

IPC分类号： G06F12/06 ,  G06F3/06 ,  G06F11/10

CPC分类号： G06F3/0614 ,  G06F3/0631 ,  G06F3/0689 ,  G06F11/1076 ,  G06F2206/1012 ,  G06F2211/1057

摘要： There are provides an allocation module and a method of allocating a logical disk to a next member of a given RAID group. The method comprises: identifying one or more physical disks comprising at least one logical disk with already allocated member of said given RAID group, thus giving rise to allocated physical disks; identifying one or more pairs constituted by at least one allocated physical disk with non-allocated physical disks, said pairs having minimal number of RAID groups with members allocated to both physical disks in the pair, thus giving rise to a first group of pairs with minimal contention value; and selecting among the first group of pairs with minimal contention value one or more non-allocated physical disks as candidate physical disks for allocating said next member MEMi+1 of said given RAID group, wherein 0

摘要翻译： 提供了将逻辑磁盘分配给给定RAID组的下一个成员的分配模块和方法。 该方法包括：识别包括具有所述给定RAID组的已经分配成员的至少一个逻辑磁盘的一个或多个物理磁盘，从而产生分配的物理磁盘; 识别由具有未分配的物理盘的至少一个分配的物理磁盘构成的一个或多个对，所述对具有最小数量的RAID组，其中成员被分配给所述对中的物理磁盘，由此产生具有最小的第一组对 争用价值 并且将具有最小争用值的第一组对中的一个或多个未分配的物理磁盘选择为用于分配所述给定RAID组的所述下一个成员MEMi + 1的候选物理磁盘，其中0