-
公开(公告)号：US20060004897A1
公开(公告)日：2006-01-05
申请号：US11206422
申请日：2005-08-17
申请人： Paul Nadj , David Carr , Edward Funnekotter
发明人： Paul Nadj , David Carr , Edward Funnekotter
IPC分类号： G06F17/30
CPC分类号： G06F7/22 , Y10S707/99938 , Y10S707/99945
摘要： An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further described a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for fast, pipelined hardware implementations with increased throughput, making piles practical for a wide variety of new applications; they remove the requirement to track and update the last position in the heap; they reduce the number of memory reads accesses required during a delete operation; they require only ordinary, inexpensive RAM for storage in a fast, pipelined implementation; and they allow a random mixture of back-to-back insert, remove, and swap operations to be performed without stalling the pipeline.
摘要翻译： 通过修改被称为“堆”的公共域数据结构来提供改进的数据结构。 当应用这些改进时，所得到的数据结构被称为“堆”。 本发明进一步描述了桩的流水线硬件实现。 桩比堆叠提供许多优点：它们允许快速，流水线的硬件实现，增加吞吐量，使堆桩适用于各种新应用程序; 它们删除跟踪和更新堆中最后一个位置的要求; 它们减少了在删除操作期间所需的存储器读取访问次数; 它们只需要普通的便宜的RAM，用于以快速，流水线的方式存储; 并且它们允许随机混合背靠背插入，移除和交换操作，而不会使管道停顿。
-
公开(公告)号：US20060095444A1
公开(公告)日：2006-05-04
申请号：US11254156
申请日：2005-10-18
申请人： Paul Nadj , David Carr , Edward Funnekotter
发明人： Paul Nadj , David Carr , Edward Funnekotter
IPC分类号： G06F7/00
CPC分类号： G06F7/22 , G06F2207/222 , Y10S707/99937 , Y10S707/99945 , Y10S707/99952
摘要： An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further describes a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for fast, pipelined hardware implementations with increased throughput, making piles practical for a wide variety of new applications; they remove the requirement to track and update the last position in the heap; they reduce the number of memory reads accesses required during a delete operation; they require only ordinary, inexpensive RAM for storage in a fast, pipelined implementation; and they allow a random mixture of back-to-back insert, remove, and swap operations to be performed without stalling the pipeline.
-
公开(公告)号：US20070100920A1
公开(公告)日：2007-05-03
申请号：US11552849
申请日：2006-10-25
申请人： Edward Funnekotter , Jason Whelan , Jonathan Bosloy , Patrick Brodeur , Stephen Cadieux , Philippe-Andre Babkine , David Horton , Paul Kondrat
发明人： Edward Funnekotter , Jason Whelan , Jonathan Bosloy , Patrick Brodeur , Stephen Cadieux , Philippe-Andre Babkine , David Horton , Paul Kondrat
CPC分类号： G06F17/227 , G06F17/2247 , G06F17/2258 , G06F17/2264 , G06F17/272 , H04L67/02 , H04L67/327 , H04L69/22
摘要： A method and apparatus for converting documents from one format to another in a speed efficient way involves a hardware module which implements several operating pipeline stages which work in parallel. The transformations are supplied and decomposed into sequences of control units. The transformation of documents consists of applying control unit sequences to input documents. The control units are themselves executed by a set of dedicated hardware resources. Furthermore the pipeline is capable of operating on more than one document at a time. Fast document transformation is a key capability of document processing systems. The use of parallel processing techniques and hardware that implements highly specialized transformation resources make this invention particularly scalable for its use in large, high speed content networks.
摘要翻译： 用于以高速方式将文档从一种格式转换到另一种格式的方法和装置涉及一种硬件模块，其实现并行工作的若干操作流水线级。 转换被提供并分解成控制单元的序列。 文件的转换包括将控制单元序列应用于输入文档。 控制单元本身由一组专用硬件资源执行。 此外，管道一次可以在多个文档上操作。 快速文档转换是文档处理系统的关键功能。 使用并行处理技术和实现高度专业化的转换资源的硬件使本发明特别可扩展，可用于大型高速内容网络。
-
公开(公告)号：US20110191425A1
公开(公告)日：2011-08-04
申请号：US12698257
申请日：2010-02-02
申请人： Patrick Brodeur , Edward Funnekotter , Jason Whelan , Rlchard Dubuc , Hans Jespersen , Denis Junior King
发明人： Patrick Brodeur , Edward Funnekotter , Jason Whelan , Rlchard Dubuc , Hans Jespersen , Denis Junior King
摘要： Publishers inject messages containing geospatial data into a content routed network. The subscribers pre-register geospatial data defining an arbitrary geographic region of interest with their subscriptions. The messages are delivered to interested subscribers based on a comparison of the content data and the geospatial data contained in the messages with the corresponding data associated with said pre-registered subscriptions.
摘要翻译： 发布商将含有地理空间数据的消息注入到内容路由网络中。 订阅者预先注册定义任意地理区域的地理空间数据与其订阅。 基于将消息中包含的内容数据和地理空间数据与与所述预注册订阅相关联的相应数据进行比较，将消息发送给感兴趣的用户。
-
公开(公告)号：US20060059165A1
公开(公告)日：2006-03-16
申请号：US11224045
申请日：2005-09-13
IPC分类号： G06F17/30
CPC分类号： H04L49/355 , H04L67/327 , Y10S707/99936 , Y10S707/99942 , Y10S707/99945
摘要： A method of matching subscriptions to published documents in a content-routed network involves receiving subscription information, receiving published documents, storing the subscription information and the published documents in memory, instructing an accelerator of the locations in memory of the published documents, transferring portions of the stored published documents from the memory to the accelerator on an as-needed basis, providing the subscription information to the accelerator, and processing the portions in the accelerator to perform subscription matching in the accelerator independently of other functions in the content-router. The accelerator preferably includes a pipeline. In this way, efficiently highly scalable subscription matching can be performed efficiently on a very large number of subscriptions.
-
公开(公告)号：US07627570B2
公开(公告)日：2009-12-01
申请号：US11224045
申请日：2005-09-13
IPC分类号： G06F17/30
CPC分类号： H04L49/355 , H04L67/327 , Y10S707/99936 , Y10S707/99942 , Y10S707/99945
摘要： A method of matching subscriptions to published documents in a content-routed network involves receiving subscription information, receiving published documents, storing the subscription information and the published documents in memory, instructing an accelerator of the locations in memory of the published documents, transferring portions of the stored published documents from the memory to the accelerator on an as-needed basis, providing the subscription information to the accelerator, and processing the portions in the accelerator to perform subscription matching in the accelerator independently of other functions in the content-router. The accelerator preferably includes a pipeline. In this way, efficiently highly scalable subscription matching can be performed efficiently on a very large number of subscriptions.
摘要翻译： 在内容路由网络中匹配订阅与已发布文档的方法涉及接收订阅信息，接收已发布文档，将订阅信息和已发布文档存储在存储器中，指示加速器存储已发布文档的位置，传送部分 将所存储的已发布文档从存储器到加速器，根据需要向加速器提供订阅信息，以及处理加速器中的部分，以独立于内容路由器中的其他功能来执行加速器中的订阅匹配。 加速器优选地包括管道。 以这种方式，可以在非常大量的订阅上有效地执行高度可扩展的订阅匹配。
-
7.发明授权Method and system for rapid insertion of various data streams into sorted tree structures 失效将各种数据流快速插入分类树结构的方法和系统公开(公告)号：US07016904B1
公开(公告)日：2006-03-21
申请号：US09842387
申请日：2001-04-25
IPC分类号： G06F17/30
CPC分类号： G06F17/30961 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99952 , Y10S707/99953
摘要： The present invention provides the method and system that redistribute the nodes of a sorted tree to enable faster data insertion. Further, the tree typically contains a fixed number of levels, each comprising a fixed number of nodes. Each node in the tree is indexed and each leaf node may comprise a number of data segments. An increment is empirically calculated as space redistributed among non-empty leaf nodes. Furthermore, when a data segment is inserted and certain conditions are met, a data structure with a marked head and tail effectively “traverses” the tree from one end to the other searching for empty leaf nodes. In cases where the data structure encounters an empty leaf node, the data structure continues traversing unless empirically determined conditions stipulate that the process halts until the next data segment insertion before continuing. Moreover, in cases where the data structure encounters a non-empty leaf node, the contents of the node are copied from the head to the tail of the data structure. When the node has been copied, the data structure updates the tree to ensure that a lookup operation on the copied node remains valid and that the invariants of the tree hold before and after the redistribution. Furthermore, the contents in the head of the data structure are then deleted and the tail advanced to leave an increment amount of empty spaces in the traveling direction. The traversal process may then follow one of two possible paths of action: either continue traversing the tree or halt for the next data insertion before continuing.
摘要翻译： 本发明提供了重新分配排序树的节点以使更快的数据插入的方法和系统。 此外，树通常包含固定数量的级别，每个级别包括固定数量的节点。 索引树中的每个节点，并且每个叶节点可以包括多个数据段。 经验计算的增量是在非空叶节点之间重新分配的空间。 此外，当插入数据段并满足某些条件时，具有标记的头和尾的数据结构从一端有效地“遍历”树到另一端搜索空叶节点。 在数据结构遇到空叶节点的情况下，数据结构将继续遍历，除非经验确定的条件规定该过程在继续之前停止下一个数据段插入。 此外，在数据结构遇到非空叶节点的情况下，节点的内容从头到尾复制到数据结构的尾部。 当节点被复制时，数据结构更新树，以确保复制节点上的查找操作保持有效，并且重新分配之前和之后树的不变量保持不变。 此外，数据结构的头部的内容然后被删除，并且尾部前进以在行进方向上留下空白空间的增量。 然后，遍历过程可以遵循两个可能的动作路径之一：继续遍历树或停止下一次数据插入。
-
8.发明授权Ternary content addressable memory based multi-dimensional multi-way branch selector and method of operating same 失效三元内容可寻址存储器多维多路分支选择器及其操作方法公开(公告)号：US06988189B1
公开(公告)日：2006-01-17
申请号：US09703337
申请日：2000-10-31
CPC分类号： G06F9/30058 , G06F9/30021 , G06F9/3806 , G06F9/3844
摘要： An embodiment of the present invention described and shown in the specification and drawing is a Ternary Content Addressable Memory (TCAM) multi-dimensional multi-way branch selector. The embodiment that is disclosed includes a wide TCAM and a pre-TCAM multi-field multi-mode comparator for coupling to a microprocessor for performing multi-way branching decisions based on multi-dimensional comparisons. It is emphasized that this abstract is provided to comply with the rule requiring an abstract which will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
摘要翻译： 在说明书和附图中描述和示出的本发明的实施例是三元内容可寻址存储器（TCAM）多维多路分支选择器。 所公开的实施例包括宽TCAM和用于耦合到微处理器的前TCAM多场多模式比较器，用于基于多维比较执行多路分支决定。 要强调的是，该摘要被提供以符合要求抽象的规则，这将允许搜索者或其他读者快速确定技术公开内容的主题。 提交它的理解是，它不会用于解释或限制权利要求的范围或含义。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.02 秒)