专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09645917B2 Specializing I/O access patterns for flash storage 有权
公开(公告)号：US09645917B2
公开(公告)日：2017-05-09
申请号：US13477966
申请日：2012-05-22
申请人： Christopher Small , Stephen M. Byan , James F. Lentini
发明人： Christopher Small , Stephen M. Byan , James F. Lentini
IPC分类号： G06F12/02 , G06F12/0866
CPC分类号： G06F12/0802 , G06F12/0246 , G06F12/0866 , G06F2212/222 , G06F2212/7203
摘要： Systems and methods for efficiently using solid-state devices are provided. Some embodiments provide for a data processing system that uses a non-volatile solid-state device as a circular log, with the goal of aligning data access patterns to the underlying, hidden device implementation, in order to maximize performance. In addition, metadata can be interspersed with data in order to align data access patterns to the underlying device implementation. Multiple input/output (I/O) buffers can also be used to pipeline insertions of metadata and data into a linear log. The observed queuing behavior of the multiple I/O buffers can be used to determine when the utilization of the storage device is approaching saturation (e.g., in order to predict excessively-long response times). Then, the I/O load on the storage device may be shed when utilization approaches saturation. As a result, the overall response time of the system is improved.

2. 发明申请

US20110191522A1 Managing Metadata and Page Replacement in a Persistent Cache in Flash Memory 审中-公开
标题翻译：在闪存中持久缓存中管理元数据和页面替换
公开(公告)号：US20110191522A1
公开(公告)日：2011-08-04
申请号：US12698926
申请日：2010-02-02
申请人： Michael N. Condict , Stephen M. Byan , James F. Lentini
发明人： Michael N. Condict , Stephen M. Byan , James F. Lentini
IPC分类号： G06F12/00 , G06F12/08
CPC分类号： G06F12/123 , G06F2212/1016 , G06F2212/222 , G06F2212/7204 , G06F2212/7207
摘要： A persistent cache is implemented in a flash memory that includes a journal section that stores metadata and a low frequency section and a high frequency section that store data entries. Writing new metadata to the persistent cache includes sequentially advancing to a next sector containing an invalid metadata entry, saving a working copy of the sector in RAM, writing metadata corresponding to one or more new data entries in the working copy, and overwriting the sector in the flash memory containing the invalid entry with the working copy. Writes to the low frequency and high frequency sections occur sequentially in the current locations of a low frequency section pointer and a high frequency section pointer, respectively. In a persistent cache, the reconstruction of a non-persistent cache utilizes the metadata entry that has the most recent timestamp.
摘要翻译：在闪速存储器中实现持久缓存，其包括存储元数据的日志部分和存储数据条目的低频部分和高频部分。将新的元数据写入永久性高速缓存包括依次前进到包含无效元数据条目的下一个扇区，在RAM中保存扇区的工作副本，在工作副本中写入与一个或多个新数据条目对应的元数据，并覆盖闪存包含与工作副本无效的条目。对低频部分指针和高频部分指针的当前位置分别顺序地发送到低频部分和高频部分的写入。在永久缓存中，非持久性高速缓存的重建利用了具有最新时间戳的元数据条目。

3. 发明申请

US20100198985A1 AUTOMATIC NETWORK CLUSTER PATH MANAGEMENT 有权
标题翻译：自动网络集群路径管理
公开(公告)号：US20100198985A1
公开(公告)日：2010-08-05
申请号：US12759553
申请日：2010-04-13
申请人： ARKADY KANEVSKY , James F. Lentini
发明人： ARKADY KANEVSKY , James F. Lentini
IPC分类号： G06F15/173
CPC分类号： H04L45/125 , H04L45/02 , H04L45/028 , H04L45/46 , H04L67/1097 , H04L69/18 , H04L69/24
摘要： Automatic network configuration of cluster paths to access data within a cluster is described. Each node of the cluster presents to clients an image of the cluster as a single system. Each node also stores information regarding what node has particular data, as well as information about network addresses and corresponding network capabilities for the various network addresses for each node. When a node receives a request for data, the node determines a node where the request data can be accessed, determines network addresses and network capabilities for each network address of the node, and selects a path to access the node based on the determined information. The receiving node may select the path based on network type and capability, as well as load and performance of the network.
摘要翻译：描述了用于访问集群内的数据的集群路径的自动网络配置。集群的每个节点向客户端呈现集群的映像作为单个系统。每个节点还存储关于什么节点具有特定数据的信息，以及关于每个节点的各种网络地址的网络地址和相应网络能力的信息。当节点接收到数据请求时，节点确定可以访问请求数据的节点，确定节点的每个网络地址的网络地址和网络能力，并根据确定的信息选择访问节点的路径。接收节点可以基于网络类型和能力以及网络的负载和性能来选择路径。

