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

1. 发明授权

US08898195B2 Reference count propagation 有权
标题翻译：参考计数传播
公开(公告)号：US08898195B2
公开(公告)日：2014-11-25
申请号：US13723990
申请日：2012-12-21
申请人： SimpliVity Corporation
发明人： Arthur J. Beaverson , Kishore Chitrapu , John Michael Czerkowicz , Sowmya Manjanatha
IPC分类号： G06F17/30
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.
摘要翻译：提供了用于跟踪存储在多个网络节点上的对象实例的方法和系统，该跟踪使得能够全局确定对象何时没有跨网络节点的引用，并且可以安全地解除分配。根据本发明的一个方面，每个节点具有本地对象存储器，用于跟踪和可选地在节点上存储对象，并且本地对象存储器通过网络共享共享本地存储的对象的实例。一个或多个应用，例如文件系统和/或存储系统，使用本地对象存储来存储应用的所有持久数据作为对象。

2. 发明授权

US08713405B2 Method and apparatus for allocating erasure coded data to disk storage 有权
标题翻译：将擦除编码数据分配给磁盘存储器的方法和装置
公开(公告)号：US08713405B2
公开(公告)日：2014-04-29
申请号：US13302510
申请日：2011-11-22
申请人： Michael W. Healey, Jr. , David Cordella , Arthur J. Beaverson , Steven Bagby
发明人： Michael W. Healey, Jr. , David Cordella , Arthur J. Beaverson , Steven Bagby
IPC分类号： G11C29/00 , G06F13/00
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.
摘要翻译：允许擦除编码数据存储在驱动器池中的多个磁盘驱动器中的任何一个上的分配处理，使得该分配不被绑定到固定的驱动组。此外，编码数据可以由多种不同擦除编码算法中的任何一种生成，其中基于用于对数据进行编码的擦除算法，编码数据的再次存储不限于单组驱动器。在另一个实施例中，编码数据可以在选择的驱动器上“堆叠”（对齐）以减少访问数据所需的头部寻道的数量。作为这些改进的结果，系统可以动态地确定多个擦除编码算法中的哪一个用于给定的输入数据块，而不会像现有技术那样与一个特定算法和一组特定的存储设备相关联。

3. 发明申请

US20130227195A1 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
申请人： Arthur J. Beaverson , Paul BOWDEN , Sowmya Manjanatha , Jinsong Huang
发明人： Arthur J. Beaverson , Paul BOWDEN , Sowmya Manjanatha , Jinsong Huang
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.
摘要翻译：用于在非均匀访问存储器中存储记录的方法和装置。在各种实施例中，记录的位置被定位在存储器的一个或多个区域中。这可以利用哈希函数的不同有序列表来优化地将记录映射到存储器的不同区域以实现一个或多个性能特征或者考虑底层存储器技术的差异来实现。例如，哈希函数的一个有序列表可以本地化数据以便更快速地访问。哈希函数的另一个列表可以将期望具有相对较短寿命的数据本地化。定位这样的数据可以显着改善擦除性能和/或存储器寿命，例如通过将过时的数据元素集中在一个位置中。因此，有序散列函数的两个或多个列表可以改进访问等待时间，存储器寿命和/或操作速率中的一个或多个。

4. 发明授权

US09697216B2 Method and apparatus for differentiated data placement 有权
公开(公告)号：US09697216B2
公开(公告)日：2017-07-04
申请号：US13186939
申请日：2011-07-20
申请人： David Cordella , Arthur J. Beaverson , Steven Bagby
发明人： David Cordella , Arthur J. Beaverson , Steven Bagby
IPC分类号： G06F12/08 , G06F17/30 , G06F3/06
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).

5. 发明授权

US09436748B2 Method and apparatus for distributed configuration management 有权
标题翻译：用于分布式配置管理的方法和装置
公开(公告)号：US09436748B2
公开(公告)日：2016-09-06
申请号：US13167365
申请日：2011-06-23
申请人： James E. King, III , Michael T. Stack , Arthur J. Beaverson , Steven Bagby
发明人： James E. King, III , Michael T. Stack , Arthur J. Beaverson , Steven Bagby
IPC分类号： G06F15/16 , G06F17/30
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.
摘要翻译：用于通过网络复制数据结构的方法和装置，其中每个数据结构在多个联网的对等节点之间分配所有者节点。优选地，可以通过数据结构中的信息来确定所有者。当非所有者希望对数据结构进行更新时，在网络上发送修改数据结构的请求，当所有者收到时，所有者执行修改。所有者节点可以通知其他节点有关更新。该方法通过单写入器多读取器范例实现，确保可用性，分区容限和最终一致性; 它避免了现有技术的集中管理和锁定协议的高开销成本和单点故障缺点。管理员可以连接到网络中的任何对等节点来管理，监视和请求修改数据结构。

