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

121. 发明授权

US07430553B2 Managing states with delta pager 有权
标题翻译：用三角寻呼机管理状态
公开(公告)号：US07430553B2
公开(公告)日：2008-09-30
申请号：US11275434
申请日：2005-12-30
申请人： Jonathan R. Howell , John R. Douceur
发明人： Jonathan R. Howell , John R. Douceur
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , Y10S707/99938
摘要： A delta pager maintains a database with atomic, isolated transactions. When a transaction seeks to make changes to the database, the delta pager stores the changes in write buffers, and applies the changes when intervening transactions do not literally or substantively change the state of the database relied upon by the transaction. The delta pager applies the changes to commit the transaction by conjoining the write buffers with the current state of the database to form a new data structure representing the state of the database. The delta pager coalesces write buffers to maintain efficiency, subject to snapshots the delta pager respects to preserve selected states of the database. The delta pager makes selected sections of the database durable by moving selected data to a durable store. The delta pager also provides cache objects between the durable store and current transactions to promote efficient access to data.
摘要翻译：三角形寻呼机维护具有原子，隔离事务的数据库。当事务寻求对数据库进行更改时，增量寻呼机将更改存储在写入缓冲区中，并且当中间事务不会字面上或实质上更改事务依赖的数据库的状态时应用更改。三角寻呼机通过将写缓冲区与数据库的当前状态相结合来应用更改来提交事务，以形成表示数据库状态的新数据结构。 delta寻呼机合并写入缓冲区以保持效率，根据快照，差异传感器将保留数据库的所选状态。三角形寻呼机通过将选定的数据移动到耐用商店来使数据库的选定部分保持持久。三角形寻呼机还在耐用存储和当前事务之间提供缓存对象，以促进对数据的高效访问。

122. 发明授权

US07305468B2 Suspension and reinstatement of reference handles 有权
公开(公告)号：US07305468B2
公开(公告)日：2007-12-04
申请号：US10966520
申请日：2004-10-15
申请人： John R. Douceur , Yoram Bernet
发明人： John R. Douceur , Yoram Bernet
IPC分类号： G06F15/16
CPC分类号： G06F9/52
摘要： A handle administration system is described in which software agents receive handles to various resources that they can use to obtain the resources. The described embodiments provide multiple states that can be assumed by the handles. An unassigned state is provided in which handles are not assigned to a particular resource, nor can they be dereferenced to obtain pointers to any resources. An assigned state is provided in which handles are assigned to a particular resource and can be dereferenced to obtain a pointer to the resource. A suspended state is provided in which the handles are assigned to a particular resource but cannot be dereferenced to obtain a pointer to that resource. Advantageously, a suspended handle can be reinstated to assume the assigned state. In one embodiment, the handle system is implemented by incorporating a suitable field in a handle database that is used to indicate that a handle is suspended. In another embodiment, no additional fields are necessary. Rather, handle values in the handle database are manipulated to indicate that a handle has been suspended. These manipulations can be easily undone to reinstate a handle. In the described embodiment, a three state handle system can be advantageously employed to implement a two-phase commit operation.

123. 发明授权

