公开(公告)号：WO2012158501A1

公开(公告)日：2012-11-22

申请号：PCT/US2012/037471

申请日：2012-05-11

Applicant: SIMPLIVITY CORPORATION ,  BEAVERSON, Arthur, J. ,  CHITRAPU, Kishore ,  CZERKOWICZ, John, Michael ,  MANJANATHA, Sowmya

Inventor： BEAVERSON, Arthur, J. ,  CHITRAPU, Kishore ,  CZERKOWICZ, John, Michael ,  MANJANATHA, Sowmya

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F17/30094 ,  G06F17/30194 ,  H04L67/1087

Abstract: 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.

Abstract translation: 提供了用于跟踪存储在多个网络节点上的对象实例的方法和系统，该跟踪使得能够全局确定对象何时没有跨网络节点的引用，并且可以安全地解除分配。 根据本发明的一个方面，每个节点具有本地对象存储器，用于跟踪和可选地在节点上存储对象，并且本地对象存储器通过网络共享共享本地存储的对象的实例。 一个或多个应用，例如文件系统和/或存储系统，使用本地对象存储来存储应用的所有持久数据作为对象。

公开(公告)号：WO2015026925A1

公开(公告)日：2015-02-26

申请号：PCT/US2014/051855

申请日：2014-08-20

Applicant: SIMPLIVITY CORPORATION

Inventor： ST. LAURENT, Jesse ,  KING, James, E. III

IPC: G06F9/455

CPC classification number: G06F17/30076 ,  G06F9/45558 ,  G06F17/30221 ,  G06F17/30233 ,  G06F2009/4557

Abstract: 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.

Abstract translation: 用于转换虚拟机文件的系统和方法，而不需要将虚拟机有效负载（数据）从一个位置复制到另一个位置。 通过消除这一步骤，申请人的发明显着提高了转换过程的效率。 在一个实施例中，文件系统或存储系统向存储在持久存储介质上的数据元素的位置提供内容。 源虚拟机文件包括虚拟机管理程序文件格式的虚拟机管理程序元数据（HM）数据元素以及虚拟机有效载荷（VMP）数据元素。 通过转换源文件的HM数据元素来创建源虚拟机文件，以创建与源虚拟机管理程序格式不同的目的地管理程序格式的目标HM数据元素; 维持存储在永久存储介质上的VMP数据元素的位置在从源到目的地文件格式的转换期间不变，而不读或写VMP数据元素; 并创建引用以引用目的地管理程序格式中的目的地HM数据元素和现有存储的VMP数据元素。

公开(公告)号：US09367551B2

公开(公告)日：2016-06-14

申请号：US13932297

申请日：2013-07-01

Applicant: SimpliVity Corporation

Inventor： Arthur J. Beaverson ,  Paul Bowden

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F17/30088 ,  G06F17/30091 ,  G06F17/30117 ,  G06F17/30153 ,  G06F17/30156 ,  G06F17/30203 ,  G06F17/30233 ,  G06F17/30327 ,  G06F17/30949 ,  G06F17/30952

Abstract: A digitally signed file system in which data, metadata and files are objects, each object having a globally unique and content-derived fingerprint and wherein object references are mapped by the fingerprints; the file system has a root object comprising a mapping of all object fingerprints in the file system, such that a change to the file system results in a change in the root object, and tracking changes in the root object provides a history of file system activity.

Abstract translation: 数据签名的文件系统，其中数据，元数据和文件是对象，每个对象具有全局唯一性和内容导出的指纹，并且其中对象引用被指纹映射; 文件系统具有包括文件系统中的所有对象指纹的映射的根对象，使得对文件系统的改变导致根对象的改变，并且跟踪根对象中的变化提供了文件系统活动的历史 。

公开(公告)号：WO2013078342A1

公开(公告)日：2013-05-30

申请号：PCT/US2012/066297

申请日：2012-11-21

Applicant: SIMPLIVITY CORPORATION ,  HEALEY, Michael, W. ,  CORDELLA, David ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

Inventor： HEALEY, Michael, W. ,  CORDELLA, David ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

IPC: G06F3/06

CPC classification number: G06F3/0619 ,  G06F3/0607 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0689

Abstract: 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.