6. 发明授权

US09043576B2 System and method for virtual machine conversion 有权
标题翻译：用于虚拟机转换的系统和方法
公开(公告)号：US09043576B2
公开(公告)日：2015-05-26
申请号：US13972555
申请日：2013-08-21
申请人： SimpliVity Corporation
发明人： Jesse St. Laurent , James E. King, III
IPC分类号： G06F12/00 , G06F17/30 , G06F9/455
CPC分类号： G06F17/30076 , G06F9/45558 , G06F17/30221 , G06F17/30233 , G06F2009/4557
摘要： System and method for conversion of virtual machine files without requiring copying of the virtual machine payload (data) from one location to another location. By eliminating this step, applicant's invention significantly enhances the efficiency of the conversion process. In one embodiment, a file system or storage system provides indirections to locations of data elements stored on a persistent storage media. A source virtual machine file includes hypervisor metadata (HM) data elements in one hypervisor file format, and virtual machine payload (VMP) data elements. The source virtual machine file is converted by transforming the HM data elements of the source file to create destination HM data elements in a destination hypervisor format different from the source hypervisor format; maintaining the locations of the VMP data elements stored on the persistent storage media constant during the conversion from source to destination file formats without reading or writing the VMP data elements; and creating indirections to reference the destination HM data elements in the destination hypervisor format and the existing stored VMP data elements.
摘要翻译：用于转换虚拟机文件的系统和方法，而不需要将虚拟机有效负载（数据）从一个位置复制到另一个位置。通过消除这一步骤，申请人的发明显着提高了转换过程的效率。在一个实施例中，文件系统或存储系统向存储在持久存储介质上的数据元素的位置提供内容。源虚拟机文件包括虚拟机管理程序文件格式的虚拟机管理程序元数据（HM）数据元素以及虚拟机有效载荷（VMP）数据元素。通过转换源文件的HM数据元素来创建源虚拟机文件，以创建与源虚拟机管理程序格式不同的目的地管理程序格式的目标HM数据元素; 维持存储在永久存储介质上的VMP数据元素的位置在从源到目的地文件格式的转换期间不变，而不读取或写入VMP数据元素; 并创建引用以引用目的地管理程序格式中的目的地HM数据元素和现有存储的VMP数据元素。

7. 发明申请

US20150058382A1 SYSTEM AND METHOD FOR VIRTUAL MACHINE CONVERSION 有权
标题翻译：虚拟机转换系统与方法
公开(公告)号：US20150058382A1
公开(公告)日：2015-02-26
申请号：US13972555
申请日：2013-08-21
申请人： SimpliVity Corporation
发明人： Jesse St. Laurent , James E. King, III
IPC分类号： G06F17/30
CPC分类号： G06F17/30076 , G06F9/45558 , G06F17/30221 , G06F17/30233 , G06F2009/4557
摘要： System and method for conversion of virtual machine files without requiring copying of the virtual machine payload (data) from one location to another location. By eliminating this step, applicant's invention significantly enhances the efficiency of the conversion process. In one embodiment, a file system or storage system provides indirections to locations of data elements stored on a persistent storage media. A source virtual machine file includes hypervisor metadata (HM) data elements in one hypervisor file format, and virtual machine payload (VMP) data elements. The source virtual machine file is converted by transforming the HM data elements of the source file to create destination HM data elements in a destination hypervisor format different from the source hypervisor format; maintaining the locations of the VMP data elements stored on the persistent storage media constant during the conversion from source to destination file formats without reading or writing the VMP data elements; and creating indirections to reference the destination HM data elements in the destination hypervisor format and the existing stored VMP data elements.
摘要翻译：用于转换虚拟机文件的系统和方法，而不需要将虚拟机有效负载（数据）从一个位置复制到另一个位置。通过消除这一步骤，申请人的发明显着提高了转换过程的效率。在一个实施例中，文件系统或存储系统向存储在持久存储介质上的数据元素的位置提供内容。源虚拟机文件包括虚拟机管理程序文件格式的虚拟机管理程序元数据（HM）数据元素以及虚拟机有效载荷（VMP）数据元素。通过转换源文件的HM数据元素来创建源虚拟机文件，以创建与源虚拟机管理程序格式不同的目的地管理程序格式的目标HM数据元素; 维持存储在永久存储介质上的VMP数据元素的位置在从源到目的地文件格式的转换期间不变，而不读或写VMP数据元素; 并创建引用以引用目的地管理程序格式中的目的地HM数据元素和现有存储的VMP数据元素。

8. 发明授权

