会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • METHOD OF PROVIDING STORAGE TO VIRTUAL COMPUTER CLUSTER WITHIN SHARED COMPUTING ENVIRONMENT
    • 在共享计算环境中向虚拟计算机集群提供存储的方法
    • WO2006042115A2
    • 2006-04-20
    • PCT/US2005/036166
    • 2005-10-05
    • HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.KALLAHALLA, MaheshUYSAL, MustafaSWAMINATHAN, Ram
    • KALLAHALLA, MaheshUYSAL, MustafaSWAMINATHAN, Ram
    • G06F3/06
    • G06F3/0608G06F3/0622G06F3/0637G06F3/0665G06F3/067G06F21/57
    • An embodiment of a method of providing storage to a virtual computer cluster within a shared computing environment (200) begins with a first step of combining storage resources within the shared computing environment (200) into a virtual storage pool. The virtual storage pool comprises at least portions of storage devices (204, 220) in which at least one of the storage devices (204, 220) is not directly accessible by all computers (202) which directly access any of the storage devices (204, 220). The method continues with a second step of partitioning a virtual storage volume from the virtual storage pool. In a third step, the method assigns the virtual storage volume to the virtual computer cluster. The method concludes with a fourth step of maiking the virtual storage volume accessible to computing platforms (306, 406) of the virtual computer cluster using software. The software allows access to the virtual storage volume by computing platforms (306, 406) while precluding access to remaining storage within the shared computing environment (200) by the computing platforms (306, 406).
    • 向共享计算环境(200)内的虚拟计算机集群提供存储的方法的实施例从将共享计算环境(200)内的存储资源组合成虚拟存储池的第一步骤开始。 虚拟存储池至少包括存储设备(204,220)的至少一部分,其中至少一个存储设备(204,220)不能直接访问任何存储设备(204)的所有计算机(202)直接访问 ,220)。 该方法继续第二步,从虚拟存储池分区虚拟存储卷。 在第三步中,该方法将虚拟存储卷分配给虚拟计算机集群。 该方法结束于第四步,利用软件对虚拟计算机集群的计算平台(306,406)可访问的虚拟存储卷进行处理。 软件允许通过计算平台(306,406)访问虚拟存储卷,同时防止由计算平台(306,406)访问共享计算环境(200)内的剩余存储。
    • 4. 发明申请
    • GENERATION OF A REPRESENTATIVE DATA STRING
    • 代表资料库的生成
    • WO2009091411A1
    • 2009-07-23
    • PCT/US2008/051516
    • 2008-01-18
    • HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.VISWANATHAN, KrishnamurthySWAMINATHAN, Ram
    • VISWANATHAN, KrishnamurthySWAMINATHAN, Ram
    • G06F17/27G06F17/22
    • G06K9/723
    • Provided are, among other things, systems, methods and techniques for generating a representative data string. In one representative implementation: (a) starting data positions are identified within input strings of data values; (b) a subsequence of output data values is determined based on the data values at data positions determined with reference to the starting data positions within the input strings; (c) an identification is made as to which of the input strings have segments that match the subsequence of output data values, based on a matching criterion; (d) steps (a)-(c) are repeated for a number of iterations; and (e) the subsequences of output data values are combined across the iterations to provide an output data string, with the determination in step (b) for a current iteration being based on the identification in step (c) for a previous iteration.
    • 除其他之外,提供用于生成代表性数据串的系统,方法和技术。 在一个代表性实现中:(a)起始数据位置在数据值的输入字符串内被识别; (b)输出数据值的子序列根据在参照输入串中的开始数据位置确定的数据位置处的数据值来确定; (c)基于匹配标准,确定哪个输入字符串具有与输出数据值的子序列匹配的段; (d)重复步骤(a) - (c)进行多次迭代; 并且(e)输出数据值的子序列在整个迭代中被组合以提供输出数据串,其中步骤(b)中针对当前迭代的确定是基于在先前迭代的步骤(c)中的识别。
    • 6. 发明申请
    • METHOD OF PROVIDING STORAGE TO VIRTUAL COMPUTER CLUSTER WITHIN SHARED COMPUTING ENVIRONMENT
    • 为共享计算环境中的虚拟计算机集群提供存储的方法
    • WO2006042115A3
    • 2006-07-27
    • PCT/US2005036166
    • 2005-10-05
    • HEWLETT PACKARD DEVELOPMENT COKALLAHALLA MAHESHUYSAL MUSTAFASWAMINATHAN RAM
    • KALLAHALLA MAHESHUYSAL MUSTAFASWAMINATHAN RAM
    • G06F3/06
    • G06F3/0608G06F3/0622G06F3/0637G06F3/0665G06F3/067G06F21/57
    • An embodiment of a method of providing storage to a virtual computer cluster within a shared computing environment (200) begins with a first step of combining storage resources within the shared computing environment (200) into a virtual storage pool. The virtual storage pool comprises at least portions of storage devices (204, 220) in which at least one of the storage devices (204, 220) is not directly accessible by all computers (202) which directly access any of the storage devices (204, 220). The method continues with a second step of partitioning a virtual storage volume from the virtual storage pool. In a third step, the method assigns the virtual storage volume to the virtual computer cluster. The method concludes with a fourth step of maiking the virtual storage volume accessible to computing platforms (306, 406) of the virtual computer cluster using software. The software allows access to the virtual storage volume by computing platforms (306, 406) while precluding access to remaining storage within the shared computing environment (200) by the computing platforms (306, 406).
    • 向共享计算环境(200)内的虚拟计算机集群提供存储的方法的实施例从将共享计算环境(200)内的存储资源组合到虚拟存储池的第一步骤开始。 虚拟存储池包括存储设备(204,220)的至少一部分,其中存储设备(204,220)中的至少一个不能被直接访问存储设备(204,220)中的任一个的所有计算机(202)直接访问 ,220)。 该方法继续进行从虚拟存储池分区虚拟存储卷的第二步骤。 在第三步中,该方法将虚拟存储卷分配给虚拟计算机群集。 该方法以第四步骤结束,第四步使用软件使虚拟计算机集群的计算平台(306,406)可访问的虚拟存储卷。 该软件允许通过计算平台(306,406)访问虚拟存储卷,同时阻止计算平台(306,406)访问共享计算环境(200)内的剩余存储。
    • 8. 发明申请
    • NON-GREEDY DIFFERENTIAL COMPENSATION
    • 非优质差异补偿
    • WO2011014182A1
    • 2011-02-03
    • PCT/US2009/052377
    • 2009-07-31
    • HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.VISWANATHAN, KrishnamurthySWAMINATHAN, Ram
    • VISWANATHAN, KrishnamurthySWAMINATHAN, Ram
    • H03M7/36H03M3/00
    • H03M7/3088
    • A compression process (400) or system (700) constructs tables (740) associated with first locations in input data (710). Each table (500) includes entries corresponding to second locations in a reference file, and each second location identifies parts of the reference file that are candidate approximate matches for parts of the input data (710) at the associated first location. For each table (500), costs associated with differential encoding of the parts of the input data at the first location can be determined using the candidate approximate matches identified by the entries in the table. A partition of the input data using the parts for which the costs were determined can be selected to minimize a sum of the costs determined for the parts in the partition, and the parts in the partition can be encoded to compress the input data.
    • 压缩处理(400)或系统(700)构造与输入数据(710)中的第一位置相关联的表(740)。 每个表(500)包括与参考文件中的第二位置相对应的条目,并且每个第二位置标识作为在相关联的第一位置处的输入数据(710)的部分的候选近似匹配的参考文件的部分。 对于每个表(500),可以使用由表中的条目标识的候选近似匹配来确定与第一位置处的输入数据的部分的差分编码相关联的成本。 可以选择使用确定成本的部分的输入数据的分区,以最小化为分区中的部分确定的成本的总和,并且可以对分区中的部分进行编码以压缩输入数据。