公开(公告)号：US07664897B2

公开(公告)日：2010-02-16

申请号：US11293285

申请日：2005-12-01

Applicant: Earl T. Cohen ,  Donald Steiss ,  William Eatherton ,  John Williams, Jr. ,  John A. Fingerhut

Inventor： Earl T. Cohen ,  Donald Steiss ,  William Eatherton ,  John Williams, Jr. ,  John A. Fingerhut

IPC: G06F13/42 ,  G06F13/14 ,  G06F13/00 ,  H04L12/28

CPC classification number: H04L47/56 ,  H04L45/60 ,  H04L47/50

Abstract: A resource interconnect architecture and associated descriptor protocol provides more efficient communication between different resources in a data processing system. One embodiment uses a backdoor interconnect that allows some resources to communicate without using a central resource interconnect. Another embodiment uses nested descriptors that allow operations by different resources to be chained together without having to communicate back to an originating descriptor resource. In another embodiment, the descriptors are generated in hardware or in software. Other embodiments assign priority or privilege values to the descriptors that optimize processing and error handling performance.

Abstract translation: 资源互连架构和相关联的描述符协议在数据处理系统中的不同资源之间提供更有效的通信。 一个实施例使用允许一些资源进行通信而不使用中央资源互连的后门互连。 另一个实施例使用嵌套描述符，其允许不同资源的操作被链接在一起，而不必回传到始发描述符资源。 在另一个实施例中，描述符是以硬件或软件生成的。 其他实施例将优先级或特权值分配给优化处理和错误处理性能的描述符。

公开(公告)号：US20060179204A1

公开(公告)日：2006-08-10

申请号：US11293285

申请日：2005-12-01

Applicant: Earl Cohen ,  Donald Steiss ,  William Eatherton ,  John Williams ,  John Fingerhut

Inventor： Earl Cohen ,  Donald Steiss ,  William Eatherton ,  John Williams ,  John Fingerhut

IPC: G06F13/14 ,  G06F13/00

CPC classification number: H04L47/56 ,  H04L45/60 ,  H04L47/50

Abstract: A resource interconnect architecture and associated descriptor protocol provides more efficient communication between different resources in a data processing system. One embodiment uses a backdoor interconnect that allows some resources to communicate without using a central resource interconnect. Another embodiment uses nested descriptors that allow operations by different resources to be chained together without having to communicate back to an originating descriptor resource. In another embodiment, the descriptors are generated in hardware or in software. Other embodiments assign priority or privilege values to the descriptors that optimize processing and error handling performance.

Abstract translation: 资源互连架构和相关联的描述符协议在数据处理系统中的不同资源之间提供更有效的通信。 一个实施例使用允许一些资源进行通信而不使用中央资源互连的后门互连。 另一个实施例使用嵌套描述符，其允许不同资源的操作被链接在一起，而不必回传到始发描述符资源。 在另一个实施例中，描述符是以硬件或软件生成的。 其他实施例将优先级或特权值分配给优化处理和错误处理性能的描述符。

公开(公告)号：US20060106977A1

公开(公告)日：2006-05-18

申请号：US11321918

申请日：2005-12-28

Applicant: William Eatherton ,  Jaushin Lee ,  Bangalore Priyadarshan ,  Priyank Warkhede ,  Fusun Ertemalp ,  Hugh Holbrook ,  Dileep Devireddy ,  Bhushan Kanekar ,  Venkateshwar Pullela

Inventor： William Eatherton ,  Jaushin Lee ,  Bangalore Priyadarshan ,  Priyank Warkhede ,  Fusun Ertemalp ,  Hugh Holbrook ,  Dileep Devireddy ,  Bhushan Kanekar ,  Venkateshwar Pullela

IPC: G06F12/00

CPC classification number: G06F17/30982

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.

Abstract translation: 公开了用于使用关联存储器执行查找操作的方法和装置，包括但不限于基于修改映射修改关联存储器内的搜索关键字，响应于最高优先级的匹配条目来响应不受限制的条件，包括力 - 指示，在确定查找结果中选择各种组或存储器中的关联存储器条目，以及检测和传播错误条件。 在一个实现中，每个块从本地存储器检索修改映射，并且基于映射和接收到的修改数据修改接收到的搜索密钥。 在一个实现中，每个关联存储器条目包括用于指示条目上的成功匹配应该或不应该强制无命中结果的字段。 在一个实现中，从存储器检索在特定查找操作中使用的哪些关联存储器块或条目集合的指示。

公开(公告)号：US20050157712A1

公开(公告)日：2005-07-21

申请号：US10278623

申请日：2002-10-23

Applicant: Vijay Rangarajan ,  Dalit Sagi ,  William Eatherton

Inventor： Vijay Rangarajan ,  Dalit Sagi ,  William Eatherton

IPC: G06F17/30 ,  H04L12/56 ,  H04Q11/00

CPC classification number: H04L45/00 ,  G06F17/30961 ,  G06F17/30985 ,  H04L45/54 ,  H04L45/7457

Abstract: Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

Abstract translation: 公开了用于在确定最长前缀匹配中，例如在路由器，分组交换系统中生成和使用增强树位图数据结构的方法和装置。 一个实现组织树位图以最小化在查找操作期间必须访问的内部节点的数量。 在每个特里或搜索节点中都包含一个指针，以便在叶或结果数组中进行最佳匹配，从而允许直接访问该结果，而无需解析对应的内部节点。 此外，一个实现将特定级别的内部节点存储在其子阵列中的第一个元素。 另外，一个实现使用可以同时遍历多个树位图或其他数据结构的通用查找引擎，并且执行完整的搜索，部分搜索和恢复部分搜索，例如在接收到要搜索的附加数据之后。