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

1. 发明授权

US07401132B1 Method and system for creating a peer-to-peer overlay network 有权
标题翻译：创建对等覆盖网络的方法和系统
公开(公告)号：US07401132B1
公开(公告)日：2008-07-15
申请号：US10327545
申请日：2002-12-20
申请人： Andrew Krumel , Paul L. Borrill , Paul Czarnik , Gregory L. Slaughter , John Muth , Girish Jorapurkar
发明人： Andrew Krumel , Paul L. Borrill , Paul Czarnik , Gregory L. Slaughter , John Muth , Girish Jorapurkar
IPC分类号： G06F15/16 , G06F15/173 , H04L12/28 , H04L12/56
CPC分类号： H04L67/104 , H04L29/06 , H04L45/02 , H04L45/12 , H04L45/42 , H04L67/1002 , H04L67/1008 , H04L67/101 , H04L67/1046 , H04L67/1055
摘要： A method and system for creating a peer-to-peer overlay network. The method includes discovering a set of node characteristics for each of a subset of existing nodes of a network. The method also includes scaling each of the discovered set of node characteristics to a value which is within a predetermined range of values. The method also includes generating a set of weighted values for each of the subset of nodes by applying a weighting function to each of the scaled values. In addition, the method includes generating a node rank value for each of the subset of nodes by summing the weighted values of each respective set of weighted values. Further, the method includes determining whether to connect to any of the subset of nodes based upon the node rank value.
摘要翻译：一种用于创建对等覆盖网络的方法和系统。该方法包括为网络的现有节点的子集中的每一个发现一组节点特征。该方法还包括将所发现的一组节点特征中的每一个缩放到预定值范围内的值。该方法还包括通过对每个缩放值应用加权函数来生成每个节点子集的一组加权值。此外，该方法包括通过对每个相应加权值集合的加权值相加来生成每个节点子集的节点等级值。此外，该方法包括基于节点等级值确定是否连接到节点的任何子集。

2. 发明申请

US20180241479A1 CLASSICAL IMPLEMENTATION OF ENTANGLEMENT 审中-公开
公开(公告)号：US20180241479A1
公开(公告)日：2018-08-23
申请号：US15959161
申请日：2018-04-20
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： H04B10/70 , H04L12/24
CPC分类号： H04B10/70 , H04L41/12
摘要： Computational nodes are connected to each other via multiple point to point communication ports to form a mesh network. When a node receives such a routing information, it will be a set of {Route ID, Forwarding Ports} pair, where the ports can be multiple targets including the node itself. When all the nodes within the routing path received such information, the mesh system can handle the packet transfer for the given Route ID. Each node looks up the table with Route ID and determines where to forward the packet.

3. 发明授权

US06918014B1 Dynamic distributed data system and method 失效
标题翻译：动态分布式数据系统及方法
公开(公告)号：US06918014B1
公开(公告)日：2005-07-12
申请号：US10679863
申请日：2003-10-06
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： G06F12/08 , G06F13/14
CPC分类号： G06F12/0813 , G06F12/0824 , G06F2212/272
摘要： A system and method for maintaining storage object consistency across a distributed storage network including a migratable repository of last resort which stores a last or only remaining data replica that may not be deleted. The method includes the steps of monitoring data requests to the repository of last resort, deciding whether to move the repository of last resort, and migrating the repository of last resort.
摘要翻译：一种用于在分布式存储网络中维护存储对象一致性的系统和方法，包括最后的手段的可迁移存储库，其存储可能不被删除的最后或仅剩余的数据副本。该方法包括以下步骤：监控最后访问库的数据请求，决定是否移动最后的存储库，以及迁移最后的存储库。

4. 发明申请

US20200175000A1 GENERALIZED REVERSIBILITY FRAMEWORK FOR COMMON KNOWLEDGE IN SCALE-OUT DATABASE SYSTEMS 审中-公开
公开(公告)号：US20200175000A1
公开(公告)日：2020-06-04
申请号：US16694054
申请日：2019-11-25
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： G06F16/23
摘要： A computer-implemented system with a processor provides a reversible transfer of an atomic token from one side of an imperfect link to the other, such that if the protocol (or process) on either side fails at a critical moment, the atomic token will be found on both sides to be verifiably incomplete, unless the protocol has completed successfully past its ‘irreversible threshold’ on both sides.

5. 发明授权

