公开(公告)号：US20130339750A1

公开(公告)日：2013-12-19

申请号：US13523613

申请日：2012-06-14

申请人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

发明人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

IPC分类号： H04L9/00

CPC分类号： G06F21/602 ,  G09C1/00 ,  H04L2209/125

摘要： In a storage system, using a pool of encryption processing cores, the encryption processing cores are assigned to process either encryption operations, decryption operations, and decryption and encryption operations, that are scheduled for processing. A maximum number of the encryption processing cores are set for processing only the decryption operations, thereby lowering a decryption latency. A minimal number of the encryption processing cores are allocated for processing the encryption operations, thereby increasing encryption latency. Upon reaching a throughput limit for the encryption operations that causes the minimal number of the plurality of encryption processing cores to reach a busy status, the minimal number of the plurality of encryption processing cores for processing the encryption operations is increased.

摘要翻译： 在存储系统中，使用加密处理核心池，分配加密处理核以处理计划进行处理的加密操作，解密操作以及解密和加密操作。 设置最大数量的加密处理核以仅处理解密操作，从而降低解密等待时间。 分配最少数量的加密处理核以处理加密操作，从而增加加密等待时间。 在达到导致多个加密处理核心的最小数量达到忙碌状态的加密操作的吞吐量限制时，用于处理加密操作的多个加密处理核心的最小数量增加。

公开(公告)号：US20130339635A1

公开(公告)日：2013-12-19

申请号：US13523605

申请日：2012-06-14

申请人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

发明人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

IPC分类号： G06F12/00

CPC分类号： G06F3/0611 ,  G06F3/061 ,  G06F3/0613 ,  G06F3/0631 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0683 ,  G06F9/5061 ,  G06F9/5083 ,  G06F11/3409 ,  G06F11/3485 ,  G06F2209/5011 ,  G06F2209/504 ,  Y02D10/22

摘要： In a read processing storage system, using a pool of CPU cores, the CPU cores are assigned to process either write operations, read operations, and read and write operations, that are scheduled for processing. A maximum number of the CPU cores are set for processing only the read operations, thereby lowering a read latency. A minimal number of the CPU cores are allocated for processing the write operations, thereby increasing write latency. Upon reaching a throughput limit for the write operations that causes the minimal number of the plurality of CPU cores to reach a busy status, the minimal number of the plurality of CPU cores for processing the write operations is increased.

摘要翻译： 在读取处理存储系统中，使用CPU核心池，分配CPU内核来处理计划进行处理的写入操作，读取操作以及读取和写入操作。 设置最大数量的CPU内核仅处理读取操作，从而降低读取延迟。 分配最少数量的CPU内核来处理写入操作，从而增加写入延迟。 在达到使多个CPU内核的最小数量达到忙状态的写入操作的吞吐量限制时，用于处理写入操作的多个CPU内核的最小数量增加。

公开(公告)号：US20130339322A1

公开(公告)日：2013-12-19

申请号：US13523593

申请日：2012-06-14

申请人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

发明人： Jonathan AMIT ,  Amir LIDOR ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

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

CPC分类号： G06F17/30153 ,  G06F11/1464 ,  G06F17/30138 ,  H03M7/30 ,  H03M7/6023 ,  H04L47/70 ,  H04L69/04

摘要： In a compression processing storage system, using a pool of compression cores, the compression cores are assigned to process either compression operations, decompression operations, or decompression and compression operations, which are scheduled for processing. A maximum number of the compression cores are set for processing only the decompression operations, thereby lowering a decompression latency. A minimal number of the compression cores are allocated for processing the compression operations, thereby increasing compression latency. Upon reaching a throughput limit for the compression operations that causes the minimal number of the plurality of compression cores to reach a busy status, the minimal number of the plurality of compression cores for processing the compression operations is increased.

摘要翻译： 在压缩处理存储系统中，使用压缩核心池，分配压缩核以处理被调度进行处理的压缩操作，解压缩操作或解压缩和压缩操作。 设置最大数目的压缩核心仅处理解压缩操作，从而降低解压缩等待时间。 分配最小数量的压缩核来处理压缩操作，从而增加压缩等待时间。 在达到导致多个压缩核心的最小数量达到忙碌状态的压缩操作的吞吐量限制时，用于处理压缩操作的多个压缩核心的最小数量增加。

