专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20140033214A1 MANAGING ARRAY COMPUTATIONS DURING PROGRAMMATIC RUN-TIME IN A DISTRIBUTED COMPUTING ENVIRONMENT 有权
标题翻译：在分布式计算环境中的程序运行期间管理阵列计算
公开(公告)号：US20140033214A1
公开(公告)日：2014-01-30
申请号：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
IPC分类号： G06F9/46
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.
摘要翻译：定义多个阵列分区以供程序运行时的一组任务使用。阵列分区可以从程序在运行时使用的一个或多个数组确定。分配多个计算设备中的每一个以执行该组任务中的一个或多个任务。通过分配多个计算设备中的每一个来执行一个或多个任务，可以实现减少多个计算设备之间的数据传输的目的。

2. 发明授权

US09015721B2 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
IPC分类号： G06F9/46 , G06F9/50
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.
摘要翻译：定义多个阵列分区以供程序运行时的一组任务使用。阵列分区可以从程序在运行时使用的一个或多个数组确定。分配多个计算设备中的每一个以执行该组任务中的一个或多个任务。通过分配多个计算设备中的每一个来执行一个或多个任务，可以实现减少多个计算设备之间的数据传输的目的。

3. 发明申请

US20140025415A1 DISTRIBUTED CONTINUOUS ANALYTICS 审中-公开
标题翻译：分布式连续分析
公开(公告)号：US20140025415A1
公开(公告)日：2014-01-23
申请号：US13554891
申请日：2012-07-20
申请人： Shivaram Venkataraman , Indrajit Roy , Mehul A. Shah , Robert Schreiber , Nathan Lorenzo Binkert
发明人： Shivaram Venkataraman , Indrajit Roy , Mehul A. Shah , Robert Schreiber , Nathan Lorenzo Binkert
IPC分类号： G06Q10/06
CPC分类号： G06Q10/06
摘要： A continuing analytics method includes distributing continuous analytics tasks among a number of workers. The workers execute the tasks on data elements stored in a distributed data storage system. Executing a task changes the data elements. In response to the change, a worker that executed a task invokes an update to the data storage system. The worker then increments a version number related to the changed data element, updates the data elements, and notifies other workers of the updated data element.
摘要翻译：持续的分析方法包括在多个工作人员之间分配连续的分析任务。工作人员对存储在分布式数据存储系统中的数据元素执行任务。执行任务会更改数据元素。响应于该更改，执行任务的工作人员调用对数据存储系统的更新。然后，工作人员增加与更改的数据元素相关的版本号，更新数据元素，并向其他工作人员通知更新的数据元素。

4. 发明授权

US09690679B2 Transaction commitment and replication in a storage system 有权
公开(公告)号：US09690679B2
公开(公告)日：2017-06-27
申请号：US13285884
申请日：2011-10-31
申请人： Mehul A. Shah , Wojciech Golab , Indrajit Roy , Nathan Lorenzo Binkert , Stavros Harizopoulos
发明人： Mehul A. Shah , Wojciech Golab , Indrajit Roy , Nathan Lorenzo Binkert , Stavros Harizopoulos
IPC分类号： G06F17/30 , G06F11/20 , G06F11/16 , G06F11/18 , G06Q10/10 , G06F11/14
CPC分类号： G06F11/2035 , G06F11/1425 , G06F11/1474 , G06F11/1658 , G06F11/1666 , G06F11/183 , G06F11/2023 , G06Q10/10
摘要： An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.

5. 发明申请

