公开(公告)号：US08560508B2

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

申请号：US13189327

申请日：2011-07-22

申请人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman ,  Ori Shalev

发明人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman ,  Ori Shalev

IPC分类号： G06F17/30

CPC分类号： H03M7/30

摘要： Exemplary method, system, and computer program product embodiments for real-time column compression of data are provided. In one embodiment, by way of example only, a data structure is estimated for an initially unknown structured data. The estimated data structure is placed in a stream. A columnar compression operation is applied to the stream to generate an achieved compression ratio. The stream is compressed. Feedback of the achieved compression ratio is analyzed from the stream to determine if an optimal one of the columnar compression operations has been applied. If the optimal one of the columnar compression operations has been applied, the actual data structure of the initially unknown structured data is determined.

摘要翻译： 提供了用于数据的实时列压缩的示例性方法，系统和计算机程序产品实施例。 在一个实施例中，仅作为示例，针对最初未知的结构化数据估计数据结构。 估计的数据结构被放置在流中。 将柱状压缩操作应用于流以产生实现的压缩比。 流被压缩。 从流中分析实现的压缩比的反馈，以确定是否应用了最佳的一个柱状压缩操作。 如果已经应用了最佳的一个柱状压缩操作，则确定最初未知结构化数据的实际数据结构。

公开(公告)号：US08688753B2

公开(公告)日：2014-04-01

申请号：US13209293

申请日：2011-08-12

申请人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

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

CPC分类号： G06F3/0611 ,  G06F3/0667 ,  G06F3/067 ,  H04L67/1097

摘要： Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID.

摘要翻译： 提供了用于操作能够将逻辑数据对象（LO）变换为经变换的逻辑数据对象（TLO））的变换系统的各种实施例。 在一个这样的实施例中，拦截对某个LO并由至少一个客户端寻址到至少一个存储设备的开放LO请求。 获得与存储在所述至少一个存储装置中的所请求的LO相对应的TLO的标题中的标识符（ID）。 获得的ID用于表征TLO和LO。 确定变换系统是否处理至少一个具有与获得的ID具有相同值的ID的开放LO。 如果没有找到至少一个打开的LO，则请求的LO被打开。 生成对应于被截取的打开的LO请求的实例。 实例与获取的ID相关联。

公开(公告)号：US08539007B2

公开(公告)日：2013-09-17

申请号：US13275178

申请日：2011-10-17

申请人： Jonathan Amit ,  Chaim Koifman ,  Sergey Marenkov ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Chaim Koifman ,  Sergey Marenkov ,  Rostislav Raikhman

IPC分类号： G06F12/00 ,  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.

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

公开(公告)号：US08516006B2

公开(公告)日：2013-08-20

申请号：US13209281

申请日：2011-08-12

申请人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

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

CPC分类号： G06F3/0611 ,  G06F3/0667 ,  G06F3/067 ,  H04L67/1097

摘要： Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID.

公开(公告)号：US08484256B2

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

申请号：US13006369

申请日：2011-01-13

申请人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

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

CPC分类号： G06F3/0611 ,  G06F3/0667 ,  G06F3/067 ,  H04L67/1097

摘要： Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID.

摘要翻译： 提供了用于操作能够将逻辑数据对象（LO）变换为经变换的逻辑数据对象（TLO））的变换系统的各种实施例。 在一个这样的实施例中，拦截对某个LO并由至少一个客户端寻址到至少一个存储设备的开放LO请求。 获得与存储在所述至少一个存储装置中的所请求的LO相对应的TLO的标题中的标识符（ID）。 获得的ID用于表征TLO和LO。 确定变换系统是否处理至少一个具有与获得的ID具有相同值的ID的开放LO。 如果没有找到至少一个打开的LO，则请求的LO被打开。 生成对应于被截取的打开的LO请求的实例。 实例与获取的ID相关联。

公开(公告)号：US20110208789A1

公开(公告)日：2011-08-25

申请号：US13006369

申请日：2011-01-13

申请人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Chaim Koifman ,  Rostislav Raikhman

IPC分类号： G06F17/30

CPC分类号： G06F3/0611 ,  G06F3/0667 ,  G06F3/067 ,  H04L67/1097

摘要： Various embodiments for operating a transformation system, capable of transforming a logical data object (LO) to a transformed logical data object (TLO), are provided. In one such embodiment, an open LO request to a certain LO and addressed by the at least one client to the at least one storage device, is intercepted. An identifier (ID) in a header of a TLO corresponding to the requested LO and stored in the at least one storage device, is obtained. The obtained ID is used to characterize the TLO and the LO. A determination is made whether the transformation system handles at least one open LO characterized by an ID with a same value as the obtained ID. The requested LO is opened if at least one open LO is not found. An instance corresponding to the intercepted open LO request is generated. The instance is associated to the obtained ID.

公开(公告)号：US08930633B2

公开(公告)日：2015-01-06

申请号：US13523605

申请日：2012-06-14

申请人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F11/34 ,  G06F3/06

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内核的最小数量增加。

公开(公告)号：US08909608B2

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

申请号：US13523593

申请日：2012-06-14

申请人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

IPC分类号： G06F7/76 ,  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.

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

公开(公告)号：US08726039B2

公开(公告)日：2014-05-13

申请号：US13523613

申请日：2012-06-14

申请人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

发明人： Jonathan Amit ,  Amir Lidor ,  Sergey Marenkov ,  Rostislav Raikhman

IPC分类号： G06F21/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.

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