-
公开(公告)号：US08307077B2
公开(公告)日：2012-11-06
申请号：US13197435
申请日：2011-08-03
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L65/403 , H04L65/80
摘要： The described implementations relate to collaborative speed determination in distributed systems. One method estimates upload speeds of a plurality of hosts. The method sends a first bandwidth probe from a first host to a second host. The method receives, at the first host, a second bandwidth probe sent from the second host. The method determines which of the first and second bandwidth probes was relatively slower. The method designates either of the first or second hosts that sent the relatively slower bandwidth probe as a loser and takes a speed of the bandwidth probe of the loser as a first estimate of the loser's upload speed.
摘要翻译： 所描述的实现涉及分布式系统中的协作速度确定。 一种方法估计多个主机的上传速度。 该方法将第一个带宽探测器从第一个主机发送到第二个主机。 该方法在第一主机处接收从第二主机发送的第二带宽探测器。 该方法确定第一和第二带宽探测器中哪一个相对较慢。 该方法指定发送相对较慢的带宽探测器作为输入者的第一或第二主机之一，并且将失败者的带宽探测器的速度作为失败者上传速度的第一估计。
-
公开(公告)号：US20110289232A1
公开(公告)日：2011-11-24
申请号：US13197435
申请日：2011-08-03
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L65/403 , H04L65/80
摘要： The described implementations relate to collaborative speed determination in distributed systems. One method estimates upload speeds of a plurality of hosts. The method sends a first bandwidth probe from a first host to a second host. The method receives, at the first host, a second bandwidth probe sent from the second host. The method determines which of the first and second bandwidth probes was relatively slower. The method designates either of the first or second hosts that sent the relatively slower bandwidth probe as a loser and takes a speed of the bandwidth probe of the loser as a first estimate of the loser's upload speed.
摘要翻译： 所描述的实现涉及分布式系统中的协作速度确定。 一种方法估计多个主机的上传速度。 该方法将第一个带宽探测器从第一个主机发送到第二个主机。 该方法在第一主机处接收从第二主机发送的第二带宽探测器。 该方法确定第一和第二带宽探测器中哪一个相对较慢。 该方法指定发送相对较慢的带宽探测器作为输入者的第一或第二主机之一，并且将失败者的带宽探测器的速度作为失败者上传速度的第一估计。
-
公开(公告)号：US08019862B2
公开(公告)日：2011-09-13
申请号：US12405246
申请日：2009-03-17
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L65/403 , H04L65/80
摘要： The described implementations relate to collaborative speed determination in distributed systems. One method estimates upload speeds of a plurality of hosts. The method sends a first bandwidth probe from a first host to a second host. The method receives, at the first host, a second bandwidth probe sent from the second host. The method determines which of the first and second bandwidth probes was relatively slower. The method designates either of the first or second hosts that sent the relatively slower bandwidth probe as a loser and takes a speed of the bandwidth probe of the loser as a first estimate of the loser's upload speed.
摘要翻译： 所描述的实现涉及分布式系统中的协作速度确定。 一种方法估计多个主机的上传速度。 该方法将第一个带宽探测器从第一个主机发送到第二个主机。 该方法在第一主机处接收从第二主机发送的第二带宽探测器。 该方法确定第一和第二带宽探测器中哪一个相对较慢。 该方法指定发送相对较慢的带宽探测器作为输入者的第一或第二主机之一，并且将失败者的带宽探测器的速度作为失败者上传速度的第一估计。
-
公开(公告)号：US20100241742A1
公开(公告)日：2010-09-23
申请号：US12405246
申请日：2009-03-17
IPC分类号： G06F15/173
CPC分类号： H04L67/104 , H04L65/403 , H04L65/80
摘要： The described implementations relate to collaborative speed determination in distributed systems. One method estimates upload speeds of a plurality of hosts. The method sends a first bandwidth probe from a first host to a second host. The method receives, at the first host, a second bandwidth probe sent from the second host. The method determines which of the first and second bandwidth probes was relatively slower. The method designates either of the first or second hosts that sent the relatively slower bandwidth probe as a loser and takes a speed of the bandwidth probe of the loser as a first estimate of the loser's upload speed.
摘要翻译： 所描述的实现涉及分布式系统中的协作速度确定。 一种方法估计多个主机的上传速度。 该方法将第一个带宽探测器从第一个主机发送到第二个主机。 该方法在第一主机处接收从第二主机发送的第二带宽探测器。 该方法确定第一和第二带宽探测器中哪一个相对较慢。 该方法指定发送相对较慢的带宽探测器作为输入者的第一或第二主机之一，并且将失败者的带宽探测器的速度作为失败者上传速度的第一估计。
-
公开(公告)号：US08943510B2
公开(公告)日：2015-01-27
申请号：US12971983
申请日：2010-12-17
申请人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
发明人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
CPC分类号： G06F9/526 , G06F11/1479 , G06F2201/825
摘要： Techniques for implementing mutual-exclusion algorithms that are also fault-resistant are described herein. For instance, this document describes systems that implement fault-resistant, mutual-exclusion algorithms that at least prevent simultaneous access of a shared resource by multiple threads when (i) one of the multiple threads is in its critical section, and (ii) the other thread(s) are waiting in a loop to enter their respective critical sections. In some instances, these algorithms are fault-tolerant to prevent simultaneous access of the shared resource regardless of a state of the multiple threads executing on the system. In some instances, these algorithms may resist (e.g., tolerate entirely) transient memory faults (or “soft errors”).
摘要翻译： 本文描述了用于实现也是故障抵抗的互斥算法的技术。 例如，本文档描述了实现防故障互斥算法的系统，当（i）多个线程中的一个处于其关键部分时，至少防止多个线程同时访问共享资源，以及（ii） 其他线程正在等待循环进入各自的关键部分。 在某些情况下，这些算法是容错的，以防止共享资源的同时访问，而不管系统上执行多个线程的状态如何。 在某些情况下，这些算法可以抵抗（例如，完全容忍）瞬态存储器故障（或“软错误”）。
-
公开(公告)号：US20110288934A1
公开(公告)日：2011-11-24
申请号：US12786231
申请日：2010-05-24
CPC分类号： G06Q30/0241 , G06Q30/0251 , G06Q30/0255 , G06Q30/0269
摘要： Techniques are described to mitigate ad stalking and other user concerns resulting from user-targeted advertising. A user may be informed of advertising information by a process in which an advertising server receives a request for an ad. The request may have been generated in response to a user request for a landing web page. An ad may be selected based on user information available to the advertising server, where the user information is associated with the user and describes behavior and/or attributes and/or preferences associated with the user. Text about how the ad was selected may be incorporated into the ad. Such text may describe the user information used to select the ad. The selection-disclosing text may be incorporated in the ad in a form that is displayable to the user by a browser. The ad may then be transmitted for display in the landing web page.
摘要翻译： 描述技术来减轻由用户定向广告产生的广告跟踪和其他用户关注的问题。 可以通过广告服务器接收到广告请求的处理来向用户通知广告信息。 请求可能是响应于用户对登陆网页的请求而产生的。 可以基于广告服务器可用的用户信息来选择广告，其中用户信息与用户相关联并且描述与用户相关联的行为和/或属性和/或偏好。 关于广告如何选择的文字可能会纳入广告。 这样的文本可以描述用于选择广告的用户信息。 选择公开的文本可以以浏览器向用户显示的形式并入广告中。 该广告然后可以被传输以在着陆网页中显示。
-
公开(公告)号：US20100318786A1
公开(公告)日：2010-12-16
申请号：US12483338
申请日：2009-06-12
IPC分类号： H04L29/06
CPC分类号： H04L63/123 , H04L9/3247 , H04L29/06 , H04L2209/127
摘要： Techniques for utilizing trusted hardware components for mitigating the effects of equivocation amongst participant computing devices of a distributed system are described herein. For instance, a distributed system employing a byzantine-fault-resilient protocol—that is, a protocol intended to mitigate (e.g., tolerate, detect, isolate, etc.) the effects of byzantine faults—may employ the techniques. To do so, the techniques may utilize a trusted hardware component comprising a non-decreasing counter and a key. This hardware component may be “trusted” in that the respective participant computing device cannot modify or observe the contents of the component in any manner other than according to the prescribed procedures, as described herein. Furthermore, the trusted hardware component may couple to the participant computing device in any suitable manner, such as via a universal serial bus (USB) connection or the like.
摘要翻译： 在此描述了利用可信硬件组件来减轻分布式系统的参与者计算设备之间的混淆效应的技术。 例如，采用拜占庭故障弹性协议的分布式系统 - 即旨在减轻（例如，容忍，检测，隔离等）拜占庭故障的影响的协议 - 可以采用这些技术。 为了这样做，这些技术可以利用包括非递减计数器和密钥的可信硬件组件。 该硬件组件可能是“可信赖的”，因为如本文所述，相应的参与者计算设备不能以除了根据规定的过程之外的任何方式修改或观察组件的内容。 此外，可信硬件组件可以以任何合适的方式，例如经由通用串行总线（USB）连接等耦合到参与者计算设备。
-
公开(公告)号：US09455992B2
公开(公告)日：2016-09-27
申请号：US12483338
申请日：2009-06-12
CPC分类号： H04L63/123 , H04L9/3247 , H04L29/06 , H04L2209/127
摘要： Techniques for utilizing trusted hardware components for mitigating the effects of equivocation amongst participant computing devices of a distributed system are described herein. For instance, a distributed system employing a byzantine-fault-resilient protocol—that is, a protocol intended to mitigate (e.g., tolerate, detect, isolate, etc.) the effects of byzantine faults—may employ the techniques. To do so, the techniques may utilize a trusted hardware component comprising a non-decreasing counter and a key. This hardware component may be “trusted” in that the respective participant computing device cannot modify or observe the contents of the component in any manner other than according to the prescribed procedures, as described herein. Furthermore, the trusted hardware component may couple to the participant computing device in any suitable manner, such as via a universal serial bus (USB) connection or the like.
摘要翻译： 在此描述了利用可信硬件组件来减轻分布式系统的参与者计算设备之间的混淆效应的技术。 例如，采用拜占庭故障弹性协议的分布式系统 - 即旨在减轻（例如，容忍，检测，隔离等）拜占庭故障的影响的协议 - 可以采用这些技术。 为了这样做，这些技术可以利用包括非递减计数器和密钥的可信硬件组件。 该硬件组件可能是“可信赖的”，因为如本文所述，相应的参与者计算设备不能以除了根据规定的过程之外的任何方式修改或观察组件的内容。 此外，可信硬件组件可以以任何合适的方式，例如经由通用串行总线（USB）连接等耦合到参与者计算设备。
-
公开(公告)号：US20080293474A1
公开(公告)日：2008-11-27
申请号：US11971541
申请日：2008-01-09
申请人： John R. Douceur , Thomas Moscibroda
发明人： John R. Douceur , Thomas Moscibroda
IPC分类号： A63F9/24
CPC分类号： G07F17/329 , G07F17/32
摘要： The described implementations relate to networked or distributed systems and more particularly to providing motivation for deployment of networked systems. One technique gathers a solicitation hierarchy in a distributed system. This technique also tracks contribution to the distributed system of participants within the hierarchy. This technique further probabilistically determines a participant as a lottery winner based at least in part on the solicitation hierarchy and the contribution.
摘要翻译： 所描述的实现涉及网络或分布式系统，并且更具体地涉及提供用于部署联网系统的动机。 一种技术在分布式系统中收集招标层次。 这种技术还追踪对层次结构中参与者的分布式系统的贡献。 该技术进一步概率地将参与者确定为至少部分基于招标层次和贡献的彩票获胜者。
-
公开(公告)号：US20120159504A1
公开(公告)日：2012-06-21
申请号：US12971983
申请日：2010-12-17
申请人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
发明人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
IPC分类号： G06F9/46
CPC分类号： G06F9/526 , G06F11/1479 , G06F2201/825
摘要： Techniques for implementing mutual-exclusion algorithms that are also fault-resistant are described herein. For instance, this document describes systems that implement fault-resistant, mutual-exclusion algorithms that at least prevent simultaneous access of a shared resource by multiple threads when (i) one of the multiple threads is in its critical section, and (ii) the other thread(s) are waiting in a loop to enter their respective critical sections. In some instances, these algorithms are fault-tolerant to prevent simultaneous access of the shared resource regardless of a state of the multiple threads executing on the system. In some instances, these algorithms may resist (e.g., tolerate entirely) transient memory faults (or “soft errors”).
摘要翻译： 本文描述了用于实现也是故障抵抗的互斥算法的技术。 例如，本文档描述了实现防故障互斥算法的系统，当（i）多个线程中的一个处于其关键部分时，至少防止多个线程同时访问共享资源，以及（ii） 其他线程正在等待循环进入各自的关键部分。 在某些情况下，这些算法是容错的，以防止共享资源的同时访问，而不管系统上执行多个线程的状态如何。 在某些情况下，这些算法可以抵抗（例如，完全容忍）瞬态存储器故障（或“软错误”）。
-
-
-
-
-
-
-
-
-
搜索结果
72 条记录 (耗时 0.024 秒)
