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

1. 发明申请

US20100088520A1 PROTOCOL FOR DETERMINING AVAILABILITY OF PEERS IN A PEER-TO-PEER STORAGE SYSTEM 审中-公开
标题翻译：用于确定同行存储系统中对等方的可用性的协议
公开(公告)号：US20100088520A1
公开(公告)日：2010-04-08
申请号：US12244511
申请日：2008-10-02
申请人： Denis X. Charles , Siddhartha Puri
发明人： Denis X. Charles , Siddhartha Puri
IPC分类号： H04L9/28 , G06F15/16
CPC分类号： H04L67/104 , H04L63/0428 , H04L63/0807 , H04L63/126 , H04L67/108 , H04L67/1091
摘要： A method and system is provided for monitoring the availability of a peer in a P2P system that is used to provide remote storage or remote processing power. In one illustrative example, a recipient peer requests access to a service provisioned by another peer in a peer-to-peer network. The request may be a request to access a file or a file fragment that is being stored on the other peer. In order to make use of the accessed service, after receiving access to the service provisioned by the peer, the recipient peer needs to report to a central server that the service has been rendered. For instance, in some cases the file fragment accessed by the recipient peer may be encrypted, in which case the central server will send the recipient peer a decryption key after receiving the report that the service has been rendered.
摘要翻译：提供了一种用于监视P2P系统中用于提供远程存储或远程处理能力的对等体的可用性的方法和系统。在一个说明性示例中，接收者对等体请求对对等网络中由另一对等体提供的服务的访问。该请求可以是访问存储在另一个对等体上的文件或文件片段的请求。为了利用所访问的服务，在接收到由对等体提供的服务的访问之后，接收者对等体需要向中央服务器报告该服务已被呈现。例如，在某些情况下，接收者对等体访问的文件片段可能被加密，在这种情况下，中央服务器将在收到服务已呈现的报告之后向接收方对方发送解密密钥。

2. 发明授权

US07512957B2 Interface infrastructure for creating and interacting with web services 有权
标题翻译：用于创建和与Web服务交互的接口基础设施
公开(公告)号：US07512957B2
公开(公告)日：2009-03-31
申请号：US11003307
申请日：2004-12-03
申请人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
发明人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
IPC分类号： G06F3/00
CPC分类号： G06F9/547 , H04L67/02
摘要： A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
摘要翻译： Web服务命名空间涉及用于创建各种应用程序的基础架构。该基础设施为构建各种规模和复杂性的基于消息的应用程序提供了基础。基础架构或框架提供基本消息传递，安全消息传递，可靠消息传递和事务消息传递的API。在一些实施例中，相关联的API以平衡实用性，可用性，可扩展性和可版本性的方式考虑到命名空间的层级中。

3. 发明授权

US08533357B2 Mechanism for binding a structured data protocol to a protocol offering up byte streams 有权
标题翻译：将结构化数据协议绑定到提供字节流的协议的机制
公开(公告)号：US08533357B2
公开(公告)日：2013-09-10
申请号：US11003847
申请日：2004-12-03
申请人： Kenneth D. Wolf , Michael Steven Vernal , Christopher G. Kaler , Elliot Lee Waingold , Erik Bo Christensen , Jeffrey C. Schlimmer , Martin James Gudgin , Siddhartha Puri
发明人： Kenneth D. Wolf , Michael Steven Vernal , Christopher G. Kaler , Elliot Lee Waingold , Erik Bo Christensen , Jeffrey C. Schlimmer , Martin James Gudgin , Siddhartha Puri
IPC分类号： G06F15/16
CPC分类号： G06F17/2247 , G06F17/2258 , H04L67/02 , H04L69/08 , H04L69/329
摘要： A mechanism for sending structured data using a corresponding byte stream. Upon accessing structured data such as a Simple Object Access Protocol (SOAP) envelope, a byte stream is generated. The byte stream includes bytes that represent the structured data, as well as a collection of bytes that represents properties about the byte stream such as, for example, a mode of communication. The byte stream may then be passed to a communication module (e.g., a TCP or Named Pipes module) capable of receiving and transmitting the byte stream.
摘要翻译：一种使用对应的字节流发送结构化数据的机制。在访问诸如简单对象访问协议（SOAP）包络的结构化数据时，生成字节流。字节流包括表示结构化数据的字节，以及表示关于字节流的属性的字节集合，例如通信模式。然后可以将字节流传递到能够接收和发送字节流的通信模块（例如，TCP或命名管道模块）。