US5588131A System and method for a snooping and snarfing cache in a multiprocessor computer system 失效
标题翻译：在多处理器计算机系统中侦听和扼杀缓存的系统和方法
公开(公告)号：US5588131A
公开(公告)日：1996-12-24
申请号：US208170
申请日：1994-03-09
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： G06F12/08 , G06F13/00
CPC分类号： G06F12/0831
摘要： An improved multiprocessor computer system with an improved snarfing cache is disclosed. The multiprocessor system includes a main memory, I/O interface, and a plurality of processor nodes. Each processor node includes a CPU, and a cache. A shared interconnect couples the main memory, I/O interface, and the plurality of processor nodes. The snarfing cache of each processor node snarfs valid data that appears on the shared interconnect, regardless of whether the cache of the processor node has an invalid copy or no copy of the data. The net effect is that each processor node locally caches additional valid data, resulting in an expected improved cache hit rate, reduced processor latency, and fewer transactions on the shared interconnect.
摘要翻译：公开了一种改进的多处理器计算机系统，其具有改进的捕获缓存。多处理器系统包括主存储器，I / O接口和多个处理器节点。每个处理器节点包括CPU和高速缓存。共享互连耦合主存储器，I / O接口和多个处理器节点。每个处理器节点的斩波缓存都会清除出现在共享互连上的有效数据，而不管处理器节点的高速缓存是否具有无效的副本或数据副本。净效果是每个处理器节点本地缓存附加的有效数据，从而导致预期的改进的高速缓存命中率，减少的处理器延迟以及共享互连上的更少的事务。

6. 发明申请

US20190141016A1 CLASSICAL IMPLEMENTATION OF QUANTUM ENTANGLEMENT IN DATACENTER NETWORK DESIGN 审中-公开
公开(公告)号：US20190141016A1
公开(公告)日：2019-05-09
申请号：US16162632
申请日：2018-10-17
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： H04L29/06
摘要： Quantum mechanics provides several features useful for datacenter networking. The no cloning theorem, which states that it is impossible to mate a duplicate of an arbitrary, unknown quantum state, can be used to detect eavesdroppers. Entanglement allows two parties to have common knowledge of a shared state.These properties are being used today for quantum key exchange and quantum computing, but they are currently too expensive for general use. Fortunately, we can use classical mechanisms to get a close enough approximation of these quantum properties to solve some important problems in distributed computing.Nothing we describe here is quantum mechanical. Rather, we show that it is possible to use classical mechanisms to emulate some properties of quantum mechanics, which enable us to address interesting problems in distributed computing. The engineering insight, is that we can get closer to achieving these properties than might be expected through conventional thinking. The key to obtaining the properties we desire is to make the inherently asynchronous system temporarily locally synchronous tor the operations we need.In this patent, we describe how to classically emulate the parts of the no cloning theorem and entanglement that we need for datacenter networking. We then demonstrate how those approximations to quantum behavior can be used to solve important problems in distributed computing, such as ‘exactly-once’ semantics in an environment where failures occur and can be healed without applications needing to know.

7. 发明申请

US20090037451A1 Attack and Disaster Resilient Cellular Storage Systems and Methods 审中-公开
标题翻译：攻击和灾难恢复的蜂窝存储系统和方法
公开(公告)号：US20090037451A1
公开(公告)日：2009-02-05
申请号：US12162121
申请日：2007-01-24
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： G06F17/30
CPC分类号： H04L67/1095 , G06F16/184 , H04L41/0803 , H04L69/40
摘要： Systems, methods, and apparatus for providing data storage services storage using self-organizing replica management. In one embodiment, a cellular system operates storage objects, for example, data files, for clients. The system stores the storage objects as generally more than one substitutable replica, with each replica being stored on a separate cell. In some aspects, the system maintains multiple layers of overlapping trees and uses them for managing storage object replicas. In other aspects, a single self specializing substitutable cell performs dynamic specialization of itself in the system, while persistence is provided by the system as a whole. In other aspects, the system gives replicas special status while their storage object is being updated and returns them to a state of being fully substitutable after all changes have been successfully propagated to the replicas.
摘要翻译：使用自组织复制管理提供数据存储服务存储的系统，方法和装置。在一个实施例中，蜂窝系统为客户端操作存储对象，例如数据文件。系统将存储对象通常存储在多于一个可替换副本中，每个副本都存储在单独的单元上。在某些方面，系统维护多层重叠树，并使用它们来管理存储对象副本。在其他方面，单个自主专用可替换单元在系统中执行其自身的动态专业化，而整个系统提供持久性。在其他方面，系统会在存储对象被更新时给予副本特殊状态，并在所有更改成功传播到副本之后将其返回到完全可替换的状态。