4. 发明授权

US08620886B1 Host side deduplication 有权
标题翻译：主机端重复数据删除
公开(公告)号：US08620886B1
公开(公告)日：2013-12-31
申请号：US13237417
申请日：2011-09-20
申请人： Anshul Madan , James F. Lentini , Michael N. Condict , Stephen M. Byan
发明人： Anshul Madan , James F. Lentini , Michael N. Condict , Stephen M. Byan
IPC分类号： G06F17/00 , G06F17/30 , G06F13/00 , G06F15/16
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/0611 , G06F3/0659 , G06F3/067 , G06F3/0679 , G06F11/3037 , G06F12/0891 , G06F13/00 , G06F15/16 , G06F17/00 , G06F17/30 , G06F17/30097 , G06F17/30156 , G06F17/30162 , G06F17/30188 , G06F17/30194 , H04L67/2828 , H04L67/2852
摘要： One or more techniques and/or systems are provided for performing host side deduplication. Host side deduplication may be performed upon writeable data within a write request received at a host computing device configured to access data stored by a storage server. The host side deduplication may be performed at the host computing device to determine whether the writeable data is already stored by the storage server based upon querying a host side cache comprising data stored by a storage server and/or a data structure comprising unique signatures of data stored by the storage server. If the writeable data is stored by the storage server, then a deduplication notification excluding the writeable data may be sent to the storage server, otherwise a write command comprising the writeable data may be sent. Accordingly, unnecessary network traffic of redundant data already stored by the storage server may be reduced.
摘要翻译：提供一个或多个技术和/或系统用于执行主机端重复数据删除。主机重复数据删除可以在被配置为访问由存储服务器存储的数据的主计算设备接收的写请求内的可写数据上执行。可以在主机计算设备处执行主机重复数据删除，以基于查询包含由存储服务器存储的数据的主机侧缓存器和/或包括唯一的数据签名的数据结构来确定存储服务器是否已经存储了可写数据由存储服务器存储。如果存储服务器存储可写数据，则可以向存储服务器发送排除可写数据的重复数据消除通知，否则可以发送包含可写数据的写命令。因此，可以减少由存储服务器已经存储的冗余数据的不必要的网络流量。

5. 发明授权

US08214529B2 Automatic network cluster path management 有权
标题翻译：自动网络集群路径管理
公开(公告)号：US08214529B2
公开(公告)日：2012-07-03
申请号：US12759553
申请日：2010-04-13
申请人： Arkady Kanevsky , James F. Lentini
发明人： Arkady Kanevsky , James F. Lentini
IPC分类号： G06F15/16 , G06F12/00
CPC分类号： H04L45/125 , H04L45/02 , H04L45/028 , H04L45/46 , H04L67/1097 , H04L69/18 , H04L69/24
摘要： Automatic network configuration of cluster paths to access data within a cluster is described. Each node of the cluster presents to clients an image of the cluster as a single system. Each node also stores information regarding what node has particular data, as well as information about network addresses and corresponding network capabilities for the various network addresses for each node. When a node receives a request for data, the node determines a node where the request data can be accessed, determines network addresses and network capabilities for each network address of the node, and selects a path to access the node based on the determined information. The receiving node may select the path based on network type and capability, as well as load and performance of the network.
摘要翻译：描述了用于访问集群内的数据的集群路径的自动网络配置。集群的每个节点向客户端呈现集群的映像作为单个系统。每个节点还存储关于什么节点具有特定数据的信息，以及关于每个节点的各种网络地址的网络地址和相应网络能力的信息。当节点接收到数据请求时，节点确定可以访问请求数据的节点，确定节点的每个网络地址的网络地址和网络能力，并根据确定的信息选择访问节点的路径。接收节点可以基于网络类型和能力以及网络的负载和性能来选择路径。

6. 发明授权