US20130110781A1 SERVER REPLICATION AND TRANSACTION COMMITMENT 审中-公开
标题翻译：服务器复制和交易承诺
公开(公告)号：US20130110781A1
公开(公告)日：2013-05-02
申请号：US13285755
申请日：2011-10-31
申请人： Wojciech Golab , Nathan Lorenzo Binkert , Indrajit Roy , Mehul A. Shah , Bruce Walker
发明人： Wojciech Golab , Nathan Lorenzo Binkert , Indrajit Roy , Mehul A. Shah , Bruce Walker
IPC分类号： G06F7/00
CPC分类号： G06F16/275
摘要： An embodiment provides a method for server replication and transaction commitment. The method includes receiving a transaction from a client node at one or more memory nodes, each memory node comprising a number of replicas, and determining, for each one of the replicas, whether the replica is able to commit the transaction. The method also includes sending a response from each of the replicas to a consensus node, wherein the consensus node is configured to record whether the response is a commit response. The method further includes committing the transaction if, at each memory node, a quorum of the replicas is able to commit the transaction, and aborting the transaction otherwise.
摘要翻译：实施例提供了用于服务器复制和事务承诺的方法。该方法包括从一个或多个存储器节点处的客户端节点接收事务，每个存储器节点包括多个副本，并且针对每个副本确定副本是否能够提交事务。该方法还包括将来自每个副本的响应发送到共享节点，其中，所述共享节点被配置为记录所述响应是否是提交响应。该方法还包括提交交易，如果在每个存储节点处，副本的法定人数能够提交交易，否则中止该交易。

6. 发明申请

US20130110774A1 TRANSACTION COMMITMENT AND REPLICATION IN A STORAGE SYSTEM 有权
标题翻译：存储系统中的交易承诺和复制
公开(公告)号：US20130110774A1
公开(公告)日：2013-05-02
申请号：US13285884
申请日：2011-10-31
申请人： Mehul A. Shah , Wojciech Golab , Indrajit Roy , Nathan Lorenzo Binkert , Stavros Harizopoulos
发明人： Mehul A. Shah , Wojciech Golab , Indrajit Roy , Nathan Lorenzo Binkert , Stavros Harizopoulos
IPC分类号： G06F7/00
CPC分类号： G06F11/2035 , G06F11/1425 , G06F11/1474 , G06F11/1658 , G06F11/1666 , G06F11/183 , G06F11/2023 , G06Q10/10
摘要： An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.
摘要翻译：一个实施例提供了用于事务承诺和复制的系统和方法。该方法包括从一个或多个存储器节点处的客户端节点接收最小的转移，其中每个存储器节点包括多个副本。 minitransaction是一种事务，它以原子方式执行读取，比较和写入任意多个内存位置的任何组合。该方法还包括针对内存节点内的副本的领导者，确定领导者是否能够使用协商一致的过程提交事务日志中的最小交易的最小交易和稳定状态变化来更新副本。该方法还包括：在每个存储节点处，复制品的法定人数能够稳定最小化交易，或者中止其中的小交易。

7. 发明申请

US20130111249A1 ACCESSING A LOCAL STORAGE DEVICE USING AN AUXILIARY PROCESSOR 审中-公开
标题翻译：使用辅助处理器访问本地存储设备
公开(公告)号：US20130111249A1
公开(公告)日：2013-05-02
申请号：US13810187
申请日：2010-07-21
申请人： Jichuan Chang , Parthasarathy Ranganathan , Mehul A. Shah
发明人： Jichuan Chang , Parthasarathy Ranganathan , Mehul A. Shah
IPC分类号： G06F1/32
CPC分类号： G06F1/3293 , G06F1/3206 , G06F9/5094 , Y02D10/122 , Y02D10/22
摘要： The present disclosure includes accessing a local storage device using an auxiliary processor An example computing device (100, 202, 303) includes a local storage device (110, 210, 310), a first processor (112, 212, 312) able to access the local storage device (110, 210, 310), an auxiliary processor (114, 220, 360) able to access the local storage device (110, 210, 310) while the first processor (112, 212, 312) is shut down, wherein the auxiliary processor (114, 220, 360) uses less power than the first processor (112, 212, 312), and a management agent (125, 225, 370) to initiate an accessing of the local storage device (110, 210, 310) by the auxiliary processor (114, 220, 360) if a load associated with the computing device (100, 202, 303) falls below a particular threshold. One of the first processor (112, 212, 312) and the auxiliary processor (114, 220, 360) is able to access the local storage device (110, 210, 310) at a time.
摘要翻译：本公开包括使用辅助处理器访问本地存储设备示例性计算设备（100,202,303）包括本地存储设备（110,210,310），能够访问的第一处理器（112,212,312）本地存储设备（110,210,310），当第一处理器（112,212,312）被关闭时能够访问本地存储设备（110,210,310）的辅助处理器（114,220,360），其中所述辅助处理器（114,220,360）使用比所述第一处理器（112,212,312）更少的功率，以及管理代理（125,225,370）来启动所述本地存储设备如果与计算设备（100,202,303）相关联的负载下降到特定阈值以下，则由辅助处理器（114,220,360）分配。第一处理器（112,212,312）和辅助处理器（114,220,360）中的一个能够一次访问本地存储设备（110,210,310）。