Abstract translation: 允许擦除编码数据存储在驱动器池中的多个磁盘驱动器中的任何一个上的分配处理，使得该分配不被绑定到固定的驱动组。 此外，编码数据可以由多种不同擦除编码算法中的任何一种生成，其中基于用于对数据进行编码的擦除算法，编码数据的再次存储不限于单组驱动器。 在另一个实施例中，编码数据可以在选择的驱动器上“堆叠”（对齐）以减少访问数据所需的头部寻道的数量。 作为这些改进的结果，系统可以动态地确定多个擦除编码算法中的哪一个用于给定的输入数据块，而不会像现有技术那样与一个特定算法和一组特定的存储设备相关联。

公开(公告)号：WO2013126680A1

公开(公告)日：2013-08-29

申请号：PCT/US2013/027296

申请日：2013-02-22

Applicant: SIMPLIVITY CORPORATION ,  CZERKOWICZ, John, Michael ,  BEAVERSON, Arthur, J. ,  BAGBY, Steve ,  MANJANATHA, Sowmya

Inventor： CZERKOWICZ, John, Michael ,  BEAVERSON, Arthur, J. ,  BAGBY, Steve ,  MANJANATHA, Sowmya

IPC: G06F17/30

CPC classification number: G06F12/08 ,  G06F12/0864 ,  G06F17/30097 ,  G06F17/30949 ,  G06F2212/1056 ,  G06F2212/152

Abstract: 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.

Abstract translation: 基于数据内容将数据放置在随机存取存储器中的装置和方法，使得不需要索引操作。 将强（例如，加密）散列应用于导致签名的数据元素。 然后将较弱的散列函数应用于签名以在数据元素的存储器中生成存储位置。 较弱的散列函数将多个数据元素分配给相同的存储位置，而签名包括用于在该位置定位特定数据元素的唯一标识符。 在一个实施例中，连续地应用多个弱散列函数以增加存储空间利用率。 在其他实施例中，分配的存储位置可以由数据元素和/或存储技术的一个或多个属性确定，例如长寿命与短寿命数据和/或具有不同性能的存储器的不同区域（例如， ，访问延迟内存生存期）特性。

公开(公告)号：WO2013126665A1

公开(公告)日：2013-08-29

申请号：PCT/US2013/027277

申请日：2013-02-22

Applicant: SIMPLIVITY CORPORATION ,  BEAVERSON, Arthur, J. ,  BOWDEN, Paul ,  MANJANATHA, Sowmya ,  HUANG, Jinsong

Inventor： BEAVERSON, Arthur, J. ,  BOWDEN, Paul ,  MANJANATHA, Sowmya ,  HUANG, Jinsong

IPC: G06F17/30

CPC classification number: 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

Abstract: 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.

Abstract translation: 用于在非均匀访问存储器中存储记录的方法和装置。 在各种实施例中，记录的放置被定位在存储器的一个或多个区域中。 这可以利用哈希函数的不同有序列表来优化地将记录映射到存储器的不同区域以实现一个或多个性能特征或者考虑底层存储器技术的差异来实现。 例如，哈希函数的一个有序列表可以本地化数据以便更快速地访问。 哈希函数的另一个列表可以将期望具有相对较短寿命的数据本地化。 定位这样的数据可以显着改善擦除性能和/或存储器寿命，例如通过将过时的数据元素集中在一个位置中。 因此，有序散列函数的两个或多个列表可以改进访问等待时间，存储器寿命和/或操作速率中的一个或多个。

公开(公告)号：WO2016115219A1

公开(公告)日：2016-07-21

申请号：PCT/US2016/013194

申请日：2016-01-13

Applicant: SIMPLIVITY CORPORATION

Inventor： KLARAKIS, George A. ,  XIAO, Yan ,  OLSON, Thomas G.

IPC: G06F11/14 ,  G06F11/20

CPC classification number: G06F3/0619 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/0667 ,  G06F3/067 ,  G06F11/1451 ,  G06F11/1453 ,  G06F11/1464 ,  G06F2201/815 ,  G06F2201/83 ,  G06F2201/84 ,  H04L12/2854