US08825666B1 Space-efficient, durable key-value map 有权
标题翻译：节省空间，耐用的键值映射
公开(公告)号：US08825666B1
公开(公告)日：2014-09-02
申请号：US13352110
申请日：2012-01-17
申请人： James F Lentini
发明人： James F Lentini
IPC分类号： G06F7/00 , G06F17/30 , G06F15/16
CPC分类号： G06F17/30321 , G06F17/30336 , G06F17/30339
摘要： A system and method for creating and managing a space-efficient, durable key-value map is disclosed. A key management engine initializes a key-value map by associating a plurality of keys with a first slot of the slots in the key-value map. A first key-value pair is then assigned to the first slot of the key-value map. The key management engine subsequently receives an indication that the first key is to be invalidated; and responsively reuses the first slot of the key-value map by assigning a second key-value pair to the first slot. The first key is then recycled in response to the first key becoming valid. The first and second key-value pairs include respective first and second values and respective first and second keys of the plurality of keys associated with the first slot. The first key becomes valid when it is no longer referenced by a data buffer.
摘要翻译：公开了一种用于创建和管理节省空间的耐用键值映射的系统和方法。密钥管理引擎通过将多个密钥与密钥值映射中的时隙的第一时隙相关联来初始化密钥值映射。然后将第一个键值对分配给键值映射的第一个插槽。随后密钥管理引擎收到第一个密钥无效的指示; 并且通过将第二键值对分配给第一时隙来响应地重新使用键值映射的第一时隙。第一个密钥随后被回收，以响应第一个密钥变得有效。第一和第二键值对包括相应的第一和第二值以及与第一时隙相关联的多个键中的相应的第一和第二键。第一个键在数据缓冲区不再被引用时就变为有效。

7. 发明申请

US20130318283A1 SPECIALIZING I/0 ACCESS PATTERNS FOR FLASH STORAGE 有权
标题翻译：专门用于闪存存储的I / 0访问模式
公开(公告)号：US20130318283A1
公开(公告)日：2013-11-28
申请号：US13477966
申请日：2012-05-22
申请人： Christopher Small , Stephen M. Byan , James F. Lentini
发明人： Christopher Small , Stephen M. Byan , James F. Lentini
IPC分类号： G06F12/02
CPC分类号： G06F12/0802 , G06F12/0246 , G06F12/0866 , G06F2212/222 , G06F2212/7203
摘要： Systems and methods for efficiently using solid-state devices are provided. Some embodiments provide for a data processing system that uses a non-volatile solid-state device as a circular log, with the goal of aligning data access patterns to the underlying, hidden device implementation, in order to maximize performance. In addition, metadata can be interspersed with data in order to align data access patterns to the underlying device implementation. Multiple input/output (I/O) buffers can also be used to pipeline insertions of metadata and data into a linear log. The observed queuing behavior of the multiple I/O buffers can be used to determine when the utilization of the storage device is approaching saturation (e.g., in order to predict excessively-long response times). Then, the I/O load on the storage device may be shed when utilization approaches saturation. As a result, the overall response time of the system is improved.
摘要翻译：提供了有效使用固态器件的系统和方法。一些实施例提供了使用非易失性固态设备作为循环日志的数据处理系统，其目的是将数据访问模式对准底层的隐藏设备实现，以便最大化性能。此外，元数据可以散布数据，以便将数据访问模式与底层设备实现对齐。多个输入/输出（I / O）缓冲区也可用于将元数据和数据流插入线性日志。可以使用多个I / O缓冲器观察到的排队行为来确定存储设备的利用率何时接近饱和（例如，为了预测过长的响应时间）。然后，当利用率接近饱和时，存储设备上的I / O负载可能会流失。结果，系统的整体响应时间得到改善。

8. 发明授权

US07725603B1 Automatic network cluster path management 有权
标题翻译：自动网络集群路径管理
公开(公告)号：US07725603B1
公开(公告)日：2010-05-25
申请号：US12113053
申请日：2008-04-30
申请人： Arkady Kanevsky , James F. Lentini
发明人： Arkady Kanevsky , James F. Lentini
IPC分类号： G06F15/16 , G06F12/00
CPC分类号： H04L45/125 , H04L45/02 , H04L45/028 , H04L45/46 , H04L67/1097 , H04L69/18 , H04L69/24
摘要： Automatic network configuration of cluster paths to access data within a cluster is described. Each node of the cluster presents to clients an image of the cluster as a single system. Each node also stores information regarding what node has particular data, as well as information about network addresses and corresponding network capabilities for the various network addresses for each node. When a node receives a request for data, the node determines a node where the request data can be accessed, determines network addresses and network capabilities for each network address of the node, and selects a path to access the node based on the determined information. The receiving node may select the path based on network type and capability, as well as load and performance of the network.
摘要翻译：描述了用于访问集群内的数据的集群路径的自动网络配置。集群的每个节点向客户端呈现集群的映像作为单个系统。每个节点还存储关于什么节点具有特定数据的信息，以及关于每个节点的各种网络地址的网络地址和相应网络能力的信息。当节点接收到数据请求时，节点确定可以访问请求数据的节点，确定节点的每个网络地址的网络地址和网络能力，并根据确定的信息选择访问节点的路径。接收节点可以基于网络类型和能力以及网络的负载和性能来选择路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式