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

1. 发明授权

US06717942B1 Space-efficient source routing 失效
公开(公告)号：US06717942B1
公开(公告)日：2004-04-06
申请号：US09104478
申请日：1998-06-25
申请人： William J. Dally , P. Allen King , William F. Mann , Philip P. Carvey , Larry R. Dennison
发明人： William J. Dally , P. Allen King , William F. Mann , Philip P. Carvey , Larry R. Dennison
IPC分类号： H04L1256
CPC分类号： H04L45/00 , H04L45/34 , H04L69/22
摘要： The required length of a route descriptor in a source routing system is obtained by inserting an implied exit field, use of run-length encoding, and use of variable-length encoding. In the variable-length encoding, codes having lesser bits are reserved for preferred directions. Preferred direction may be encoded in the routing header, and it may be implied by the arrival port.

2. 发明授权

US07760747B2 Apparatus and method for packet scheduling 有权
标题翻译：用于分组调度的装置和方法
公开(公告)号：US07760747B2
公开(公告)日：2010-07-20
申请号：US11082335
申请日：2005-03-17
申请人： William J. Dally , Philip P. Carvey , Paul A. Beliveau , William F. Mann , Larry R. Dennison
发明人： William J. Dally , Philip P. Carvey , Paul A. Beliveau , William F. Mann , Larry R. Dennison
IPC分类号： H04L12/28
CPC分类号： H04L47/10 , H04L47/2416 , H04L47/2441 , H04L47/31 , H04L47/50 , H04L47/522 , H04L47/58
摘要： In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.
摘要翻译：在网络路由器中，使用树结构或排序网络来比较调度值，并从适当的队列中选择要转发的数据包。在树结构中，每个叶表示队列的调度值，并且结构的内部节点表示比较树结构的兄弟节点的调度值的获胜者。首先可以将CBR调度值进行比较以选择队列，并且如果来自CBR队列的传输不及时，则可以使用WFQ调度值来选择分组。更新调度值以反映先前分组中的可变分组长度和字节填充。调度可以在多个阶段执行。

3. 发明授权

US07668890B2 Prefix search circuitry and method 有权
标题翻译：前缀搜索电路和方法
公开(公告)号：US07668890B2
公开(公告)日：2010-02-23
申请号：US11582685
申请日：2006-10-18
申请人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
发明人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , G06F17/30887 , H04L45/14 , H04L45/7457 , Y10S707/959 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.
摘要翻译：在前缀搜索集成电路中执行前缀搜索引导互联网数据分组。集成电路包括搜索引擎的阵列，每个搜索引擎访问前缀搜索树数据结构以处理前缀搜索。 SDRAM专用于每个搜索引擎，并且SDRAM共享地址和控制引脚到IC芯片上的多个搜索引擎。树状数据结构的内部节点跨越SDRAM的块复制，以增加带宽，并且叶节点存储在SDRAM存储区以减少存储要求。在每个搜索引擎中，将存储在来自SDRAM的数据寄存器中的数据与存储在密钥寄存器中的前缀搜索键进行比较。基于该比较，计算地址以从SDRAM访问进一步的树结构数据。包含搜索关键字的分组描述符从输入队列转发到搜索引擎，并将搜索结果转发到输出队列，相同的分组顺序保持在两个队列中。

4. 发明授权

US06430527B1 Prefix search circuitry and method 有权
标题翻译：前缀搜索电路和方法
公开(公告)号：US06430527B1
公开(公告)日：2002-08-06
申请号：US09140030
申请日：1998-08-26
申请人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
发明人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
IPC分类号： G06F1730
CPC分类号： H04L45/00 , G06F17/30887 , H04L45/14 , H04L45/7457 , Y10S707/959 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRALMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.
摘要翻译：在前缀搜索集成电路中执行前缀搜索引导互联网数据分组。集成电路包括搜索引擎的阵列，每个搜索引擎访问前缀搜索树数据结构以处理前缀搜索。 SDRAM专用于每个搜索引擎，并且SDRAM共享地址和控制引脚到IC芯片上的多个搜索引擎。树状数据结构的内部节点在SDRALM的组中重复，以增加带宽，并且叶节点存储在SDRAM存储区以减少存储要求。在每个搜索引擎中，将存储在来自SDRAM的数据寄存器中的数据与存储在密钥寄存器中的前缀搜索键进行比较。基于该比较，计算地址以从SDRAM访问进一步的树结构数据。包含搜索关键字的分组描述符从输入队列转发到搜索引擎，并将搜索结果转发到输出队列，相同的分组顺序保持在两个队列中。

