-
1.发明授权Method and apparatus utilizing non-uniform hash functions for placing records in non-uniform access memory 有权使用非均匀哈希函数的方法和装置，用于将记录放置在非均匀访问存储器中公开(公告)号：US09165005B2
公开(公告)日：2015-10-20
申请号：US13404640
申请日：2012-02-24
CPC分类号： G06F3/0616 , G06F3/0611 , G06F3/064 , G06F3/0685 , G06F12/0246 , G06F12/0864 , G06F12/1018 , G06F17/30097 , G06F17/30949 , G06F2212/1036 , G06F2212/1044 , G06F2212/7201 , G06F2212/7202 , G06F2212/7208
摘要： Method and apparatus for storing records in non-uniform access memory. In various embodiments, the placement of records is localized in one or more regions of the memory. This can be accomplished utilizing different ordered lists of hash functions to preferentially map records to different regions of the memory to achieve one or more performance characteristics or to account for differences in the underlying memory technologies. For example, one ordered list of hash functions may localize the data for more rapid access. Another list of hash functions may localize the data that is expected to have a relatively short lifetime. Localizing such data may significantly improve the erasure performance and/or memory lifetime, e.g., by concentrating the obsolete data elements in one location. Thus, the two or more lists of ordered hash functions may improve one or more of access latency, memory lifetime, and/or operation rate.
摘要翻译： 用于在非均匀访问存储器中存储记录的方法和装置。 在各种实施例中，记录的放置被定位在存储器的一个或多个区域中。 这可以利用哈希函数的不同有序列表来优化地将记录映射到存储器的不同区域以实现一个或多个性能特征或者考虑底层存储器技术的差异来实现。 例如，哈希函数的一个有序列表可以本地化数据以便更快速地访问。 哈希函数的另一个列表可以将期望具有相对较短寿命的数据本地化。 定位这样的数据可以显着改善擦除性能和/或存储器寿命，例如通过将过时的数据元素集中在一个位置中。 因此，有序散列函数的两个或多个列表可以改进访问等待时间，存储器寿命和/或操作速率中的一个或多个。
-
2.发明申请METHOD AND APPARATUS UTILIZING NON-UNIFORM HASH FUNCTIONS FOR PLACING RECORDS IN NON-UNIFORM ACCESS MEMORY 有权使用非统一访问存储器中记录非均匀HASH功能的方法和设备公开(公告)号：US20130227195A1
公开(公告)日：2013-08-29
申请号：US13404640
申请日：2012-02-24
IPC分类号： G06F12/00
CPC分类号： G06F3/0616 , G06F3/0611 , G06F3/064 , G06F3/0685 , G06F12/0246 , G06F12/0864 , G06F12/1018 , G06F17/30097 , G06F17/30949 , G06F2212/1036 , G06F2212/1044 , G06F2212/7201 , G06F2212/7202 , G06F2212/7208
摘要： Method and apparatus for storing records in non-uniform access memory. In various embodiments, the placement of records is localized in one or more regions of the memory. This can be accomplished utilizing different ordered lists of hash functions to preferentially map records to different regions of the memory to achieve one or more performance characteristics or to account for differences in the underlying memory technologies. For example, one ordered list of hash functions may localize the data for more rapid access. Another list of hash functions may localize the data that is expected to have a relatively short lifetime. Localizing such data may significantly improve the erasure performance and/or memory lifetime, e.g., by concentrating the obsolete data elements in one location. Thus, the two or more lists of ordered hash functions may improve one or more of access latency, memory lifetime, and/or operation rate.
摘要翻译： 用于在非均匀访问存储器中存储记录的方法和装置。 在各种实施例中，记录的位置被定位在存储器的一个或多个区域中。 这可以利用哈希函数的不同有序列表来优化地将记录映射到存储器的不同区域以实现一个或多个性能特征或者考虑底层存储器技术的差异来实现。 例如，哈希函数的一个有序列表可以本地化数据以便更快速地访问。 哈希函数的另一个列表可以将期望具有相对较短寿命的数据本地化。 定位这样的数据可以显着改善擦除性能和/或存储器寿命，例如通过将过时的数据元素集中在一个位置中。 因此，有序散列函数的两个或多个列表可以改进访问等待时间，存储器寿命和/或操作速率中的一个或多个。
-
公开(公告)号：US08346810B2
公开(公告)日：2013-01-01
申请号：US13106927
申请日：2011-05-13
IPC分类号： G06F17/00
CPC分类号： G06F17/30097 , G06F17/30094 , G06F17/30194 , H04L67/1087
摘要： Methods and systems are provided for tracking object instances stored on a plurality of network nodes, which tracking enables a global determination of when an object has no references across the networked nodes and can be safely de-allocated. According to one aspect of the invention, each node has a local object store for tracking and optionally storing objects on the node, and the local object stores collectively share the locally stored instances of the objects across the network. One or more applications, e.g., a file system and/or a storage system, use the local object stores for storing all persistent data of the application as objects.
-
公开(公告)号：US09032183B2
公开(公告)日：2015-05-12
申请号：US13404468
申请日：2012-02-24
CPC分类号： G06F12/08 , G06F12/0864 , G06F17/30097 , G06F17/30949 , G06F2212/1056 , G06F2212/152
摘要： Apparatus and method for placing data based on the content of the data in random access memory such that indexing operations are not required. A strong (e.g., cryptographic) hash is applied to a data element resulting in a signature. A weaker hash function is then applied to the signature to generate a storage location in memory for the data element. The weaker hash function assigns multiple data elements to the same storage location while the signature comprises a unique identifier for locating a particular data element at this location. In one embodiment a plurality of weak hash functions are applied successively to increase storage space utilization. In other embodiments, the assigned storage location can be determined by one or more attributes of the data element and/or the storage technology, e.g, long-lived versus short-lived data and/or different regions of the memory having different performance (e.g., access latency memory lifetime) characteristics.
摘要翻译： 基于数据内容将数据放置在随机存取存储器中的装置和方法，使得不需要索引操作。 将强（例如，加密）散列应用于导致签名的数据元素。 然后将较弱的散列函数应用于签名以在数据元素的存储器中生成存储位置。 较弱的散列函数将多个数据元素分配给相同的存储位置，而签名包括用于在该位置定位特定数据元素的唯一标识符。 在一个实施例中，连续地应用多个弱散列函数以增加存储空间利用率。 在其他实施例中，分配的存储位置可以由数据元素和/或存储技术的一个或多个属性确定，例如长寿命与短寿命数据和/或具有不同性能的存储器的不同区域（例如， ，访问延迟内存生存期）特性。
-
公开(公告)号：US20130227209A1
公开(公告)日：2013-08-29
申请号：US13404468
申请日：2012-02-24
CPC分类号： G06F12/08 , G06F12/0864 , G06F17/30097 , G06F17/30949 , G06F2212/1056 , G06F2212/152
摘要： Apparatus and method for placing data based on the content of the data in random access memory such that indexing operations are not required. A strong (e.g., cryptographic) hash is applied to a data element resulting in a signature. A weaker hash function is then applied to the signature to generate a storage location in memory for the data element. The weaker hash function assigns multiple data elements to the same storage location while the signature comprises a unique identifier for locating a particular data element at this location. In one embodiment a plurality of weak hash functions are applied successively to increase storage space utilization. In other embodiments, the assigned storage location can be determined by one or more attributes of the data element and/or the storage technology, e.g, long-lived versus short-lived data and/or different regions of the memory having different performance (e.g., access latency memory lifetime) characteristics.
摘要翻译： 基于数据内容将数据放置在随机存取存储器中的装置和方法，使得不需要索引操作。 将强（例如，加密）散列应用于导致签名的数据元素。 然后将较弱的散列函数应用于签名以在数据元素的存储器中生成存储位置。 较弱的散列函数将多个数据元素分配给相同的存储位置，而签名包括用于在该位置定位特定数据元素的唯一标识符。 在一个实施例中，连续地应用多个弱散列函数以增加存储空间利用率。 在其他实施例中，分配的存储位置可以由数据元素和/或存储技术的一个或多个属性确定，例如长寿命与短寿命数据和/或具有不同性能的存储器的不同区域（例如， ，访问延迟内存生存期）特性。
-
公开(公告)号：US20120290629A1
公开(公告)日：2012-11-15
申请号：US13106927
申请日：2011-05-13
IPC分类号： G06F17/30 , G06F15/173
CPC分类号： G06F17/30097 , G06F17/30094 , G06F17/30194 , H04L67/1087
摘要： Methods and systems are provided for tracking object instances stored on a plurality of network nodes, which tracking enables a global determination of when an object has no references across the networked nodes and can be safely de-allocated. According to one aspect of the invention, each node has a local object store for tracking and optionally storing objects on the node, and the local object stores collectively share the locally stored instances of the objects across the network. One or more applications, e.g., a file system and/or a storage system, use the local object stores for storing all persistent data of the application as objects.
摘要翻译： 提供了用于跟踪存储在多个网络节点上的对象实例的方法和系统，该跟踪使得能够全局确定对象何时没有跨网络节点的引用，并且可以安全地解除分配。 根据本发明的一个方面，每个节点具有本地对象存储器，用于跟踪和可选地在节点上存储对象，并且本地对象存储器通过网络共享共享本地存储的对象的实例。 一个或多个应用，例如文件系统和/或存储系统，使用本地对象存储来存储应用的所有持久数据作为对象。
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.022 秒)