4. 发明申请

US20120089439A1 MARKET DESIGN FOR A RESOURCE EXCHANGE SYSTEM 有权
标题翻译：资源交换系统的市场设计
公开(公告)号：US20120089439A1
公开(公告)日：2012-04-12
申请号：US13329360
申请日：2011-12-19
申请人： Sven Seuken , Denis Xavier Charles , David Maxwell Chickering , Siddhartha Puri
发明人： Sven Seuken , Denis Xavier Charles , David Maxwell Chickering , Siddhartha Puri
IPC分类号： G06Q30/02
CPC分类号： G06Q30/08 , G06Q10/087 , G06Q30/0206 , G06Q30/0283 , G06Q30/0601 , G06Q40/12
摘要： Providing a market design for a peer-to-peer resource exchange system. Prices for a plurality of resources such as storage space, upload bandwidth, and download bandwidth are calculated and balanced based on previous resource prices, a supply of the resources, and a demand for the resources. Further, prices for operations such as storage and retrieval are determined such that a total of the payments to resource suppliers equals a total of the payments received from the resource consumers. In some embodiments, incoming data operation requests are allocated to the peers such that equilibrium among the peers is achieved.
摘要翻译：为对等资源交换系统提供市场设计。基于先前的资源价格，资源的供应以及对资源的需求，计算和平衡诸如存储空间，上传带宽和下载带宽等多种资源的价格。此外，存储和检索等操作的价格被确定为使得对资源供应商的总共支付等于从资源消费者收到的总额。在一些实施例中，输入数据操作请求被分配给对等体，从而实现对等体之间的平衡。

5. 发明申请

US20100228598A1 MARKET DESIGN FOR A RESOURCE EXCHANGE SYSTEM 有权
标题翻译：资源交换系统的市场设计
公开(公告)号：US20100228598A1
公开(公告)日：2010-09-09
申请号：US12399043
申请日：2009-03-06
申请人： Sven Seuken , Denis Xavier Charies , David Maxwell chickering , Siddhartha Puri
发明人： Sven Seuken , Denis Xavier Charies , David Maxwell chickering , Siddhartha Puri
IPC分类号： G06Q30/00 , G06Q10/00 , G06Q50/00 , G06F3/048
CPC分类号： G06Q30/08 , G06Q10/087 , G06Q30/0206 , G06Q30/0283 , G06Q30/0601 , G06Q40/12
摘要： Providing a market design for a peer-to-peer resource exchange system. Prices for a plurality of resources such as storage space, upload bandwidth, and download bandwidth are calculated and balanced based on previous resource prices, a supply of the resources, and a demand for the resources. Further, prices for operations such as storage and retrieval are determined such that a total of the payments to resource suppliers equals a total of the payments received from the resource consumers. In some embodiments, incoming data operation requests are allocated to the peers such that equilibrium among the peers is achieved.
摘要翻译：为对等资源交换系统提供市场设计。基于先前的资源价格，资源的供应以及对资源的需求，计算和平衡诸如存储空间，上传带宽和下载带宽等多种资源的价格。此外，存储和检索等操作的价格被确定为使得对资源供应商的总共支付等于从资源消费者收到的总额。在一些实施例中，输入数据操作请求被分配给对等体，从而实现对等体之间的平衡。

6. 发明授权