公开(公告)号：US20130097210A1

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

申请号：US13275178

申请日：2011-10-17

申请人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

发明人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV ,  Rostislav RAIKHMAN

IPC分类号： G06F17/30

CPC分类号： G06F12/0253 ,  G06F3/06 ,  G06F3/0608 ,  G06F3/064 ,  G06F3/0652 ,  G06F3/0689 ,  G06F17/30138 ,  G06F17/30191

摘要： Exemplary method, system, and computer program product embodiments for efficient garbage collection in a compressed journal file system are provided. In one embodiment, by way of example only, a map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. Additional system and computer program product embodiments are disclosed and provide related advantages.

摘要翻译： 提供了用于压缩日志文件系统中的有效垃圾收集的示例性方法，系统和计算机程序产品实施例。 在一个实施例中，仅作为示例，配置与具有重写的压缩日志条目的数据块相对应的映射。 计算每个被覆盖的压缩日志条目的加权条件。 加权条件从最低到最高排列在地图中。 加权条件之一包括朝向选择在至少一个关联记录的末尾具有自由空间的数据块的偏置变量。 公开了附加的系统和计算机程序产品实施例并提供相关的优点。

公开(公告)号：US20130262409A1

公开(公告)日：2013-10-03

申请号：US13538566

申请日：2012-06-29

申请人： Jonathan AMIT ,  Lilia DEMIDOV ,  Nir HALOWANI ,  Sergey MARENKOV

发明人： Jonathan AMIT ,  Lilia DEMIDOV ,  Nir HALOWANI ,  Sergey MARENKOV

IPC分类号： G06F17/30

CPC分类号： G06F3/0638 ,  G06F3/0608 ,  G06F3/0689 ,  G06F17/30595

摘要： For column compression of tabular data, similar type data segments are classified into classes for grouping the data segments into compression streams associated with each one of the classes. The compression streams are encoded based on a class-specific optimized encoding operation. The compression streams into one output buffer, wherein the compression streams are extracted.

摘要翻译： 对于表格数据的列压缩，类似的类型数据段被分类成用于将数据段分组成与每个类相关联的压缩流的类。 基于特定类别的优化编码操作对压缩流进行编码。 压缩流输入到一个输出缓冲器中，其中提取压缩流。

公开(公告)号：US20130179597A1

公开(公告)日：2013-07-11

申请号：US13345301

申请日：2012-01-06

申请人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV ,  Ori SHALEV

发明人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV ,  Ori SHALEV

IPC分类号： G06F3/00

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

摘要： Exemplary system and computer program product embodiments compression blocks input/output (I/O) reduction are provided. In one embodiment, by way of example only, data blocks are arranged into groups to provide a single I/O. Lists indicating the available block space for the data blocks are organized in advance according to space size. The data blocks required for a single command are allocated as the single I/O. The data blocks are sequentially ordered. Additional system and computer program product embodiments are disclosed and provide related advantages.

摘要翻译： 提供了示例性系统和计算机程序产品实施例压缩块输入/输出（I / O）减少。 在一个实施例中，仅作为示例，数据块被布置成组以提供单个I / O。 指示数据块的可用块空间的列表根据空间大小预先组织。 单个命令所需的数据块被分配为单个I / O。 数据块顺序排列。 公开了附加的系统和计算机程序产品实施例并提供相关的优点。

公开(公告)号：US20120124303A1

公开(公告)日：2012-05-17

申请号：US13355138

申请日：2012-01-20

申请人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

发明人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

IPC分类号： G06F12/00

CPC分类号： G06F17/30076 ,  G06F3/0661 ,  G06F9/30025

