LATCH-FREE, LOG-STRUCTURED STORAGE FOR MULTIPLE ACCESS METHODS
    1.
    发明申请
    LATCH-FREE, LOG-STRUCTURED STORAGE FOR MULTIPLE ACCESS METHODS 审中-公开
    无锁,无结构存储多种访问方式

    公开(公告)号:WO2014205298A1

    公开(公告)日:2014-12-24

    申请号:PCT/US2014/043299

    申请日:2014-06-20

    Abstract: A data manager may include a data opaque interface configured to provide, to an arbitrarily selected page-oriented access method, interface access to page data storage that includes latch-free access to the page data storage. In another aspect, a swap operation may be initiated, of a portion of a first page in cache layer storage to a location in secondary storage, based on initiating a prepending of a partial swap delta record to a page state associated with the first page, the partial swap delta record including a main memory address indicating a storage location of a flush delta record that indicates a location in secondary storage of a missing part of the first page. In another aspect, a page manager may initiate a flush operation of a first page in cache layer storage to a location in secondary storage, based on atomic operations with flush delta records.

    Abstract translation: 数据管理器可以包括数据不透明接口,被配置为向任意选择的面向页面的访问方法提供对包括对页面数据存储器的无闩锁访问的页面数据存储的接口访问。 在另一方面,可以基于发起部分交换增量记录的前缀到与第一页相关联的页面状态,将高速缓存层存储器中的第一页面的一部分的交换操作发起到辅助存储器中的位置, 该部分交换增量记录包括指示闪存增量记录的存储位置的主存储器地址,其指示第一页的缺失部分的辅助存储器中的位置。 在另一方面,页面管理器可以基于具有刷新三角洲记录的原子操作来启动高速缓存层存储器中的第一页面的刷新操作到辅助存储器中的位置。

    DATA CENTER INTERCONNECT AND TRAFFIC ENGINEERING

    公开(公告)号:WO2009151985A3

    公开(公告)日:2009-12-17

    申请号:PCT/US2009/045769

    申请日:2009-05-31

    Abstract: A system for commoditizing data center networking is disclosed. The system includes an interconnection topology for a data center having a plurality of servers and a plurality of nodes of a network in the data center through which data packets may be routed. The system uses a routing scheme where the routing is oblivious to the traffic pattern between nodes in the network, and wherein the interconnection topology contains a plurality of paths between one or more servers. The multipath routing may be Valiant load balancing. It disaggregates the function of load balancing into a group of regular servers, with the result that load balancing server hardware can be distributed amongst racks in the data center leading to greater agility and less fragmentation. The architecture creates a huge, flexible switching domain, supporting any server/any service, full mesh agility, and unregimented server capacity at low cost.

    CACHING CONTENT ADDRESSABLE DATA CHUNKS FOR STORAGE VIRTUALIZATION

    公开(公告)号:WO2014159781A3

    公开(公告)日:2014-10-02

    申请号:PCT/US2014/025111

    申请日:2014-03-12

    Abstract: The subject disclosure is directed towards using primary data deduplication concepts for more efficient access of data via content addressable caches. Chunks of data, such as deduplicated data chunks, are maintained in a fast access client-side cache, such as containing chunks based upon access patterns. The chunked content is content addressable via a hash or other unique identifier of that content in the system. When a chunk is needed, the client-side cache (or caches) is checked for the chunk before going to a file server for the chunk. The file server may likewise maintain content addressable (chunk) caches. Also described are cache maintenance, management and organization, including pre-populating caches with chunks, as well as using RAM and/or solid-state storage device caches.

    MEMORY SHARING OVER A NETWORK
    5.
    发明申请
    MEMORY SHARING OVER A NETWORK 审中-公开
    内存共享一个网络

    公开(公告)号:WO2014151168A1

    公开(公告)日:2014-09-25

    申请号:PCT/US2014/025145

    申请日:2014-03-13

    Abstract: Memory is shared among physically distinct, networked computing devices. Each computing device comprises a Remote Memory Interface (RMI) accepting commands from locally executing processes and translating such commands into forms transmittable to a remote computing device. The RMI also accepts remote communications directed to it and translates those into commands directed to local memory. The amount of storage capacity shared is informed by a centralized controller, either a single controller, a hierarchical collection of controllers, or a peer-to-peer negotiation. Requests that are directed to remote high-speed non-volatile storage media are detected or flagged and the process generating the request is suspended such that it can be efficiently revived. The storage capacity provided by remote memory is mapped into the process space of processes executing locally.

    Abstract translation: 内存在物理上不同的联网计算设备之间共享。 每个计算设备包括接收来自本地执行过程的命令的远程存储器接口(RMI),并将这些命令转换成可发送到远程计算设备的形式。 RMI还接受指向它的远程通信,并将它们转换为指向本地存储器的命令。 共享的存储容量由集中控制器,单个控制器,控制器的分层收集或对等协商通知。 针对远程高速非易失性存储介质的请求被检测或标记,并且产生请求的过程被暂停,使得可以有效地恢复。 由远程存储器提供的存储容量映射到本地执行的进程的进程空间。

    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION
    6.
    发明申请
    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION 审中-公开
    使用索引分割和调和进行数据重传

    公开(公告)号:WO2012092212A2

    公开(公告)日:2012-07-05

    申请号:PCT/US2011/067292

    申请日:2011-12-23

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

    Abstract translation: 本主题公开内容针对一种重复数据删除技术,其中将散列索引服务的索引划分为子空间索引,并且缓存整个散列索引服务的索引以节省存储空间。 子空间索引被访问以确定数据块是否已经存在或需要被索引和存储。 索引可根据与要索引的数据相关的条件划分为子空间,如文件类型,数据类型,上次使用时间等。 还描述了子空间协调,其中检测子空间中的重复条目以从重复删除系统中删除条目和块。 当有更多的系统资源可用时,可以在非高峰时间执行子空间对帐,并且如果需要资源,可能会中断子空间对帐。 要调和的子空间可能基于相似性,包括通过每个紧凑地表示子空间散列的签名的相似性。

    DISTRIBUTED LOAD BALANCER
    7.
    发明申请
    DISTRIBUTED LOAD BALANCER 审中-公开
    分布式负载平衡器

    公开(公告)号:WO2010019629A2

    公开(公告)日:2010-02-18

    申请号:PCT/US2009/053494

    申请日:2009-08-11

    CPC classification number: G06F9/505 H04L67/1002

    Abstract: Systems and methods that distribute load balancing functionalities in a data center. A network of demultiplexers and load balancer servers enable a calculated scaling and growth operation, wherein capacity of load balancing operation can be adjusted by changing the number of load balancer servers. Accordingly, load balancing functionality/design can be disaggregated to increase resilience and flexibility for both the load balancing and switching mechanisms of the data center.

    Abstract translation: 在数据中心中分配负载均衡功能的系统和方法。 多路分解器和负载平衡器服务器的网络实现计算的缩放和增长操作,其中可以通过改变负载平衡器服务器的数量来调整负载平衡操作的容量。 因此,负载平衡功能/设计可以分解,以增加数据中心的负载平衡和切换机制的弹性和灵活性。

    PREDICTING DATA COMPRESSIBILITY USING DATA ENTROPY ESTIMATION
    8.
    发明申请
    PREDICTING DATA COMPRESSIBILITY USING DATA ENTROPY ESTIMATION 审中-公开
    使用数据熵估计预测数据的可压缩性

    公开(公告)号:WO2014133982A1

    公开(公告)日:2014-09-04

    申请号:PCT/US2014/018129

    申请日:2014-02-25

    CPC classification number: H03M7/30 H03M7/3091

    Abstract: The subject disclosure is directed towards predicting compressibility of a data block, and using the predicted compressibility in determining whether a data block if compressed will be sufficiently compressible to justify compression. In one aspect, data of the data block is processed to obtain an entropy estimate of the data block, e.g., based upon distinct value estimation. The compressibility prediction may be used in conjunction with a chunking mechanism of a data deduplication system.

    Abstract translation: 本发明涉及预测数据块的可压缩性,并且在确定数据块是否被压缩时将使用预测的可压缩性将足够可压缩以证明压缩。 在一个方面,数据块的数据被处理以获得数据块的熵估计,例如基于不同的值估计。 压缩性预测可以与重复数据删除系统的分块机制结合使用。

    ADAPTIVE INDEX FOR DATA DEDUPLICATION
    9.
    发明申请

    公开(公告)号:WO2012092348A3

    公开(公告)日:2012-07-05

    申请号:PCT/US2011/067544

    申请日:2011-12-28

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.

Patent Agency Ranking