8. 发明授权

US4362899A Printed circuit board 失效
标题翻译：印刷电路板
公开(公告)号：US4362899A
公开(公告)日：1982-12-07
申请号：US193109
申请日：1980-10-02
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： H05K1/02 , H05K9/00 , H01B11/08
CPC分类号： H05K1/0219 , H05K9/0039 , H05K2201/044 , H05K2201/09236
摘要： A three layer printed circuit board comprises upper and lower layers which provide terminal locations for connection to pins of electrical connectors or electronic components which are to be connected in parallel by conductor tracks of the circuit board. In order to achieve an even distribution of conductor tracks between the layers, only certain terminal locations are connected to respective conductor tracks, the locations of the respective layers being electrically connected by plated-through holes. A conductive layer providing a ground plane is located between the upper and lower layers and has non-conductive areas providing clearance for the plated-through holes. Shield tracks are located between the conductor tracks and are connected to the ground plane by plated-through holes so that they form closed conductive loops providing shielding against capacitative and inductive cross-talk between the conductor tracks.
摘要翻译：三层印刷电路板包括上层和下层，其提供用于连接到电连接器的引脚的端子位置或将由电路板的导体轨迹并联连接的电子部件。为了实现层之间的导体轨道的均匀分布，只有某些端子位置连接到相应的导体轨道，各层的位置通过电镀通孔电连接。提供接地平面的导电层位于上层和下层之间，并且具有提供用于电镀通孔的间隙的非导电区域。屏蔽轨道位于导体轨道之间，并且通过电镀通孔连接到接地平面，使得它们形成封闭的导电环路，从而提供对导体轨迹之间的电容和电感性串扰的屏蔽。

9. 发明公开

US20240291804A1 CLASSICAL IMPLEMENTATION OF QUANTUM ENTANGLEMENT IN DATACENTER NETWORK DESIGN 审中-公开
公开(公告)号：US20240291804A1
公开(公告)日：2024-08-29
申请号：US18462396
申请日：2023-09-06
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： H04L9/40 , H04L9/08
CPC分类号： H04L63/0414 , H04L9/0852 , H04L63/0428
摘要： Quantum mechanics provides several features useful for datacenter networking. The no cloning theorem, which states that it is impossible to mate a duplicate of an arbitrary, unknown quantum state, can be used to detect eavesdroppers. Entanglement allows two parties to have common knowledge of a shared state. These properties are being used today for quantum key exchange and quantum computing, but they are currently too expensive for general use. Fortunately, we can use classical mechanisms to get a close enough approximation of these quantum properties to solve some important problems in distributed computing. Nothing we describe here is quantum mechanical. Rather, we show that it is possible to use classical mechanisms to emulate some properties of quantum mechanics, which enable us to address interesting problems in distributed computing. The engineering insight, is that we can get closer to achieving these properties than might be expected through conventional thinking. The key to obtaining the properties we desire is to make the inherently asynchronous system temporarily locally synchronous tor the operations we need. In this patent, we describe how to classically emulate the parts of the no cloning theorem and entanglement that we need for datacenter networking. We then demonstrate how those approximations to quantum behavior can be used to solve important problems in distributed computing, such as ‘exactly-once’ semantics in an environment where failures occur and can be healed without applications needing to know.

10. 发明授权

US06631449B1 Dynamic distributed data system and method 有权
标题翻译：动态分布式数据系统及方法
公开(公告)号：US06631449B1
公开(公告)日：2003-10-07
申请号：US09972831
申请日：2001-10-05
申请人： Paul L. Borrill
发明人： Paul L. Borrill
IPC分类号： G06F1208
CPC分类号： G06F12/0813 , G06F12/0824 , G06F2212/272
摘要： A system and method for maintaining storage object consistency across a distributed storage network including a migratable repository of last resort which stores a last or only remaining data replica that may not be deleted. The method includes the steps of monitoring data requests to the repository of last resort, deciding whether to move the repository of last resort, and migrating the repository of last resort.
摘要翻译：一种用于在分布式存储网络中维护存储对象一致性的系统和方法，包括最后的手段的可迁移存储库，其存储可能不被删除的最后或仅剩余的数据副本。该方法包括以下步骤：监控最后访问库的数据请求，决定是否移动最后的存储库，以及迁移最后的存储库。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式