Abstract: Systems, methods, and computer-readable storage media for inter-node data replication while reducing network traffic for remote backup. A system receives a command to duplicate a dataset, located on a source network node, to a remote network node, accesses, on the source network node, signatures of a previous snapshot of the dataset and signatures of a current snapshot of the dataset, performs, at the source network node, a local signature comparison between the previous snapshot and the current snapshot to identify one or more signatures that do not match, sends the signatures that do not match to the remote network node, searches, on the remote network node, for the signatures that do not match, and sends data associated with the signatures that do not match to the remote network node for incorporation within a current remote snapshot if they do not exist on a current remote network node.

Abstract translation: 用于节点间数据复制的系统，方法和计算机可读存储介质，同时减少用于远程备份的网络流量。 系统接收到将位于源网络节点上的数据集复制到远程网络节点的命令，在源网络节点上访问数据集的先前快照的签名和数据集的当前快照的签名，执行 在源网络节点处，先前快照和当前快照之间的本地签名比较以识别不匹配的一个或多个签名，发送与远程网络节点不匹配的签名，在远程网络节点上进行搜索 ，对于不匹配的签名，并且如果它们在当前远程网络节点上不存在，则将与不匹配的签名相关联的数据发送到远程网络节点以合并到当前远程快照中。

公开(公告)号：WO2013012663A2

公开(公告)日：2013-01-24

申请号：PCT/US2012/046398

申请日：2012-07-12

Applicant: SIMPLIVITY CORPORATION ,  CORDELLA, David ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

Inventor： CORDELLA, David ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/0643 ,  G06F3/0689 ,  G06F12/08

Abstract: 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).

Abstract translation: 用于在磁盘存储器上定位数据的方法和设备，其中可以将数据的多个实例存储在不同的位置以满足不同的使用要求，例如读取访问，写入访问和数据安全性。 该方法允许诸如文件系统的数据存储系统在不同类型（例如，大小和速度）的磁盘存储上提供读取优化和写入优化性能。

公开(公告)号：WO2012177461A1

公开(公告)日：2012-12-27

申请号：PCT/US2012/042244

申请日：2012-06-13

Applicant: SIMPLIVITY CORPORATION ,  KING, James, E., III ,  STACK, Michael, T. ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

Inventor： KING, James, E., III ,  STACK, Michael, T. ,  BEAVERSON, Arthur, J. ,  BAGBY, Steven

IPC: G06F17/30

CPC classification number: G06F17/30575 ,  G06F17/30088 ,  G06F17/30206 ,  G06F17/30356 ,  G06F17/30584 ,  H04L67/1095

Abstract: 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.

Abstract translation: 用于通过网络复制数据结构的方法和装置，其中每个数据结构在多个联网的对等节点之间分配所有者节点。 优选地，可以通过数据结构中的信息来确定所有者。 当非所有者希望对数据结构进行更新时，在网络上发送修改数据结构的请求，当所有者收到时，所有者执行修改。 所有者节点可以通知其他节点有关更新。 该方法通过单写入器多读取器范例实现，确保可用性，分区容限和最终一致性; 它避免了现有技术的集中管理和锁定协议的高开销成本和单点故障缺点。 管理员可以连接到网络中的任何对等节点来管理，监视和请求修改数据结构。

公开(公告)号：US20160371354A1

公开(公告)日：2016-12-22

申请号：US15249864

申请日：2016-08-29

Applicant: SimpliVity Corporation

Inventor： James E. King, III ,  Michael T. Stack ,  Arthur J. Beaverson ,  Steven Bagby

IPC: G06F17/30 ,  H04L29/08

CPC classification number: G06F17/30575 ,  G06F17/30088 ,  G06F17/30206 ,  G06F17/30356 ,  G06F17/30584 ,  H04L67/1095

Abstract: 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.

Abstract translation: 用于通过网络复制数据结构的方法和装置，其中每个数据结构在多个联网的对等节点之间分配所有者节点。 优选地，可以通过数据结构中的信息来确定所有者。 当非所有者希望对数据结构进行更新时，在网络上发送修改数据结构的请求，当所有者收到时，所有者执行修改。 所有者节点可以通知其他节点有关更新。 该方法通过单写入器多读取器范例实现，确保可用性，分区容限和最终一致性; 它避免了现有技术的集中管理和锁定协议的高开销成本和单点故障缺点。 管理员可以连接到网络中的任何对等节点来管理，监视和请求修改数据结构。