摘要： There are provided a method of transforming a non-transformed stored logical data object (LO) device into a transformed LO and system thereof. The method comprises: a) in response to a respective transformation request, logically dividing the non-transformed LO in a first segment and one or more non-transformed subsequent segments, the segments having predefined size; b) generating a header for the respective transformed LO; c) processing said first segment; d) overwriting said first segment by said generated header and said transformed first segment; e) indexing said first transformed segment and said one or more non-transformed subsequent segments as constituting a part of said transformed LO; f) generating at least one index section; and g) updating the indication in the header to point that the non-transformed LO has been transformed in the transformed LO comprising said generated header, said first transformed segment, said one or more subsequent segments comprising data in non-transformed form and said at least one index section.

公开(公告)号：US20130024632A1

公开(公告)日：2013-01-24

申请号：US13355123

申请日：2012-01-20

申请人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

发明人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

IPC分类号： G06F12/00

CPC分类号： G06F17/30076 ,  G06F3/0661 ,  G06F9/30025

摘要： There are provided a method of transforming a non-transformed stored logical data object (LO) device into a transformed LO and system thereof. The method comprises: a) in response to a respective transformation request, logically dividing the non-transformed LO in a first segment and one or more non-transformed subsequent segments, the segments having predefined size; b) generating a header for the respective transformed LO; c) processing said first segment; d) overwriting said first segment by said generated header and said transformed first segment; e) indexing said first transformed segment and said one or more non-transformed subsequent segments as constituting a part of said transformed LO; f) generating at least one index section; and g) updating the indication in the header to point that the non-transformed LO has been transformed in the transformed LO comprising said generated header, said first transformed segment, said one or more subsequent segments comprising data in non-transformed form and said at least one index section.

摘要翻译： 提供了一种将未变换的存储的逻辑数据对象（LO）设备变换成变换的LO及其系统的方法。 该方法包括：a）响应于相应的变换请求，在第一段和一个或多个未变换的后续段中逻辑地划分未变换的LO，所述段具有预定义的大小; b）产生用于各个变换LO的报头; c）处理所述第一段; d）通过所述生成的报头和所述变换的第一分段重写所述第一分段; e）将所述第一变换段和所述一个或多个未变换的后续段索引为构成所述变换LO的一部分; f）产生至少一个索引部分; 并且g）更新标题中的指示，以指示未经变换的LO已经在包含所述生成的报头，所述第一变换段，所述一个或多个后续段中的变换的LO中被变换，所述一个或多个后续段包括非变换形式的数据， 至少一个索引部分。

公开(公告)号：US20120117341A1

公开(公告)日：2012-05-10

申请号：US13383157

申请日：2010-07-27

申请人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

发明人： Jonathan AMIT ,  Chaim KOIFMAN ,  Sergey MARENKOV

IPC分类号： G06F12/02

CPC分类号： G06F17/30076 ,  G06F3/0661 ,  G06F9/30025

摘要： There are provided a method of transforming a non-transformed stored logical data object (LO) device into a transformed LO and system thereof. The method comprises: a) in response to a respective transformation request, logically dividing the non-transformed LO in a first segment and one or more non-transformed subsequent segments, the segments having predefined size; b) generating a header for the respective transformed LO; c) processing said first segment; d) overwriting said first segment by said generated header and said transformed first segment; e) indexing said first transformed segment and said one or more non-transformed subsequent segments as constituting a part of said transformed LO; f) generating at least one index section; and g) updating the indication in the header to point that the non-transformed LO has been transformed in the transformed LO comprising said generated header, said first transformed segment, said one or more subsequent segments comprising data in non-transformed form and said at least one index section.

摘要翻译： 提供了一种将未变换的存储的逻辑数据对象（LO）设备变换成变换的LO及其系统的方法。 该方法包括：a）响应于相应的变换请求，在第一段和一个或多个未变换的后续段中逻辑地划分未变换的LO，所述段具有预定义的大小; b）产生用于各个变换LO的报头; c）处理所述第一段; d）通过所述生成的报头和所述变换的第一分段重写所述第一分段; e）将所述第一变换段和所述一个或多个未变换的后续段索引为构成所述变换LO的一部分; f）产生至少一个索引部分; 并且g）更新标题中的指示，以指示未经变换的LO已经在包含所述生成的报头，所述第一变换段，所述一个或多个后续段中的变换的LO中被变换，所述一个或多个后续段包括非变换形式的数据， 至少一个索引部分。