-
1.发明申请公开(公告)号：US20130132800A1
公开(公告)日：2013-05-23
申请号：US13302510
申请日：2011-11-22
CPC分类号： G06F3/0619 , G06F3/0607 , G06F3/061 , G06F3/064 , G06F3/0689
摘要： Allocation process that allows erasure coded data to be stored on any of a plurality of disk drives, in a pool of drives, so that the allocation is not tied to a fixed group of drives. Still further, the encoded data can be generated by any of multiple different erasure coding algorithms, where again storage of the encoded data is not restricted to a single group of drives based on the erasure algorithm being utilized to encode the data. In another embodiment, the encoded data can be “stacked” (aligned) on select drives to reduce the number of head seeks required to access the data. As a result of these improvements, the system can dynamically determine which one of multiple erasure coding algorithms to utilize for a given incoming data block, without being tied to one particular algorithm and one particular group of storage devices as in the prior art.
摘要翻译： 允许擦除编码数据存储在驱动器池中的多个磁盘驱动器中的任何一个上的分配处理，使得该分配不被绑定到固定的驱动组。 此外，编码数据可以由多种不同擦除编码算法中的任何一种生成，其中基于用于对数据进行编码的擦除算法，编码数据的再次存储不限于单组驱动器。 在另一个实施例中，编码数据可以在选择的驱动器上“堆叠”（对齐）以减少访问数据所需的头部寻道的数量。 作为这些改进的结果，系统可以动态地确定多个擦除编码算法中的哪一个用于给定的输入数据块，而不会像现有技术那样与一个特定算法和一组特定的存储设备相关联。
-
公开(公告)号：US09697216B2
公开(公告)日：2017-07-04
申请号：US13186939
申请日：2011-07-20
CPC分类号： G06F17/30097 , G06F3/061 , G06F3/0619 , G06F3/064 , G06F3/0643 , G06F3/0689 , G06F12/08
摘要： Method and apparatus for locating data on disk storage, wherein multiple instances of data can be stored at different locations to satisfy different use requirements such as read access, write access, and data security. The method allows a data storage system, such as a file system, to provide both read optimized and write optimized performance on disk storage of different types (e.g., sizes and speed).
-
公开(公告)号：US09436748B2
公开(公告)日：2016-09-06
申请号：US13167365
申请日：2011-06-23
CPC分类号： G06F17/30575 , G06F17/30088 , G06F17/30206 , G06F17/30356 , G06F17/30584 , H04L67/1095
摘要： Method and apparatus for replicating data structures over a network in which each data structure is assigned an owner node among a plurality of networked peer nodes. Preferably that owner can be ascertained through information in the data structure. When an update to the data structure is desired by a non-owner, a request to modify the data structure is sent out on the network and when received by the owner, the owner performs the modification. The owner node can then notify the other nodes regarding the update. The method, implemented through a single-writer, multiple-reader paradigm, insures availability, partition tolerance and eventual consistency; it avoids the high overhead costs and single point of failure drawbacks of the prior art centralized management and locking protocols. Administrators can connect to any peer node in the network to manage, monitor and request modifications to a data structure.
摘要翻译： 用于通过网络复制数据结构的方法和装置，其中每个数据结构在多个联网的对等节点之间分配所有者节点。 优选地，可以通过数据结构中的信息来确定所有者。 当非所有者希望对数据结构进行更新时，在网络上发送修改数据结构的请求，当所有者收到时，所有者执行修改。 所有者节点可以通知其他节点有关更新。 该方法通过单写入器多读取器范例实现，确保可用性，分区容限和最终一致性; 它避免了现有技术的集中管理和锁定协议的高开销成本和单点故障缺点。 管理员可以连接到网络中的任何对等节点来管理，监视和请求修改数据结构。
-
公开(公告)号：US20130024615A1
公开(公告)日：2013-01-24
申请号：US13186939
申请日：2011-07-20
IPC分类号： G06F12/08
CPC分类号： G06F17/30097 , G06F3/061 , G06F3/0619 , G06F3/064 , G06F3/0643 , G06F3/0689 , G06F12/08
摘要： Method and apparatus for locating data on disk storage, wherein multiple instances of data can be stored at different locations to satisfy different use requirements such as read access, write access, and data security. The method allows a data storage system, such as a file system, to provide both read optimized and write optimized performance on disk storage of different types (e.g., sizes and speed).
摘要翻译： 用于在磁盘存储器上定位数据的方法和装置，其中数据的多个实例可以存储在不同的位置以满足诸如读取访问，写入访问和数据安全性的不同使用需求。 该方法允许诸如文件系统的数据存储系统在不同类型（例如，大小和速度）的磁盘存储上提供读取优化和写入优化的性能。
-
公开(公告)号：US20120331029A1
公开(公告)日：2012-12-27
申请号：US13167365
申请日：2011-06-23
IPC分类号： G06F15/16
CPC分类号： G06F17/30575 , G06F17/30088 , G06F17/30206 , G06F17/30356 , G06F17/30584 , H04L67/1095
摘要： Method and apparatus for replicating data structures over a network in which each data structure is assigned an owner node among a plurality of networked peer nodes. Preferably that owner can be ascertained through information in the data structure. When an update to the data structure is desired by a non-owner, a request to modify the data structure is sent out on the network and when received by the owner, the owner performs the modification. The owner node can then notify the other nodes regarding the update. The method, implemented through a single-writer, multiple-reader paradigm, insures availability, partition tolerance and eventual consistency; it avoids the high overhead costs and single point of failure drawbacks of the prior art centralized management and locking protocols. Administrators can connect to any peer node in the network to manage, monitor and request modifications to a data structure.
摘要翻译： 用于通过网络复制数据结构的方法和装置，其中每个数据结构在多个联网的对等节点之间分配所有者节点。 优选地，可以通过数据结构中的信息来确定所有者。 当非所有者希望对数据结构进行更新时，在网络上发送修改数据结构的请求，当所有者收到时，所有者执行修改。 所有者节点可以通知其他节点有关更新。 该方法通过单写入器多读取器范例实现，确保可用性，分区容限和最终一致性; 它避免了现有技术的集中管理和锁定协议的高开销成本和单点故障缺点。 管理员可以连接到网络中的任何对等节点来管理，监视和请求修改数据结构。
-
公开(公告)号：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.
摘要翻译： 基于数据内容将数据放置在随机存取存储器中的装置和方法，使得不需要索引操作。 将强（例如，加密）散列应用于导致签名的数据元素。 然后将较弱的散列函数应用于签名以在数据元素的存储器中生成存储位置。 较弱的散列函数将多个数据元素分配给相同的存储位置，而签名包括用于在该位置定位特定数据元素的唯一标识符。 在一个实施例中，连续地应用多个弱散列函数以增加存储空间利用率。 在其他实施例中，分配的存储位置可以由数据元素和/或存储技术的一个或多个属性确定，例如长寿命与短寿命数据和/或具有不同性能的存储器的不同区域（例如， ，访问延迟内存生存期）特性。
-
8.发明授权公开(公告)号：US08713405B2
公开(公告)日：2014-04-29
申请号：US13302510
申请日：2011-11-22
CPC分类号： G06F3/0619 , G06F3/0607 , G06F3/061 , G06F3/064 , G06F3/0689
摘要： Allocation process that allows erasure coded data to be stored on any of a plurality of disk drives, in a pool of drives, so that the allocation is not tied to a fixed group of drives. Still further, the encoded data can be generated by any of multiple different erasure coding algorithms, where again storage of the encoded data is not restricted to a single group of drives based on the erasure algorithm being utilized to encode the data. In another embodiment, the encoded data can be “stacked” (aligned) on select drives to reduce the number of head seeks required to access the data. As a result of these improvements, the system can dynamically determine which one of multiple erasure coding algorithms to utilize for a given incoming data block, without being tied to one particular algorithm and one particular group of storage devices as in the prior art.
摘要翻译： 允许擦除编码数据存储在驱动器池中的多个磁盘驱动器中的任何一个上的分配处理，使得该分配不被绑定到固定的驱动组。 此外，编码数据可以由多种不同擦除编码算法中的任何一种生成，其中基于用于对数据进行编码的擦除算法，编码数据的再次存储不限于单组驱动器。 在另一个实施例中，编码数据可以在选择的驱动器上“堆叠”（对齐）以减少访问数据所需的头部寻道的数量。 作为这些改进的结果，系统可以动态地确定多个擦除编码算法中的哪一个用于给定的输入数据块，而不会像现有技术那样与一个特定算法和一组特定的存储设备相关联。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.012 秒)