US06381740B1 Method and system for incrementally improving a program layout 失效
标题翻译：逐步改进程序布局的方法和系统
公开(公告)号：US06381740B1
公开(公告)日：2002-04-30
申请号：US08931151
申请日：1997-09-16
申请人： John W. Miller , John R. Douceur , Robert P. Fitzgerald
发明人： John W. Miller , John R. Douceur , Robert P. Fitzgerald
IPC分类号： G06F900
CPC分类号： G06F8/445
摘要： A method and system for incrementally improving the layout of a program image of a computer program to reduce the working set. The system iteratively selects pairs of basic blocks and reorders the basic blocks in the range delimited by the selected pair of basic blocks. The system selects the pairs of basic blocks so that the working set of the computer program is improved by reordering the basic block in the range. Thus, during each iteration, the working set is improved. The system continues with these iterations until a termination condition (e.g., number of iterations) is satisfied. In one embodiment, during each iteration the system designates one of the basic blocks as an initial anchor basic block. The system then repeats the following until the same range of basic blocks is identified twice in a row. The system first finds a basic block such that when the basic blocks in the range from the anchor basic block to the found basic block are reordered, the working set is more favorable than reordering any other range that ends with the anchor basic block. The system then designates the found basic block as the new anchor basic block. When the same range is found twice in a row, the system reorders the basic blocks in the range. This process is repeated for each iteration until a termination condition is satisfied. The resulting reordered program image has its working set improved.
摘要翻译：一种用于逐步改进计算机程序的程序图像的布局以减少工作集合的方法和系统。系统迭代地选择一对基本块，并且在由所选择的一对基本块分隔的范围内重新排序基本块。系统选择基本块对，通过重新排序该范围内的基本块来提高计算机程序的工作集。因此，在每次迭代期间，改进了工作集。系统继续进行这些迭代，直到满足终止条件（例如，迭代次数）为止。在一个实施例中，在每次迭代期间，系统将基本块中的一个指定为初始锚基本块。然后，系统重复以下操作，直到相同范围的基本块被连续两次识别。系统首先找到一个基本块，使得当从锚基本块到找到的基本块的范围内的基本块被重新排序时，工作集比重新排序以锚基本块结束的任何其他范围更有利。然后，系统将找到的基本块指定为新的锚基本块。当连续两次找到相同的范围时，系统重新排列范围内的基本块。对于每个迭代重复该过程，直到满足终止条件。所产生的重新排序的程序图像的工作集改进了。

124. 发明授权

US6041053A Technique for efficiently classifying packets using a trie-indexed hierarchy forest that accommodates wildcards 失效
标题翻译：使用适合通配符的特里索引索引层次结构林来有效分类数据包的技术
公开(公告)号：US6041053A
公开(公告)日：2000-03-21
申请号：US933476
申请日：1997-09-18
申请人： John R. Douceur , Ofer Bar , Yoram Bernet
发明人： John R. Douceur , Ofer Bar , Yoram Bernet
IPC分类号： H04L12/56 , H04L12/28 , G06F15/16 , G06F17/30
CPC分类号： H04L47/2441 , H04L45/00 , H04L45/742 , H04L47/2408 , Y10S707/99933
摘要： A technique, specifically apparatus and accompanying methods, which utilizes a trie-indexed hierarchy forest ("rhizome") that accommodates wildcards for retrieving, given a specific input key, a pattern stored in the forest that is identical to or subsumes the key. The rhizome contains a binary search trie and a hierarchy forest. The search trie provides an indexed path to each unique, most specific, pattern stored in a lowest level of the hierarchy forest and also possibly to increasingly general patterns at higher levels in the pattern hierarchy. The hierarchy forest organizes the patterns into nodal hierarchies of strictly increasing generality. For use as a packet classifier, the rhizome stores wildcard-based packet classification patterns at separate corresponding pattern nodes, along with, corresponding "reference" fields associated therewith. Operationally, as each different queue is established or removed, a corresponding classification pattern is either inserted into or removed from the rhizome. A search key is formed for each packet, typically by concatenating classification fields, e.g. source and destination addresses and source and destination port designations, appearing in a header of the packet. The search key is then applied to the rhizome to determine whether that key exists therein, by virtue of either matching an identical classification pattern or being completely subsumed within a more general pattern stored therein. When such a classification is found, the classifier returns the contents of the associated reference field, which for scheduling, is a designation of a transmission queue to which the packet is to be directed.
摘要翻译：一种技术，具体是装置和伴随的方法，其利用特定索引层级林（“根茎”），其适应通配符，以在给定特定输入密钥的情况下检索与森林中存储的模式相同或包含密钥。根茎含有二分搜索特技和层级森林。搜索特技提供了存储在层次结构林的最低级别中的每个独特的，最具体的模式的索引路径，并且还可能在模式层次结构中的较高级别的日益普遍的模式。层次结构林将模式组织成具有严格增加的普遍性的节点等级。为了用作分组分类器，根茎在单独的相应模式节点上存储基于通配符的分组分类模式，以及与其相关联的相应“参考”字段。在操作上，随着每个不同的队列被建立或删除，相应的分类模式被插入或从根茎去除。通常通过连接分类字段来为每个分组形成搜索关键字，例如，源和目标地址以及出现在数据包标题中的源和目标端口名称。然后将搜索关键字应用于根茎，以通过匹配相同的分类模式或完全包含在其中存储的更一般的模式中来确定该密钥是否存在于其中。当发现这样的分类时，分类器返回相关联的参考字段的内容，其用于调度，是分组要被引导到的传输队列的指定。

