会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • Protocol virtualization for a network file system
    • 网络文件系统的协议虚拟化
    • US20080126434A1
    • 2008-05-29
    • US11498344
    • 2006-08-03
    • Mustafa UysalRam SwaminathanJunwen Lai
    • Mustafa UysalRam SwaminathanJunwen Lai
    • G06F17/30
    • H04L67/1097G06F17/30233H04L69/08
    • A method of providing protocol virtualization for a network file system. In particular, at least one virtual file server is established in the data path between the clients and the physical file systems. The virtual file server presents a virtualized name space and a virtualized ID space to the clients, the virtualized name and ID space representing the physical files on the physical file servers. To the clients, the virtual file server appears to be file server. To the physical file servers, the virtual file server appears to be a client. Junction directories permit the virtual file servers to combine physically separate directories to appear as one, and permit migration of objects between the physical file servers without perception by the clients.
    • 为网络文件系统提供协议虚拟化的方法。 特别地,在客户机和物理文件系统之间的数据路径中建立至少一个虚拟文件服务器。 虚拟文件服务器向客户端呈现虚拟化名称空间和虚拟化ID空间,虚拟化名称和ID空间表示物理文件服务器上的物理文件。 对于客户端,虚拟文件​​服务器似乎是文件服务器。 对于物理文件服务器,虚拟文件​​服务器似乎是一个客户端。 连接目录允许虚拟文件服务器将物理上独立的目录组合为一体,并允许在物理文件服务器之间迁移对象,而不会由客户端感知。
    • 10. 发明授权
    • Sharding method and apparatus using directed graphs
    • 使用有向图的分片方法和装置
    • US07043621B2
    • 2006-05-09
    • US10439977
    • 2003-05-15
    • Arif MerchantMahesh KallahallaRam Swaminathan
    • Arif MerchantMahesh KallahallaRam Swaminathan
    • G06F12/00
    • G06F3/0608G06F3/061G06F3/0629G06F3/0665G06F3/0683Y10S707/99953Y10S707/99956
    • A method and apparatus is used to divide a storage volume into shards. The division is made using a directed graph having a vertex for each block in the storage volume and directed-edges between pairs of vertices representing a shard of blocks, associating a weight with each directed edge that represents the dissimilarity for the shard of blocks between the corresponding pair of vertices, selecting a maximum number of shards (K) for dividing the storage volume, identifying a minimum aggregate weight associated with a current vertex for a combination of no more than K shards, performing the identification of the minimum aggregate weight for vertices in the directed graph, and picking the smallest aggregated weight associated with the last vertex to determine a sharding that spans the storage volume and provides a minimal dissimilarity among no more than K shards of blocks.
    • 使用方法和装置将存储卷分成碎片。 使用具有存储卷中的每个块的顶点的有向图以及表示块的块的顶点对之间的有向边,将权重与代表块之间的块的不同性的每个有向边相关联 相应的顶点对,选择用于划分存储卷的最大碎片数(K),识别与不超过K个碎片的组合的当前顶点相关联的最小聚集权重,执行顶点的最小聚集权重的标识 在有向图中,并选择与最后一个顶点相关联的最小聚合权重,以确定跨越存储卷的分片,并在不超过K个块的块中提供最小的不相似性。