5. 发明授权

US06891834B1 Apparatus and method for packet scheduling 有权
公开(公告)号：US06891834B1
公开(公告)日：2005-05-10
申请号：US09588619
申请日：2000-06-06
申请人： William J. Dally , Philip P. Carvey , Paul A. Beliveau , William F. Mann , Larry R. Dennison
发明人： William J. Dally , Philip P. Carvey , Paul A. Beliveau , William F. Mann , Larry R. Dennison
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/2416 , H04L47/2441 , H04L47/31 , H04L47/50 , H04L47/522 , H04L47/58
摘要： In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.

6. 发明授权

US06522632B1 Apparatus and method for efficient prefix search 失效
标题翻译：用于高效前缀搜索的装置和方法
公开(公告)号：US06522632B1
公开(公告)日：2003-02-18
申请号：US09104314
申请日：1998-06-25
申请人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
发明人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
IPC分类号： H04J316
CPC分类号： G06F17/30887
摘要： A list of prefix keys, including enclosing prefix key pairs, are stored in leaves of a tree structure. In the leaf nodes, a prefix search key is compared to a set of prefix keys to identify a longest matching prefix. Each leaf node includes a single result pointer to a block of results and a single enclosing pointer to a result in a block of results for another node. Internal nodes which point to subsequent nodes include partitioning nodes and table nodes. In each partitioning node, a prefix search key is compared to a set of prefix keys which point to subsequent nodes through a common pointer and an index. Within each node, a middle prefix key is stored ahead of sets of high and low prefixes.
摘要翻译：包含前缀密钥对的前缀键列表存储在树结构的树叶中。在叶节点中，将前缀搜索键与一组前缀键进行比较，以识别最长匹配的前缀。每个叶节点包括一个结果指向一个结果块的单个结果指针和一个结果指向另一个节点的结果块的结果指针。指向后续节点的内部节点包括分区节点和表节点。在每个分区节点中，将前缀搜索关键字与通过公共指针和索引指向后续节点的一组前缀键进行比较。在每个节点中，中间前缀密钥存储在高和低前缀集之前。

7. 发明授权

US07130847B2 Prefix search method 有权
标题翻译：前缀搜索方式
公开(公告)号：US07130847B2
公开(公告)日：2006-10-31
申请号：US10628312
申请日：2003-07-28
申请人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
发明人： Gregory M. Waters , Larry R. Dennison , Philip P. Carvey , William J. Dally , William F. Mann
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , G06F17/30887 , H04L45/14 , H04L45/7457 , Y10S707/959 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.
摘要翻译：在前缀搜索集成电路中执行前缀搜索引导互联网数据分组。集成电路包括搜索引擎的阵列，每个搜索引擎访问前缀搜索树数据结构以处理前缀搜索。 SDRAM专用于每个搜索引擎，并且SDRAM共享地址和控制引脚到IC芯片上的多个搜索引擎。树状数据结构的内部节点跨越SDRAM的块复制，以增加带宽，并且叶节点存储在SDRAM存储区以减少存储要求。在每个搜索引擎中，将存储在来自SDRAM的数据寄存器中的数据与存储在密钥寄存器中的前缀搜索键进行比较。基于该比较，计算地址以从SDRAM访问进一步的树结构数据。包含搜索键的分组描述符从输入队列转发到搜索引擎，搜索结果被转发到输出队列，相同的分组顺序被保持在两个队列中。

8. 发明授权