125. 发明授权

US5907685A System and method for synchronizing clocks in distributed computer nodes 失效
标题翻译：用于在分布式计算机节点中同步时钟的系统和方法
公开(公告)号：US5907685A
公开(公告)日：1999-05-25
申请号：US511420
申请日：1995-08-04
申请人： John R. Douceur
发明人： John R. Douceur
IPC分类号： G04G7/00 , G06F1/14
CPC分类号： G06F1/14 , G04G7/00 , H04J3/0667
摘要： Described herein is a distributed computer system having a plurality of computer nodes arranged logically adjacent to each other in a communications ring. Each computer node receives communications from a preceding computer node and sends communications to a succeeding computer node. The computer nodes maintain individual local clocks with local time values c. The clocks are synchronized to each other through a sequence of distributed processing steps. The steps include a step of measuring an approximate local offset d of the local time value of each computer node relative to the local time value of a logically adjacent computer node in the communications ring. A subsequent step includes passing a plurality of collation variables from a lead computer node, through the computer nodes forming the communications ring, and back to the lead computer node in a single pass. The collation variables are processed at each computer node as they are passed around the communications ring. This processing is based at least in part on the measured approximate local offsets d at each computer node. The lead computer then calculates a difference m between its local time value and the mean of the local time values of all the computer nodes based upon the collation variables received back at the lead computer node after being passed around the communications ring. Based upon difference m, values are provided to the distributed computer nodes representing their offsets from the mean. Each computer node then adjusts the rate of its local clock to achieve synchronization. To prevent frequency runaway, each computer node updates its clock through a PLL which limits the amount of correction which can be applied to the local clock.
摘要翻译：这里描述了一种分布式计算机系统，其具有在通信环中彼此逻辑上相邻布置的多个计算机节点。每个计算机节点从前一个计算机节点接收通信，并将通信发送到后续的计算机节点。计算机节点维护具有本地时间值c的单独本地时钟。时钟通过一系列分布式处理步骤彼此同步。这些步骤包括测量每个计算机节点相对于通信环中逻辑上相邻的计算机节点的本地时间值的本地时间值的近似局部偏移量d的步骤。随后的步骤包括：通过形成通信环的计算机节点从引导计算机节点传递多个核对变量，并以一次通过返回到引导计算机节点。每个计算机节点处理整理变量，因为它们在通信环路上传播。该处理至少部分地基于每个计算机节点处的测量的近似局部偏移量d。然后，引导计算机基于在围绕通信环路传递之后在引导计算机节点处接收的对照变量，计算其本地时间值和所有计算机节点的本地时间值的平均值之间的差m。基于差异m，向分布式计算机节点提供表示它们与平均值的偏移量的值。然后，每个计算机节点调整其本地时钟的速率以实现同步。为了防止频率失控，每个计算机节点通过PLL更新其时钟，限制了可应用于本地时钟的校正量。

126. 发明授权

