利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

14 条记录 (耗时 0.016 秒)

    Computer data storage system with migration plan generator
    1.
    发明授权
    Computer data storage system with migration plan generator 有权
    具有迁移计划生成器的计算机数据存储系统

    公开(公告)号：US06381619B1

    公开(公告)日：2002-04-30

    申请号：US09394221

    申请日：1999-09-13

    申请人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

    发明人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

    IPC分类号： G06F1730

    CPC分类号： G06F17/30289 ,  Y10S707/959 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

    摘要： A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. Further migration plans are provided.

    摘要翻译： 提供了一种数据存储系统，其中迁移计划在预定时间段内从初始配置生成用于达到目标配置的迁移计划。 迁移计划最初使终端移动，直到不再进一步终端移动。 然后，基于减少争用（需要移动到特定数据存储设备上的数据存储器的总大小除以数据存储设备上的超量容量）来进行分流移动。 分流器被选择为导致数据存储系统的最低竞争力。 随后，迁移计划返回到终端移动制定迁移计划。 提供进一步的移民计划。

    System and method for managing storage system performance as a resource
    2.
    发明授权
    System and method for managing storage system performance as a resource 失效
    作为资源管理存储系统性能的系统和方法

    公开(公告)号：US07962563B2

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

    申请号：US11388524

    申请日：2006-03-24

    申请人： Ralph Attila Becker-Szendy ,  Richard Andrew Golding ,  Caixue Lin ,  Theodore Ming-Tao Wong ,  Ahmed Zaki Omer

    发明人： Ralph Attila Becker-Szendy ,  Richard Andrew Golding ,  Caixue Lin ,  Theodore Ming-Tao Wong ,  Ahmed Zaki Omer

    IPC分类号： G06F15/16

    CPC分类号： G06F17/30067

    摘要： A scheduler selects an I/O from a session of a pool and updates token buckets associated with resource limits and reserves for the session and the pool and statistics used in determining fair sharing. To select an I/O, the scheduler identifies sessions with a non-empty queue, identifies head I/Os in the queues, computes for the head I/O a deadline using session and pool reserve buckets and a release time using session and pool limit buckets, and selects a head I/O with an earliest deadline that is past the release time. If the deadline of the selected candidate head I/O is in the past, the scheduler transfers the selected head I/O to the tail of the storage device queue. Otherwise, the scheduler selects the pool with the least amount of I/O traffic according to a session fair share estimator.

    摘要翻译： 调度器从池的会话中选择I / O，并更新与会话的资源限制和预留相关联的令牌桶以及用于确定公平共享的池和统计信息。 为了选择I / O，调度程序将识别具有非空队列的会话，识别队列中的头I / O，使用会话和池预留存储桶计算头I / O截止期限，并使用会话池和池 限制桶，并选择一个超过发布时间的最早期限的头I / O。 如果所选择的候选头I / O的最后期限在过去，调度器将所选择的头I / O传送到存储设备队列的尾部。 否则，调度程序根据会话公平共享估计器选择具有最少I / O流量的池。

    Decision mechanisms for adapting RAID operation placement
    4.
    发明授权
    Decision mechanisms for adapting RAID operation placement 有权
    调整RAID操作布局的决策机制

    公开(公告)号：US07240155B2

    公开(公告)日：2007-07-03

    申请号：US10957167

    申请日：2004-09-30

    申请人： Claudio Matthias Fleiner ,  Richard Andrew Golding ,  Deepak R. Kenchammana-Hosekote ,  Omer Ahmed Zaki

    发明人： Claudio Matthias Fleiner ,  Richard Andrew Golding ,  Deepak R. Kenchammana-Hosekote ,  Omer Ahmed Zaki

    IPC分类号： G06F12/16 ,  G06F15/16

    CPC分类号： H04L67/1095

    摘要： A client node of a distributed storage system adaptive determines on an operation-by-operation basis whether to process a network-RAID IO operation (IO request) locally at the client node or to forward the IO request to a storage server of the system for processing. The client node determines to process the requested network-RAID operation at the client node when a local estimator for a type of the requested network-RAID operation is less than a central estimator for the type of the requested network-RAID operation. Otherwise, the client node determines to process the requested network-RAID operation at a storage server when the local estimator for the type of the requested network-RAID operation is greater than the central estimator for the type of the requested network-RAID operation.

    摘要翻译： 分布式存储系统的客户端节点自适应地确定是否在操作的基础上确定是否在客户端节点本地处理网络RAID IO操作（IO请求），或者将IO请求转发到系统的存储服务器 处理。 当所请求的网络RAID操作的类型的本地估计器小于所请求的网络RAID操作的类型的中心估计器时，客户端节点确定在客户端节点处理所请求的网络RAID操作。 否则，当针对所请求的网络RAID操作的类型的本地估计器大于针对所请求的网络RAID操作的类型的中心估计器时，客户机节点确定在存储服务器处理所请求的网络RAID操作。

    Grouped-object RAID
    5.
    发明授权
    Grouped-object RAID 失效
    分组对象RAID

    公开(公告)号：US07100073B2

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

    申请号：US10751810

    申请日：2004-01-05

    申请人： Richard Andrew Golding

    发明人： Richard Andrew Golding

    IPC分类号： G06F11/00

    CPC分类号： G06F3/0608 ,  G06F3/0667 ,  G06F3/0689 ,  G06F11/1076

    摘要： A RAID-configured grouped-object storage system provides reduced storage space overhead for small objects. The storage system includes a plurality stripes arranged across a plurality of physical objects. Each stripe includes a plurality of storage blocks that are each mapped on to a respectively different physical object. The storage system also includes a plurality of virtual objects each containing at least one storage block. A group of virtual objects is formed when a virtual object contains less storage blocks than the number of stripes by associating the virtual object with at least one virtual object containing less storage blocks than the number of stripes and/or at least one storage block containing zero values so that the storage blocks of each group of virtual objects equals the number of stripes. The storage blocks of each virtual object and of each group of virtual objects are mapped to a respectively different stripe.

    摘要翻译： RAID配置的分组对象存储系统为小型对象提供减少的存储空间开销。 存储系统包括跨越多个物理对象布置的多个条带。 每个条带包括多个存储块，每个存储块被映射到分别不同的物理对象。 存储系统还包括多个虚拟对象，每个虚拟对象包含至少一个存储块。 当虚拟对象通过将虚拟对象与包含比条数少的存储块和/或至少一个包含零的存储块的至少一个虚拟对象相关联时，虚拟对象包含比条数少的存储块时，形成一组虚拟对象 值，使得每组虚拟对象的存储块等于条带数。 每个虚拟对象和每组虚拟对象的存储块被映射到分别不同的条带。

    Method for authenticated communication in dynamic federated environments
    6.
    发明授权
    Method for authenticated communication in dynamic federated environments 有权
    动态联合环境下的认证通信方法

    公开(公告)号：US09130757B2

    公开(公告)日：2015-09-08

    申请号：US12189494

    申请日：2008-08-11

    申请人： Nelly Fazio ,  Richard Andrew Golding ,  Theodore Ming-Tao Wong

    发明人： Nelly Fazio ,  Richard Andrew Golding ,  Theodore Ming-Tao Wong

    IPC分类号： H04L9/32 ,  H04L9/08

    CPC分类号： H04L9/3255 ,  H04L9/085 ,  H04L9/3218

    摘要： According to one embodiment of the present invention, a method for protecting authenticated communication in dynamic federated environments is provided. The method includes distributing shares of a private signature key to a group of users. When switching from an existing to a new group of users, the method includes producing a plurality of sub-shares from each of the distributed shares of existing users, with each sub-share being accompanied by a corresponding validity proof. The sub-shares from multiple existing users are combined to generate a set of shares for new users, with each new share being derived from sub-shares from multiple existing users.

    摘要翻译： 根据本发明的一个实施例，提供了一种在动态联合环境中保护认证通信的方法。 该方法包括将私人签名密钥的共享分发给一组用户。 当从现有用户切换到新的一组用户时，该方法包括从现有用户的每个分发份额生成多个子分组，每个子分享伴随相应的有效性证明。 来自多个现有用户的子分组合以为新用户生成一组共享，每个新分配来自多个现有用户的子分组。

    Generating Human-Centric Directions in Mapping Systems
    9.
    发明申请
    Generating Human-Centric Directions in Mapping Systems 有权
    在映射系统中生成以人为本的方向

    公开(公告)号：US20070016368A1

    公开(公告)日：2007-01-18

    申请号：US11466326

    申请日：2006-08-22

    申请人： Charles Chapin ,  Michele Covell ,  Tiruvilwamalai Raman ,  Andrew Golding ,  Jens Rasmussen

    发明人： Charles Chapin ,  Michele Covell ,  Tiruvilwamalai Raman ,  Andrew Golding ,  Jens Rasmussen

    IPC分类号： G01C21/00

    CPC分类号： G01C21/3602 ,  G01C21/3644 ,  G01C21/3647

    摘要： Digital mapping techniques are disclosed that provide visually-oriented information to the user, such as driving directions that include visual data points along the way of the driving route, thereby improving the user experience. The user may preview the route associated with the driving directions, where the preview is based on, for example, at least one of satellite images, storefront images, and heuristics and/or business listings. The visually-oriented information can be presented to the user in a textual, graphical, or verbal format, or some combination thereof.

    摘要翻译： 公开了向用户提供面向视觉信息的数字映射技术，例如包括沿着驾驶路线的视觉数据点的行驶方向，从而改善用户体验。 用户可以预览与驾驶方向相关联的路线，其中预览基于例如卫星图像，店面图像和启发式和/或商业列表中的至少一个。 面向视觉的信息可以以文本，图形或语言格式或其某种组合呈现给用户。

    Computer data storage system with parallelization migration plan generator
    10.
    发明授权
    Computer data storage system with parallelization migration plan generator 失效
    具有并行迁移计划生成器的计算机数据存储系统

    公开(公告)号：US06571258B1

    公开(公告)日：2003-05-27

    申请号：US09394646

    申请日：1999-09-13

    申请人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

    发明人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

    IPC分类号： G06F1200

    CPC分类号： G06F3/0601 ,  G06F2003/0697 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

    摘要： A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. By determining existence and utilization dependencies of the various moves, independent moves are determined to be implemented in parallel with moves having dependencies. This produces parallelized migration plans which run much faster than sequential migration plans.

    摘要翻译： 提供了一种数据存储系统，其中迁移计划在预定时间段内从初始配置生成用于达到目标配置的迁移计划。 迁移计划最初使终端移动，直到不再进一步终端移动。 然后，基于减少争用（需要移动到特定数据存储设备上的数据存储器的总大小除以数据存储设备上的超量容量）来进行分流移动。 分流器被选择为导致数据存储系统的最低竞争力。 随后，迁移计划返回到终端移动制定迁移计划。 通过确定各种移动的存在和利用依赖性，确定独立移动与具有依赖性的移动并行地实现。 这产生并行迁移计划，其运行速度比顺序迁移计划快得多。