8. 发明申请

US20120131278A1 DATA STORAGE APPARATUS AND METHODS 有权
标题翻译：数据存储设备和方法
公开(公告)号：US20120131278A1
公开(公告)日：2012-05-24
申请号：US13387718
申请日：2011-03-07
申请人： Jichuan Chang , Parthasarathy Ranganathan , David Andrew Roberts , Mehul A. Shah , John Sontag
发明人： Jichuan Chang , Parthasarathy Ranganathan , David Andrew Roberts , Mehul A. Shah , John Sontag
IPC分类号： G06F12/08
CPC分类号： G06F12/0893 , G06F1/3268 , G06F12/0866 , G06F12/0888 , G06F12/0897 , G06F2212/1028 , G06F2212/214 , Y02D10/13 , Y02D10/154
摘要： Data storage apparatus and methods are disclosed. A disclosed example data storage apparatus comprises a cache layer and a processor in communication with the cache layer. The processor is to dynamically enable or disable the cache layer via a cache layer enable line based on a data store access type.
摘要翻译：公开了数据存储装置和方法。公开的示例性数据存储装置包括高速缓存层和与高速缓存层通信的处理器。处理器是通过基于数据存储访问类型的高速缓存层启用行来动态地启用或禁用高速缓存层。

9. 发明授权

US08924645B2 Data storage apparatus and methods 有权
标题翻译：数据存储装置及方法
公开(公告)号：US08924645B2
公开(公告)日：2014-12-30
申请号：US13387718
申请日：2011-03-07
申请人： Jichuan Chang , Parthasarathy Ranganathan , David Andrew Roberts , Mehul A. Shah , John Sontag
发明人： Jichuan Chang , Parthasarathy Ranganathan , David Andrew Roberts , Mehul A. Shah , John Sontag
IPC分类号： G06F12/00 , G06F12/08
CPC分类号： G06F12/0893 , G06F1/3268 , G06F12/0866 , G06F12/0888 , G06F12/0897 , G06F2212/1028 , G06F2212/214 , Y02D10/13 , Y02D10/154
摘要： Data storage apparatus and methods are disclosed. A disclosed example data storage apparatus comprises a cache layer and a processor in communication with the cache layer. The processor is to dynamically enable or disable the cache layer via a cache layer enable line based on a data store access type.
摘要翻译：公开了数据存储装置和方法。公开的示例性数据存储装置包括高速缓存层和与高速缓存层通信的处理器。处理器是通过基于数据存储访问类型的高速缓存层启用行来动态地启用或禁用高速缓存层。

10. 发明申请

US20130238576A1 VALIDATION OF DISTRIBUTED BALANCED TREES 有权
标题翻译：分布平衡条的验证
公开(公告)号：US20130238576A1
公开(公告)日：2013-09-12
申请号：US13416603
申请日：2012-03-09
申请人： Nathan L. Binkert , Wojciech Golab , Indrajit Roy , Mehul A. Shah , Benjamin A. Sowell
发明人： Nathan L. Binkert , Wojciech Golab , Indrajit Roy , Mehul A. Shah , Benjamin A. Sowell
IPC分类号： G06F7/00
CPC分类号： G06F17/30961
摘要： A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.
摘要翻译：访问分布在多个服务器上的多个节点的分布式平衡树被访问。检索与分布式平衡树的节点相关联的版本信息。在平衡树上执行的查找事务的有效性是通过仅针对检索到的版本信息检查在查找操作期间访问的叶节点的版本值来确定的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式