US07747070B2 Training convolutional neural networks on graphics processing units 有权
标题翻译：在图形处理单元上训练卷积神经网络
公开(公告)号：US07747070B2
公开(公告)日：2010-06-29
申请号：US11217711
申请日：2005-08-31
申请人： Siddhartha Puri
发明人： Siddhartha Puri
IPC分类号： G06K9/62 , G06F15/18 , G06E1/00 , G06E3/00 , G06G7/00 , G06N3/02
CPC分类号： G06K9/4628 , G06K2209/01 , G06N3/06 , G06N3/084
摘要： A convolutional neural network is implemented on a graphics processing unit. The network is then trained through a series of forward and backward passes, with convolutional kernels and bias matrices modified on each backward pass according to a gradient of an error function. The implementation takes advantage of parallel processing capabilities of pixel shader units on a GPU, and utilizes a set of start-to-finish formulas to program the computations on the pixel shaders. Input and output to the program is done through textures, and a multi-pass summation process is used when sums are needed across pixel shader unit registers.
摘要翻译：在图形处理单元上实现卷积神经网络。然后通过一系列前向和后向遍历来训练网络，根据误差函数的梯度，在每个后向遍历中修改卷积内核和偏置矩阵。该实现利用GPU上的像素着色器单元的并行处理能力，并利用一组从头到尾的公式来编程像素着色器上的计算。程序的输入和输出是通过纹理完成的，并且当跨像素着色器单元寄存器需要总和时，使用多遍求和处理。

7. 发明授权

US08108248B2 Market design for a resource exchange system 有权
标题翻译：资源交换系统的市场设计
公开(公告)号：US08108248B2
公开(公告)日：2012-01-31
申请号：US12399043
申请日：2009-03-06
申请人： Sven Seuken , Denis Xavier Charles , David Maxwell Chickering , Siddhartha Puri
发明人： Sven Seuken , Denis Xavier Charles , David Maxwell Chickering , Siddhartha Puri
IPC分类号： G06Q10/00
CPC分类号： G06Q30/08 , G06Q10/087 , G06Q30/0206 , G06Q30/0283 , G06Q30/0601 , G06Q40/12
摘要： Providing a market design for a peer-to-peer resource exchange system. Prices for a plurality of resources such as storage space, upload bandwidth, and download bandwidth are calculated and balanced based on previous resource prices, a supply of the resources, and a demand for the resources. Further, prices for operations such as storage and retrieval are determined such that a total of the payments to resource suppliers equals a total of the payments received from the resource consumers. In some embodiments, incoming data operation requests are allocated to the peers such that equilibrium among the peers is achieved.
摘要翻译：为对等资源交换系统提供市场设计。基于先前的资源价格，资源的供应以及对资源的需求，计算和平衡诸如存储空间，上传带宽和下载带宽等多种资源的价格。此外，存储和检索等操作的价格被确定为使得对资源供应商的总共支付等于从资源消费者收到的总额。在一些实施例中，输入数据操作请求被分配给对等体，从而实现对等体之间的平衡。

8. 发明申请

US20080250401A1 Tiling across loop nests with possible recomputation 有权
标题翻译：在可能的重新计算过程中平铺跨环巢
公开(公告)号：US20080250401A1
公开(公告)日：2008-10-09
申请号：US11784792
申请日：2007-04-09
申请人： Siddhartha Puri , Jaydeep P. Marathe
发明人： Siddhartha Puri , Jaydeep P. Marathe
IPC分类号： G06F9/45
CPC分类号： G06F8/4442 , G06F8/433
摘要： Described is a technology by which a series of loop nests corresponding to source code are detected by a compiler, with the series of loop nests tiled together, (thereby increasing the ratio of cache hits to misses in a multi-processor environment). The compiler transforms the series of loop nests into a plurality of tile loops within a controller loop, including using dependency analysis to determine which results from a tile loop need to be pre-computed before another tile loop. For dependency analysis, the compiler may use a directed acyclic graph as a high-level intermediate representation, and split the graph into sub-graphs each representing an array. The compiler uses descriptors processed from the graph to determine the controller loop and the tile loops within that controller loop.
摘要翻译：描述了一种通过编译器检测到与源代码相对应的一系列循环巢的技术，其中一系列循环嵌套平铺在一起（从而增加了多处理器环境中的高速缓存命中与未命中的比率）。编译器将一系列循环嵌套转换为控制器循环内的多个瓦片循环，包括使用依赖关系分析来确定来自瓦片循环的哪些结果需要在另一个瓦片循环之前预先计算。对于依赖关系分析，编译器可以使用有向无环图作为高级中间表示，并将图分解成各自表示数组的子图。编译器使用从图形处理的描述符来确定控制器循环和该控制器循环内的平铺循环。