US5764645A IP/ATM network adaptation 失效
标题翻译： IP / ATM网络适配
公开(公告)号：US5764645A
公开(公告)日：1998-06-09
申请号：US662825
申请日：1996-06-12
申请人： Yoram Bernet , James C. Stewart , John R. Douceur
发明人： Yoram Bernet , James C. Stewart , John R. Douceur
IPC分类号： H04L12/24 , H04L12/56 , H04Q11/04
CPC分类号： H04L41/0893 , H04Q11/0478 , H04L2012/5626 , H04L2012/563 , H04L2012/5632 , H04L2012/5645 , H04L2012/5667
摘要： A digital communications network comprises a plurality of network hosts connected to communicate using an ATM network. Each network host uses policies (configured by the network administrator) to control an IP/ATM protocol layer. Based on these policies, the IP/ATM protocol layer classifies submitted IP packets and establishes and manages ATM connections having parameters appropriate for each class of traffic. By configuring the policies, the network administrator can tune the hosts to optimally use network resources. The resources of primary concern are available bandwidth and connection setup capacity. In the simplest case, the IP/ATM protocol layer classifies packets submitted from the IP network protocol as data traffic or control traffic based on packet size. Generally, large IP packets are classified as data traffic, while smaller IP packets are classified as control traffic. Data traffic is sent over the ATM network using ATM connections having relatively high bandwidths and relatively short time-outs. Control traffic is sent over the ATM network using ATM connections having relatively low bandwidths and relatively long time-outs.
摘要翻译：数字通信网络包括连接到使用ATM网络进行通信的多个网络主机。每个网络主机使用策略（由网络管理员配置）来控制IP / ATM协议层。基于这些策略，IP / ATM协议层对提交的IP分组进行分类，并建立和管理具有适合于每个流量类别的参数的ATM连接。通过配置策略，网络管理员可以调整主机以最佳地使用网络资源。主要关注的资源是可用带宽和连接设置能力。在最简单的情况下，IP / ATM协议层根据分组大小将从IP网络协议提交的分组分类为数据流量或控制流量。一般来说，大型IP数据包被分类为数据流量，较小的IP数据包被分类为控制流量。通过ATM网络使用具有相对较高带宽和相对较短超时的ATM连接来发送数据业务。通过ATM网络使用具有相对较低带宽和较长时间超时的ATM连接来发送控制业务。

127. 发明授权

US09588803B2 Executing native-code applications in a browser 有权
标题翻译：在浏览器中执行本地代码应用程序
公开(公告)号：US09588803B2
公开(公告)日：2017-03-07
申请号：US12463892
申请日：2009-05-11
申请人： Jonathan R. Howell , Jacob R. Lorch , Jeremy E. Elson , John R. Douceur
发明人： Jonathan R. Howell , Jacob R. Lorch , Jeremy E. Elson , John R. Douceur
IPC分类号： G06Q99/00 , G06F9/46 , G06Q20/12 , G06F21/53
CPC分类号： G06F21/53 , G06F8/60 , G06F9/468 , G06Q20/1235
摘要： Techniques for leveraging legacy code to deploy native-code desktop applications over a network (e.g., the Web) are described herein. These techniques include executing an application written in native code within a memory region that hardware of a computing device enforces. For instance, page-protection hardware (e.g., a memory management unit) or segmentation hardware may protect this region of memory in which the application executes. The techniques may also provide a narrow system call interface out of this memory region by dynamically enforcing system calls made by the application. Furthermore, these techniques may enable a browser of the computing device to function as an operating system for the native-code application. These techniques thus allow for execution of native-code applications on a browser of a computing device and, hence, over the Web in a resource-efficient manner and without sacrificing security of the computing device.
摘要翻译：本文描述了利用传统代码通过网络（例如，Web）来部署本地代码桌面应用程序的技术。这些技术包括执行在计算设备的硬件实施的存储器区域内以本地代码编写的应用程序。例如，页面保护硬件（例如，存储器管理单元）或分段硬件可以保护应用程序执行的存储器区域。这些技术还可以通过动态地执行由应用程序进行的系统调用来提供超出该存储器区域的窄系统调用接口。此外，这些技术可以使得计算设备的浏览器能够用作本地代码应用的操作系统。因此，这些技术允许在计算设备的浏览器上执行本地代码应用，并因此允许以资源有效的方式在Web上执行，而不会牺牲计算设备的安全性。

128. 发明授权

