-
公开(公告)号：US07594016B1
公开(公告)日：2009-09-22
申请号：US11153925
申请日：2005-06-16
IPC分类号： G06F15/173
CPC分类号： G06F9/5061 , H04L41/0893 , H04L67/1002 , H04L67/1023
摘要： Fractional, non-integer numbers of servers are calculated for respective tiers of a multi-tiered system using a server allocation algorithm. The fractional, non-integer numbers of servers are rounded up to integer numbers to compute allocated numbers of servers for respective tiers.
摘要翻译： 使用服务器分配算法为多层系统的各层计算分数的非整数数量的服务器。 服务器的分数非整数数字将舍入为整数，以计算各层次的服务器分配数。
-
公开(公告)号：US07886055B1
公开(公告)日：2011-02-08
申请号：US11117197
申请日：2005-04-28
IPC分类号： G06F15/173
CPC分类号： G06F9/505 , H04L67/1004
摘要： To perform resource allocation in a system having plural tiers, one of plural resource allocation algorithms is selected in response to determining, based on one or more conditions, which of the plural resource allocation algorithms to select. The selected resource allocation algorithm is used to allocate resources for the plural tiers of the system.
摘要翻译： 为了在具有多个层的系统中执行资源分配，响应于基于一个或多个条件来确定要选择的多个资源分配算法中的哪一个来选择多个资源分配算法中的一个。 所选择的资源分配算法用于为系统的多层分配资源。
-
3.发明授权Allocation of resources for tiers of a multi-tiered system based on selecting items from respective sets 有权基于从各个集合中选择项目，为多层系统的层级分配资源公开(公告)号：US09021094B1
公开(公告)日：2015-04-28
申请号：US11116728
申请日：2005-04-28
CPC分类号： G06F17/30528 , G06F9/45533 , G06F9/5066
摘要： Plural sets of items corresponding to plural tiers of a multi-tiered system are defined, where the items represent amounts of resources to allocate to the tiers. Items from respective sets are selected based on a response time constraint and a target cost. Information is provided pertaining to allocation of amounts of resources to the respective tiers based on the selected items.
摘要翻译： 定义与多层系统的多层相对应的多组项目，其中项目表示分配给层的资源量。 基于响应时间约束和目标成本来选择来自各组的项目。 提供了关于基于所选项目向相应层分配资源量的信息。
-
公开(公告)号：US09940469B2
公开(公告)日：2018-04-10
申请号：US14421759
申请日：2012-08-30
申请人： Jun Li , Ram Swaminathan , Sharad Singhal
发明人： Jun Li , Ram Swaminathan , Sharad Singhal
摘要： A method performed by a processing system includes determining a location in a metadata tree of a patient for an electronic health record, generating a record key for the electronic health record based on the location and a provider key corresponding to a provider, the provider key generated from a patient key corresponding to the patient, encrypting the electronic health record using the record key to generate a encrypted record, and providing the encrypted record to an encrypted data store.
-
5.发明授权Encryption key management using distributed storage of encryption-key fragments 有权加密密钥管理使用分布式存储的加密密钥片段公开(公告)号：US09165158B2
公开(公告)日：2015-10-20
申请号：US13817345
申请日：2010-08-17
申请人： Jun Li , Ram Swaminathan , Alan H. Karp
发明人： Jun Li , Ram Swaminathan , Alan H. Karp
CPC分类号： G06F21/6218 , H04L9/08 , H04L9/083 , H04L9/085 , H04L9/0894
摘要： An encryption key fragment is divided into a number of encryption key fragments. Requests to store different ones of the encryption key fragments are transmitted to different computer memory storage systems. An individual request to store an encryption key fragment includes one of the encryption key fragments and bears an access control hallmark for regulating access to the encryption key fragment.
摘要翻译： 加密密钥片段被分成多个加密密钥片段。 存储不同的加密密钥片段的请求被发送到不同的计算机存储器存储系统。 存储加密密钥片段的个人请求包括加密密钥片段中的一个，并且具有用于调节对加密密钥片段的访问的访问控制标志。
-
公开(公告)号：US08514776B2
公开(公告)日：2013-08-20
申请号：US12433717
申请日：2009-04-30
IPC分类号： H04W4/00
CPC分类号： H04L41/147 , H04L41/142 , H04L41/5009 , H04W24/00 , H04W24/10
摘要： A wireless network metric region in a wireless network is determined using a node metric region and a performance metric. The node metric region, which includes a boundary of the node metric region, for each node is estimated and the performance metric for the node metric region for each node is measured. The boundary of the node metric region for each node is adjusted based on the measured performance metric and then the wireless network metric region for the wireless network is determined based on the adjusted boundaries of the node metric region for each node.
摘要翻译： 使用节点度量区域和性能度量来确定无线网络中的无线网络度量区域。 估计每个节点包括节点度量区域的边界的节点度量区域，并测量每个节点的节点度量区域的性能度量。 基于测量的性能度量来调整每个节点的节点度量区域的边界，然后基于每个节点的节点度量区域的调整的边界来确定无线网络的无线网络度量区域。
-
公开(公告)号：US08250427B2
公开(公告)日：2012-08-21
申请号：US12243471
申请日：2008-10-01
IPC分类号： H03M13/00
CPC分类号： H03M13/01 , H03M13/1191 , H03M13/15 , H03M13/1515 , H03M13/356 , H03M13/373 , H03M13/3761
摘要： A technique for selecting an erasure code from a plurality of erasure codes for use in a fault tolerant system comprises generating a preferred set of erasure codes based on characteristics of the codes' corresponding Tanner graphs. The fault tolerances of the preferred codes are compared based at least on the Tanner graphs. A more fault tolerant code is selected based on the comparison.
摘要翻译： 用于从容错系统中使用的多个擦除代码中选择擦除代码的技术包括基于代码对应的Tanner图的特性来产生一组优选的擦除代码。 至少在Tanner图上比较优选代码的容错。 基于比较选择更多的容错代码。
-
公开(公告)号：US07697690B2
公开(公告)日：2010-04-13
申请号：US10624403
申请日：2003-07-21
申请人： Kevin E. Fu , Mahesh Kallahalla , Ram Swaminathan
发明人： Kevin E. Fu , Mahesh Kallahalla , Ram Swaminathan
CPC分类号： H04L9/083 , G06F19/00 , H04L9/0841 , H04L9/0891
摘要： Windowed backward key rotation. A user is provided information that allows determining a limited number of previous keys in a series of keys from a later key in the series. A key in the series is generated, based at least in part on the information provided to the user. The key in the series is provided to the user. The user determines at least one key in the limited number of previous keys in the series by applying the information to the key in the series.
摘要翻译： 向后旋转键。 提供用户被提供的信息，其允许从系列中的稍后的键确定一系列键中的有限数量的先前的键。 至少部分地基于提供给用户的信息来生成系列中的关键。 该系列的关键是提供给用户。 用户通过将该信息应用于该系列中的密钥来确定该系列中有限数量的先前密钥中的至少一个密钥。
-
公开(公告)号：US20080126434A1
公开(公告)日：2008-05-29
申请号：US11498344
申请日：2006-08-03
申请人： Mustafa Uysal , Ram Swaminathan , Junwen Lai
发明人： Mustafa Uysal , Ram Swaminathan , Junwen Lai
IPC分类号： G06F17/30
CPC分类号： H04L67/1097 , G06F17/30233 , H04L69/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空间表示物理文件服务器上的物理文件。 对于客户端，虚拟文件服务器似乎是文件服务器。 对于物理文件服务器，虚拟文件服务器似乎是一个客户端。 连接目录允许虚拟文件服务器将物理上独立的目录组合为一体，并允许在物理文件服务器之间迁移对象，而不会由客户端感知。
-
公开(公告)号：US07043621B2
公开(公告)日：2006-05-09
申请号：US10439977
申请日：2003-05-15
IPC分类号： G06F12/00
CPC分类号： G06F3/0608 , G06F3/061 , G06F3/0629 , G06F3/0665 , G06F3/0683 , Y10S707/99953 , Y10S707/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个块的块中提供最小的不相似性。
-
-
-
-
-
-
-
-
-
搜索结果
62 条记录 (耗时 0.03 秒)
