-
公开(公告)号：US20080069098A1
公开(公告)日：2008-03-20
申请号：US11522151
申请日：2006-09-15
IPC分类号： H04L12/56
CPC分类号： G06F9/546 , G06F9/544 , G06Q10/107 , H04L67/10
摘要： Provided is a system and method for directing group communication in a system environment that has a plurality of discrete application nodes networked with at least one discrete memory node, establishing a shared memory providing a passive message queue. A code library permits an application node member of a group to assemble a message selected from the group of send, join, leave, or read. The send, join and leave messages permit a first application node to add a message to the queue for all members of a group including the first application node at the time the message was added. The instruction set permitting the addition of the message is executed atomically.
摘要翻译： 提供了一种用于在具有与至少一个离散存储器节点联网的多个离散应用节点的系统环境中引导组通信的系统和方法，建立提供被动消息队列的共享存储器。 代码库允许组的应用程序节点成员组合从发送，连接，离开或读取组中选择的消息。 发送，加入和离开消息允许第一应用节点在添加消息时，向包括第一应用节点的组的所有成员向队列添加消息。 允许添加消息的指令集以原子方式执行。
-
公开(公告)号：US08296496B2
公开(公告)日：2012-10-23
申请号：US12561273
申请日：2009-09-17
申请人： Jeffrey Clifford Mogul , Eduardo Argollo de Oliveira Dias, Jr. , Paolo Faraboschi , Mehul A. Shah
发明人： Jeffrey Clifford Mogul , Eduardo Argollo de Oliveira Dias, Jr. , Paolo Faraboschi , Mehul A. Shah
IPC分类号： G06F12/00
CPC分类号： G06F12/023 , G06F12/06 , G06F12/0638 , G06F2212/205 , G06F2212/7203
摘要： One embodiment is main memory that includes a combination of non-volatile memory (NVM) and dynamic random access memory (DRAM). An operating system migrates data between the NVM and the DRAM.
摘要翻译： 一个实施例是包括非易失性存储器（NVM）和动态随机存取存储器（DRAM）的组合的主存储器。 操作系统在NVM和DRAM之间迁移数据。
-
33.发明授权Auditor assisted extraction and verification of client data returned from a storage provided while hiding client data from the auditor 有权审计员协助提取和验证从提供的存储返回的客户端数据，同时隐藏审核员的客户端数据公开(公告)号：US08281151B2
公开(公告)日：2012-10-02
申请号：US12243134
申请日：2008-10-01
申请人： Mehul A. Shah , Ram Swaminathan
发明人： Mehul A. Shah , Ram Swaminathan
IPC分类号： H04L29/06
CPC分类号： H04L9/0894 , H04L9/0822 , H04L9/0825 , H04L9/321 , H04L9/3218 , H04L9/3221 , H04L9/3242
摘要： Various approaches for extracting client's data from a storage provider are presented. In one approach, an auditor is initialized with a verification data set that confirms that an initial version of a data set stored by the storage provider is intact. The auditor extracts a second version of the data set from the storage provider; the second version hides information specified by the data set from the auditor. The auditor determines whether the second version matches the initial version. The second version is returned to the client if the initial version matches the second version. The auditor is prevented from recovering the information specified by the data set using the state information, and the client need not store any state information related to the initial and second versions needed to recover the information specified by the data set. If the initial version does not match the second version, the auditor outputs data indicative of data corruption.
摘要翻译： 介绍了从存储提供商提取客户端数据的各种方法。 在一种方法中，审核员被初始化为验证数据集，确认存储提供商存储的数据集的初始版本是完整的。 审核员从存储提供商提取数据集的第二版本; 第二个版本隐藏由审核员指定的数据集的信息。 审核员确定第二个版本是否与初始版本相匹配。 如果初始版本与第二个版本匹配，则第二个版本将返回给客户端。 防止审核员使用状态信息恢复由数据集指定的信息，并且客户端不需要存储与恢复由数据集指定的信息所需的初始和第二版本相关的任何状态信息。 如果初始版本与第二个版本不匹配，则审核员将输出指示数据损坏的数据。
-
34.发明授权Computer-implemented method for obtaining a minimum biclique cover in a bipartite dataset 有权用于在二分数据集中获得最小双面覆盖的计算机实现方法公开(公告)号：US08209742B2
公开(公告)日：2012-06-26
申请号：US12350130
申请日：2009-01-07
IPC分类号： H04L29/06
CPC分类号： G06F17/10
摘要： A method includes providing a bipartite graph having vertices of a first type, vertices of a second type, and a plurality of edges, wherein each edge joins a vertex of the first type with a vertex of the second type. A unipartite edge dual graph is generated from the bipartite graph, and a minimum clique partition of the edge dual graph is recursively determined. A biclique is then created in the bipartite graph corresponding to each clique in the minimum clique partition of the edge dual graph.
摘要翻译： 一种方法包括提供具有第一类型的顶点，第二类型的顶点和多个边缘的二分图，其中每个边缘将第一类型的顶点与第二类型的顶点相连接。 从二分图生成一个单边缘双图，并递归地确定边缘双图的最小分区。 然后在对应于边缘双图的最小集团分区中的每个团体的二分图中创建双面。
-
公开(公告)号：US20110066790A1
公开(公告)日：2011-03-17
申请号：US12561273
申请日：2009-09-17
申请人： Jeffrey Clifford Mogul , Eduardo Argollo de Oliveira Dias, JR. , Paolo Faraboschi , Mehul A. Shah
发明人： Jeffrey Clifford Mogul , Eduardo Argollo de Oliveira Dias, JR. , Paolo Faraboschi , Mehul A. Shah
CPC分类号： G06F12/023 , G06F12/06 , G06F12/0638 , G06F2212/205 , G06F2212/7203
摘要： One embodiment is main memory that includes a combination of non-volatile memory (NVM) and dynamic random access memory (DRAM). An operating system migrates data between the NVM and the DRAM.
摘要翻译： 一个实施例是包括非易失性存储器（NVM）和动态随机存取存储器（DRAM）的组合的主存储器。 操作系统在NVM和DRAM之间迁移数据。
-
公开(公告)号：US20100306212A1
公开(公告)日：2010-12-02
申请号：US12473065
申请日：2009-05-27
CPC分类号： G06F17/30498
摘要： A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join.
摘要翻译： 执行多个数据库关系的多路连接的方法包括执行具有数据库关系的多个流水线的双向连接。 每个双向连接都有两个连续的阶段。 在第一阶段，从非易失性存储器件取出评估特定于所述双向连接的连接标准所需的输入关系的缺失属性，并且根据该标准连接输入关系。 在第二阶段中，通过在开始多路连接之前执行的优化处理所指定的非易失性存储器设备，从输入关系的任何附加的缺失属性获取。
-
公开(公告)号：US20100080391A1
公开(公告)日：2010-04-01
申请号：US12240742
申请日：2008-09-29
CPC分类号： H04L9/0822 , G06F17/30371 , G06F21/64 , H04L9/0894 , H04L9/321 , H04L9/3221 , H04L9/3242 , H04L9/3271
摘要： Various approaches are described for auditing integrity of stored data. In one approach, a data set is provided from a client to a storage provider, and the data set is stored at a first storage arrangement by the storage provider. An auditor determines whether the data set stored at the first storage arrangement is corrupt without reliance on any part of the data set and any derivative of any part of the data set stored by the client. While the auditor is determining whether the data set stored at the first storage arrangement is corrupt, the auditor is prevented from being exposed to information specified by the data set. The auditor outputs data indicative of data corruption in response to determining that the data set stored at the first storage arrangement is corrupt.
摘要翻译： 描述了各种方法来审计存储数据的完整性。 在一种方法中，从客户端向存储提供者提供数据集，并且数据集由存储提供商存储在第一存储装置中。 审核员确定存储在第一存储装置中的数据集是否破坏而不依赖于数据集的任何部分以及由客户机存储的数据集的任何部分的任何导数。 虽然审核员正在确定存储在第一存储装置中的数据集是否损坏，但是防止了审核员暴露于由数据集指定的信息。 响应于确定存储在第一存储装置处的数据集已损坏，审计员输出指示数据损坏的数据。
-
38.发明授权公开(公告)号：US09405921B1
公开(公告)日：2016-08-02
申请号：US11888381
申请日：2007-07-31
IPC分类号： G06F21/62
CPC分类号： G06F21/6218 , G06F21/604 , G06F2221/2141
摘要： One embodiment relates to a computer-implemented method for role discovery in access control systems. User accounts are selected according to a predetermined algorithm. For each selected user account, a new role is created covering a set of permissions including all permissions which the user account needs but is not yet covered by another role that the user account has. The new role is given to the user account so that all permissions needed by the user account are covered. Any additional user accounts which still need the set of permissions covered by the new role are also found, and the new role is given to these additional user accounts, if any. Other features, aspects and embodiments are also disclosed.
摘要翻译： 一个实施例涉及用于访问控制系统中角色发现的计算机实现的方法。 根据预定算法选择用户账户。 对于每个选定的用户帐户，创建一个新角色，覆盖一组权限，包括用户帐户所需的所有权限，但尚未被用户帐户所具有的其他角色覆盖。 给用户帐户赋予新角色，以覆盖用户帐户所需的所有权限。 还会找到仍然需要新角色所涵盖的一组权限的任何其他用户帐户，并将新角色授予这些其他用户帐户（如果有）。 还公开了其它特征，方面和实施例。
-
公开(公告)号：US09146867B2
公开(公告)日：2015-09-29
申请号：US13285735
申请日：2011-10-31
CPC分类号： G06F12/0802 , G06F8/4442 , G06F12/1027 , G06F2212/502 , G06F2212/6024 , Y02D10/13
摘要： Example methods, apparatus, and articles of manufacture to access memory are disclosed. A disclosed example method involves receiving at least one runtime characteristic associated with accesses to contents of a memory page and dynamically adjusting a memory fetch width for accessing the memory page based on the at least one runtime characteristic.
摘要翻译： 公开了用于访问存储器的示例性方法，设备和制品。 所公开的示例性方法包括接收与对存储器页面的内容的访问相关联的至少一个运行时特性，并且基于至少一个运行时特性动态地调整用于访问存储器页面的存储器提取宽度。
-
40.发明授权Managing array computations during programmatic run-time in a distributed computing environment 有权在分布式计算环境中的编程运行期间管理数组计算公开(公告)号：US09015721B2
公开(公告)日：2015-04-21
申请号：US13562248
申请日：2012-07-30
申请人： Shivaram Venkataraman , Indrajit Roy , Mehul A. Shah , Robert Schreiber , Nathan Lorenzo Binkert , Parthasarathy Ranganathan
发明人： Shivaram Venkataraman , Indrajit Roy , Mehul A. Shah , Robert Schreiber , Nathan Lorenzo Binkert , Parthasarathy Ranganathan
CPC分类号： G06F9/5088 , G06F9/4881 , G06F9/5066
摘要： A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.
摘要翻译： 定义多个阵列分区以供程序运行时的一组任务使用。 阵列分区可以从程序在运行时使用的一个或多个数组确定。 分配多个计算设备中的每一个以执行该组任务中的一个或多个任务。 通过分配多个计算设备中的每一个来执行一个或多个任务，可以实现减少多个计算设备之间的数据传输的目的。
-
-
-
-
-
-
-
-
-
搜索结果
43 条记录 (耗时 0.022 秒)