US09432401B2 Providing consistent security information 有权
标题翻译：提供一致的安全信息
公开(公告)号：US09432401B2
公开(公告)日：2016-08-30
申请号：US13542666
申请日：2012-07-06
申请人： John R. Douceur , Bryan Parno , Robert W. Reeder
发明人： John R. Douceur , Bryan Parno , Robert W. Reeder
IPC分类号： G06F11/00 , H04L29/06 , G06F21/51
CPC分类号： H04L63/1483 , G06F21/51 , G06F2221/2119
摘要： A method for providing consistent security information between multiple applications is described herein. The method includes detecting potentially deceptive content from a communication application in a browser application. The method also includes generating consistent security information for the potentially deceptive content with the browser application. Additionally, the method includes sending the consistent security information for the potentially deceptive content to the communication application. Furthermore, the method includes providing a warning based on the consistent security information to the communication application.
摘要翻译：这里描述了一种用于在多个应用之间提供一致的安全信息的方法。该方法包括从浏览器应用中的通信应用中检测潜在的欺骗性内容。该方法还包括使用浏览器应用为潜在的欺骗性内容生成一致的安全信息。此外，该方法包括向通信应用发送用于潜在欺骗性内容的一致的安全信息。此外，该方法包括基于一致的安全信息向通信应用提供警告。

129. 发明授权

US08943510B2 Mutual-exclusion algorithms resilient to transient memory faults 有权
标题翻译：相互排除算法对瞬态存储器故障有弹性
公开(公告)号：US08943510B2
公开(公告)日：2015-01-27
申请号：US12971983
申请日：2010-12-17
申请人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
发明人： Rotem Oshman , John R. Douceur , Thomas Moscibroda
IPC分类号： G06F9/46 , G06F9/52 , G06F11/14
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）其他线程正在等待循环进入各自的关键部分。在某些情况下，这些算法是容错的，以防止共享资源的同时访问，而不管系统上执行多个线程的状态如何。在某些情况下，这些算法可以抵抗（例如，完全容忍）瞬态存储器故障（或“软错误”）。

130. 发明授权

US08749585B2 Adding custom content to mapping applications 有权
标题翻译：向映射应用程序添加自定义内容
公开(公告)号：US08749585B2
公开(公告)日：2014-06-10
申请号：US11731032
申请日：2007-03-29
申请人： Keith Robert Kinnan , Chandrasekhar Thota , Jaya Bhatia , Jeremy Eric Elson , Jonathan R. Howell , Danyel Fisher , John R. Douceur , Duncan Murray Lawler
发明人： Keith Robert Kinnan , Chandrasekhar Thota , Jaya Bhatia , Jeremy Eric Elson , Jonathan R. Howell , Danyel Fisher , John R. Douceur , Duncan Murray Lawler
IPC分类号： G09G5/00
CPC分类号： G06T17/05 , G06F17/30241 , G06T15/04 , G06T15/20 , G06T19/20 , G06T2200/04 , G06T2207/30184 , G06T2210/04 , G09B29/007
摘要： Digital maps can be composed of a series of image tiles that are selected based on the context of the map to be presented. Independently hosted tiles can comprise additional details that can be added to the map. A manifest can be created that describes the layers of map details composed of such independently hosted tiles. Externally referable mechanisms can, based on the manifest and map context, select tiles, from among the independently hosted tiles, that correspond to map tiles being displayed to a user. Subsequently, the mechanisms can instruct a browser, as specified in the manifest, to combine the map tiles and the independently hosted tiles to generate a more detailed map. Alternatively, customized mechanisms can generate map detail tiles in real-time, based on an exported map context. Also, controls instantiated by the browser can render three-dimensional images based on the combined map tiles.
摘要翻译：数字地图可以由根据要呈现的地图的上下文选择的一系列图像块组成。独立托管的图块可以包含可以添加到地图的其他细节。可以创建一个清单，描述由这些独立托管的图块组成的地图细节层。外部可引用机制可以基于清单和地图上下文，从独立托管的瓦片中选择与显示给用户的地图瓦片对应的瓦片。随后，机构可以指示清单中指定的浏览器来组合地图瓦片和独立托管的瓦片以生成更详细的地图。或者，定制机制可以基于导出的地图上下文来实时生成地图细节瓦片。此外，由浏览器实例化的控件可以基于组合的地图图块来呈现三维图像。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式