9. 发明申请

US20070047802A1 Training convolutional neural networks on graphics processing units 有权
标题翻译：在图形处理单元上训练卷积神经网络
公开(公告)号：US20070047802A1
公开(公告)日：2007-03-01
申请号：US11217711
申请日：2005-08-31
申请人： Siddhartha Puri
发明人： Siddhartha Puri
IPC分类号： G06K9/62
CPC分类号： G06K9/4628 , G06K2209/01 , G06N3/06 , G06N3/084
摘要： A convolutional neural network is implemented on a graphics processing unit. The network is then trained through a series of forward and backward passes, with convolutional kernels and bias matrices modified on each backward pass according to a gradient of an error function. The implementation takes advantage of parallel processing capabilities of pixel shader units on a GPU, and utilizes a set of start-to-finish formulas to program the computations on the pixel shaders. Input and output to the program is done through textures, and a multi-pass summation process is used when sums are needed across pixel shader unit registers.
摘要翻译：在图形处理单元上实现卷积神经网络。然后通过一系列前向和后向遍历来训练网络，根据误差函数的梯度，在每个后向遍历中修改卷积内核和偏置矩阵。该实现利用GPU上的像素着色器单元的并行处理能力，并利用一组从头到尾的公式来编程像素着色器上的计算。程序的输入和输出是通过纹理完成的，并且当跨像素着色器单元寄存器需要总和时，使用多遍求和处理。

10. 发明申请

US20110029840A1 Erasure Coded Storage Aggregation in Data Centers 有权
标题翻译：擦除数据中心中的编码存储聚合
公开(公告)号：US20110029840A1
公开(公告)日：2011-02-03
申请号：US12534024
申请日：2009-07-31
申请人： Raymond E. Ozzie , John D. Mehr , Siddhartha Puri , Samuel J. McKelvie , Bradley Calder , Matt Pope
发明人： Raymond E. Ozzie , John D. Mehr , Siddhartha Puri , Samuel J. McKelvie , Bradley Calder , Matt Pope
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： G06F17/30144 , G06F11/1004 , G06F11/14 , G06F11/1458 , G06F11/1464 , H03M13/05 , H03M13/35
摘要： Embodiments of erasure coded storage aggregation are disclosed. The erasure coded storage aggregation includes storing a data file as erasure coded fragments in a plurality of nodes of one or more data centers. The erasure coded storage aggregation further includes monitoring an access frequency of the data file. Based on the comparison between the access frequency and a predetermined threshold, the data file is either reconstructed from the erasure coded fragments and stored in a storage node or retained as erasure coded fragments in the plurality of nodes of the one or more data centers.
摘要翻译：公开了擦除编码存储聚合的实施例。擦除编码存储聚合包括将数据文件作为擦除编码片段存储在一个或多个数据中心的多个节点中。擦除编码存储聚合还包括监视数据文件的访问频率。基于访问频率和预定阈值之间的比较，数据文件从擦除编码的片段重新构建并存储在存储节点中，或者作为擦除编码的片段保留在一个或多个数据中心的多个节点中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式