-
公开(公告)号：US20190272255A1
公开(公告)日：2019-09-05
申请号：US16415053
申请日：2019-05-17
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
IPC分类号： G06F16/17 , G06F16/14 , G06F16/13 , G06F16/182 , G06F3/06
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.
-
公开(公告)号：US10372678B2
公开(公告)日：2019-08-06
申请号：US15270462
申请日：2016-09-20
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.
-
公开(公告)号：US20170011057A1
公开(公告)日：2017-01-12
申请号：US15270462
申请日：2016-09-20
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
CPC分类号： G06F16/1727 , G06F3/0608 , G06F3/061 , G06F3/064 , G06F3/0643 , G06F3/0647 , G06F3/067 , G06F3/0673 , G06F16/13 , G06F16/152 , G06F16/182
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.
摘要翻译： 可以通过从表示文件的散列树中的第一节点检索第一树数据来处理访问存储在内容可寻址存储（CAS）系统中的文件中的逻辑位置的请求，第一树数据包括第一散列 树深度，第一个CAS签名，块大小和文件大小。 基于树数据，从散列树中的较高级别选择第二节点。 来自代表文件的散列树的第二个节点的第二个树数据被检索，包括第二个CAS签名。 确定第二CAS签名以匹配保留的CAS签名，并且作为响应，提供在该文件内未分配请求的逻辑位置的指示。
-
公开(公告)号：US20190272256A1
公开(公告)日：2019-09-05
申请号：US16415085
申请日：2019-05-17
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
IPC分类号： G06F16/17 , G06F16/182 , G06F16/14 , G06F16/13 , G06F3/06
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.
-
公开(公告)号：US20170011058A1
公开(公告)日：2017-01-12
申请号：US15270506
申请日：2016-09-20
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
CPC分类号： G06F16/1727 , G06F3/0608 , G06F3/064 , G06F3/0647 , G06F3/067 , G06F16/13 , G06F16/152 , G06F16/182
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.
摘要翻译： 可以通过从表示文件的第一版本的第一散列树中的第一节点检索第一树数据来处理访问存储在内容可寻址存储（CAS）系统中的文件中的逻辑位置的请求。 基于第一棵树数据，选择第二个节点，将CAS签名与保留的CAS签名进行比较，以确定正确的文件版本。 响应于匹配，在表示文件的第二版本的第二散列树中访问第三节点。 从第三个节点检索树数据。
-
公开(公告)号：US20150161153A1
公开(公告)日：2015-06-11
申请号：US14098773
申请日：2013-12-06
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
IPC分类号： G06F17/30
CPC分类号： G06F17/30138 , G06F3/0608 , G06F3/064 , G06F3/0647 , G06F3/067 , G06F17/30091 , G06F17/30109 , G06F17/30194
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.
摘要翻译： 可以通过从表示文件的第一版本的第一散列树中的第一节点检索第一树数据来处理访问存储在内容可寻址存储（CAS）系统中的文件中的逻辑位置的请求。 基于第一棵树数据，选择第二个节点，将CAS签名与保留的CAS签名进行比较，以确定正确的文件版本。 响应于匹配，在表示文件的第二版本的第二散列树中访问第三节点。 从第三个节点检索树数据。
-
公开(公告)号：US11360938B2
公开(公告)日：2022-06-14
申请号：US16415053
申请日：2019-05-17
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.
-
公开(公告)号：US10372679B2
公开(公告)日：2019-08-06
申请号：US15270506
申请日：2016-09-20
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.
-
公开(公告)号：US09495373B2
公开(公告)日：2016-11-15
申请号：US14098773
申请日：2013-12-06
发明人： Ahmed Gheith , Eric Van Hensbergen , James Xenidis
CPC分类号： G06F17/30138 , G06F3/0608 , G06F3/064 , G06F3/0647 , G06F3/067 , G06F17/30091 , G06F17/30109 , G06F17/30194
摘要： A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.
摘要翻译： 可以通过从表示文件的第一版本的第一散列树中的第一节点检索第一树数据来处理访问存储在内容可寻址存储（CAS）系统中的文件中的逻辑位置的请求。 基于第一棵树数据，选择第二个节点，将CAS签名与保留的CAS签名进行比较，以确定正确的文件版本。 响应于匹配，在表示文件的第二版本的第二散列树中访问第三节点。 从第三个节点检索树数据。
-
公开(公告)号：US20150127767A1
公开(公告)日：2015-05-07
申请号：US14071321
申请日：2013-11-04
发明人： AHMED GHEITH , Eric Van Hensbergen , James Xenidis
CPC分类号： G06F12/1009 , G06F12/1072
摘要： A method, system, and computer program product for resolving cache lookup of large pages with variable granularity are provided in the illustrative embodiments. A number of unused bits in an available number of bits is identified. The available number of bits is configured to address a page of data in memory, wherein the page exceeding a threshold size, and the page comprising a set of parts. The unused bits are mapped to the plurality of parts such that a value of the unused bits corresponds to existence of a subset of the set of parts in a memory. A virtual address is translated to a physical address of a requested part in the set of parts. A determination is made, using the unused bits, whether the requested part exists in the memory.
摘要翻译： 在说明性实施例中提供了用于解析具有可变粒度的大页面的高速缓存查找的方法，系统和计算机程序产品。 识别可用位数中的多个未使用位。 可用的位数被配置为寻址存储器中的数据页，其中页面超过阈值大小，并且页面包括一组部件。 未使用的比特被映射到多个部分，使得未使用的比特的值对应于存储器中的该组部分的子集的存在。 虚拟地址被转换为该组件中所请求零件的物理地址。 使用未使用的位确定所请求的部分是否存在于存储器中。
-
-
-
-
-
-
-
-
-
搜索结果
14 条记录 (耗时 0.017 秒)