US09165005B2 Method and apparatus utilizing non-uniform hash functions for placing records in non-uniform access memory 有权
标题翻译：使用非均匀哈希函数的方法和装置，用于将记录放置在非均匀访问存储器中
公开(公告)号：US09165005B2
公开(公告)日：2015-10-20
申请号：US13404640
申请日：2012-02-24
申请人： Arthur J. Beaverson , Paul Bowden , Sowmya Manjanatha , Jinsong Huang
发明人： Arthur J. Beaverson , Paul Bowden , Sowmya Manjanatha , Jinsong Huang
IPC分类号： G06F17/30 , G06F12/06 , G06F12/02 , G06F12/08
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.
摘要翻译：用于在非均匀访问存储器中存储记录的方法和装置。在各种实施例中，记录的放置被定位在存储器的一个或多个区域中。这可以利用哈希函数的不同有序列表来优化地将记录映射到存储器的不同区域以实现一个或多个性能特征或者考虑底层存储器技术的差异来实现。例如，哈希函数的一个有序列表可以本地化数据以便更快速地访问。哈希函数的另一个列表可以将期望具有相对较短寿命的数据本地化。定位这样的数据可以显着改善擦除性能和/或存储器寿命，例如通过将过时的数据元素集中在一个位置中。因此，有序散列函数的两个或多个列表可以改进访问等待时间，存储器寿命和/或操作速率中的一个或多个。

9. 发明授权

US08880544B2 Method of adapting a uniform access indexing process to a non-uniform access memory, and computer system 有权
标题翻译：将统一的访问索引过程适配到不均匀的访问存储器和计算机系统的方法
公开(公告)号：US08880544B2
公开(公告)日：2014-11-04
申请号：US12823452
申请日：2010-06-25
申请人： Paul Bowden , Arthur J. Beaverson
发明人： Paul Bowden , Arthur J. Beaverson
IPC分类号： G06F17/30
CPC分类号： G06F12/1054 , G06F12/0246 , G06F12/0864 , G06F12/0875 , G06F12/1408 , G06F17/30097 , G06F17/30949 , G06F17/30952 , G06F2212/2542 , G06F2212/402 , G06F2212/452 , G06F2212/502 , G06F2212/6032 , G06F2212/7211
摘要： Method and apparatus for constructing an index that scales to a large number of records and provides a high transaction rate. New data structures and methods are provided to ensure that an indexing algorithm performs in a way that is natural (efficient) to the algorithm, while a non-uniform access memory device sees IO (input/output) traffic that is efficient for the memory device. One data structure, a translation table, is created that maps logical buckets as viewed by the indexing algorithm to physical buckets on the memory device. This mapping is such that write performance to non-uniform access SSD and flash devices is enhanced. Another data structure, an associative cache is used to collect buckets and write them out sequentially to the memory device as large sequential writes. Methods are used to populate the cache with buckets (of records) that are required by the indexing algorithm. Additional buckets may be read from the memory device to cache during a demand read, or by a scavenging process, to facilitate the generation of free erase blocks.
摘要翻译：用于构建扩展到大量记录并提供高交易速度的索引的方法和装置。提供新的数据结构和方法以确保索引算法以对于算法是自然（有效的）的方式执行，而非均匀访问存储器设备看到对存储器件有效的IO（输入/输出）流量。创建一个数据结构，一个翻译表，将由索引算法查看的逻辑桶映射到存储设备上的物理桶。这种映射使得对非均匀访问SSD和闪存设备的写入性能得到增强。另一种数据结构，关联高速缓存用于收集桶并将其按顺序写入存储器设备，作为大量的顺序写入。方法用于使用索引算法所需的桶（记录）来填充高速缓存。可以在需求读取期间或通过扫描过程从存储器件读取额外的存储桶以进行高速缓存，以便于生成可用的擦除块。

10. 发明申请

US20130132800A1 METHOD AND APPARATUS FOR ALLOCATING ERASURE CODED DATA TO DISK STORAGE 有权
标题翻译：用于分配擦除编码数据进行存储的方法和装置
公开(公告)号：US20130132800A1
公开(公告)日：2013-05-23
申请号：US13302510
申请日：2011-11-22
申请人： Michael W. HEALEY, JR. , David Cordella , Arthur J. Beaverson , Steven Bagby
发明人： Michael W. HEALEY, JR. , David Cordella , Arthur J. Beaverson , Steven Bagby
IPC分类号： H03M13/05 , G06F11/10
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.
摘要翻译：允许擦除编码数据存储在驱动器池中的多个磁盘驱动器中的任何一个上的分配处理，使得该分配不被绑定到固定的驱动组。此外，编码数据可以由多种不同擦除编码算法中的任何一种生成，其中基于用于对数据进行编码的擦除算法，编码数据的再次存储不限于单组驱动器。在另一个实施例中，编码数据可以在选择的驱动器上“堆叠”（对齐）以减少访问数据所需的头部寻道的数量。作为这些改进的结果，系统可以动态地确定多个擦除编码算法中的哪一个用于给定的输入数据块，而不会像现有技术那样与一个特定算法和一组特定的存储设备相关联。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式