US06598145B1 Irregular network 有权
公开(公告)号：US06598145B1
公开(公告)日：2003-07-22
申请号：US09249430
申请日：1999-02-12
申请人： William J. Dally , William F. Mann , Philip P. Carvey
发明人： William J. Dally , William F. Mann , Philip P. Carvey
IPC分类号： G06F1500
CPC分类号： G06F15/17337
摘要： Irregularities are provided in at least one dimension of a torus or mesh network for lower average path length and lower maximum channel load while increasing tolerance for omitted end-around connections. In preferred embodiments, all nodes supported on each backplane are connected in a single cycle which includes nodes on opposite sides of lower dimension tori. The cycles in adjacent backplanes hop different numbers of nodes.

9. 发明授权

US07043562B2 Irregular network 有权
公开(公告)号：US07043562B2
公开(公告)日：2006-05-09
申请号：US10457718
申请日：2003-06-09
申请人： William J. Dally , William F. Mann , Philip P. Carvey
发明人： William J. Dally , William F. Mann , Philip P. Carvey
IPC分类号： G06F15/173
CPC分类号： G06F15/17337
摘要： Irregularities are provided in at least one dimension of a torus or mesh network for lower average path length and lower maximum channel load while increasing tolerance for omitted end-around connections. In preferred embodiments, all nodes supported on each backplane are connected in a single cycle which includes nodes on opposite sides of lower dimension tori. The cycles in adjacent backplanes hop different numbers of nodes.

10. 发明授权

US5251308A Shared memory multiprocessor with data hiding and post-store 失效
标题翻译：具有数据隐藏和后期存储的共享内存多处理器
公开(公告)号：US5251308A
公开(公告)日：1993-10-05
申请号：US370287
申请日：1989-06-22
申请人： Steven J. Frank , Henry Burkhardt, III , James B. Rothnie , Benson I. Margulies , Frederick D. Weber , Linda Q. Lee , Glen Dudek , William F. Mann , Edward N. Kittlitz , Ruth Shelley
发明人： Steven J. Frank , Henry Burkhardt, III , James B. Rothnie , Benson I. Margulies , Frederick D. Weber , Linda Q. Lee , Glen Dudek , William F. Mann , Edward N. Kittlitz , Ruth Shelley
IPC分类号： G06F9/30 , G06F9/38 , G06F9/46 , G06F9/50 , G06F11/00 , G06F11/07 , G06F12/08 , G06F12/10 , G06F12/12 , G06F15/173 , H04L12/46 , H04L12/56 , G06F13/00
CPC分类号： G06F9/5016 , G06F11/004 , G06F11/0724 , G06F11/073 , G06F11/0772 , G06F12/0811 , G06F12/0817 , G06F12/10 , G06F15/17337 , G06F9/3005 , G06F9/383 , G06F9/3836 , G06F9/3851 , G06F9/3857 , G06F9/3865 , G06F9/468 , G06F9/52 , H04L12/4637 , H04L45/04 , G06F12/126 , G06F2212/272
摘要： A digital data processing system includes a plurality of central processor units which share and access a common memory through a memory management element. The memory management element permits, inter alia, data in the common memory to be accessed in at least two modes. In the first mode, all central processing units requesting access to a given datum residing in memory are signalled of the datum's existence. In the second mode, only selected central processing units requesting access to a resident datum are notified that it exists, while others requesting access to the datum are signalled that it does not exist. The common memory can include a plurality of independent memory elements, each coupled to and associated with, a respective one of the central processing units. A central processing unit can include a post-store element for effecting the transfer of copies of data stored in its associated memory element to a memory element associated with another central processing unit.
摘要翻译：数字数据处理系统包括通过存储器管理元件共享和访问公共存储器的多个中央处理器单元。存储器管理元件尤其允许以至少两种模式访问公共存储器中的数据。在第一模式中，所有请求访问存储在存储器中的给定数据的所有中央处理单元用信号表示基准存在。在第二模式中，只有请求访问驻留数据的所选择的中央处理单元被通知其存在，而请求访问基准的其他中央处理单元被发信号通知其不存在。公共存储器可以包括多个独立的存储器元件，每个独立的存储器元件耦合到相应的一个中央处理单元并与之相关联。中央处理单元可以包括用于实现将存储在其关联的存储器元件中的数据的副本传送到与另一中央处理单元相关联的存储元件的后存储元件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式