利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

18 条记录 (耗时 0.042 秒)

    Eliminating memory corruption when performing tree functions on multiple threads
    1.
    发明授权
    Eliminating memory corruption when performing tree functions on multiple threads 有权
    在多个线程上执行树函数时，消除内存损坏

    公开(公告)号：US07036125B2

    公开(公告)日：2006-04-25

    申请号：US10217529

    申请日：2002-08-13

    申请人： Claude Basso ,  Matthew William Kilpatrick Brown ,  Gordon Taylor Davis ,  Marco Heddes ,  Piyush Chunilal Patel ,  Grayson Warren Randall ,  Sonia Kiang Rovner ,  Colin Beaton Verrilli

    发明人： Claude Basso ,  Matthew William Kilpatrick Brown ,  Gordon Taylor Davis ,  Marco Heddes ,  Piyush Chunilal Patel ,  Grayson Warren Randall ,  Sonia Kiang Rovner ,  Colin Beaton Verrilli

    IPC分类号： G06F9/46 ,  G06F12/00

    CPC分类号： G06F9/52

    摘要： A method, system and computer program product for eliminating memory corruption when performing multi-threaded tree operations. A network processor may receive a command to perform a tree operation on a tree on one or more of multiple threads. Upon performing the requested tree operation, the network processor may lock one or more resources during a portion of the execution of the requested tree operation using one or more semaphores. A semaphore may refer to a flag used to indicate whether to “lock” or make available the resource associated with the semaphore. Locking may refer to preventing the resource from being available to other threads. Hence, by locking one or more resources during a portion of the tree operation, memory corruption may be eliminated in a multiple thread system while preventing these resources from being used by other threads for a minimal amount of time.

    摘要翻译： 一种用于在执行多线程树操作时消除内存损坏的方法，系统和计算机程序产品。 网络处理器可以在多个线程中的一个或多个上接收在树上执行树操作的命令。 在执行所请求的树操作时，网络处理器可以在使用一个或多个信号量的所请求的树操作的执行的一部分期间锁定一个或多个资源。 信号量可以指用于指示是否“锁定”或提供与信号量相关联的资源的标志。 锁定可能是指防止资源对其他线程可用。 因此，通过在树操作的一部分期间锁定一个或多个资源，可以在多线程系统中消除内存损坏，同时防止这些资源在最短时间内被其他线程使用。

    System and method and computer program for filtering using tree structure
    2.
    发明授权
    System and method and computer program for filtering using tree structure 失效
    使用树结构进行过滤的系统和方法以及计算机程序

    公开(公告)号：US06298340B1

    公开(公告)日：2001-10-02

    申请号：US09312148

    申请日：1999-05-14

    申请人： Jean Louis Calvignac ,  Everett Arthur Corl, Jr. ,  Anthony Matteo Gallo ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi ,  Colin Beaton Verrilli

    发明人： Jean Louis Calvignac ,  Everett Arthur Corl, Jr. ,  Anthony Matteo Gallo ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi ,  Colin Beaton Verrilli

    IPC分类号： G06F1730

    CPC分类号： G06F17/30961 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99943 ,  Y10S707/99944

    摘要： A classification system includes a software managed tree testing bits from a key which labels an item. The bits are chosen by application of the Choice Bit Algorithm to the Rules in a Database of Rules. A controller including logic parses an unknown Key for bits to be tested in the decision nodes of a binary tree. Tests dictated by the tree are conducted in a predetermined way until all but one Rule from the database or all but a few Rules from the database are eliminated from consideration, whereupon the Key is fully tested by the one remaining Rule or in a lattice constructed of the remaining plurality of Rules, to determine an action to enforce on the item. Certain compare tests are used in the binary tree for the case that otherwise identical or similar rules are applied to integer ranges of key values which do not fall upon power of 2 boundaries. Furthermore, some very frequently occurring rules in such final tests might be designated as secondary rules, the remaining rules designated as primary rules, the entire decision tree recalculated using only primary rules, and the primary rules then connected to secondary rules only when logically necessary by means of a system of pointers making use of relative priorities of rules.

    摘要翻译： 分类系统包括从标签项目的键的软件管理树测试位。 通过将选择位算法应用于规则数据库中的规则来选择位。 包含逻辑的控制器在二叉树的决策节点中解析要测试的位的未知密钥。 由树进行的测试以预定的方式进行，直到从数据库中除了一个规则之外的所有除了数据库中的所有规则或从数据库中除了少数几个规则之外的所有测试都被消除，由此Key被完整的一个规则或由 剩余的多个规则，以确定对该项目执行的操作。 在二叉树中使用某些比较测试，否则相同或相似的规则应用于不落在2边界的幂的关键值的整数范围。 此外，这些最终测试中的一些非常频繁出现的规则可能被指定为次要规则，剩余的规则被指定为主要规则，仅使用主要规则重新计算的整个决策树，然后仅在逻辑上必要时连接到次级规则的主要规则 使用指针的相对优先级的指针系统的手段。

    Full match (FM) search algorithm implementation for a network processor
    3.
    发明授权
    Full match (FM) search algorithm implementation for a network processor 失效
    网络处理器的完全匹配（FM）搜索算法实现

    公开(公告)号：US07139753B2

    公开(公告)日：2006-11-21

    申请号：US10650327

    申请日：2003-08-28

    申请人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Antonios Maragkos ,  Piyush Chunilal Patel ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    发明人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Antonios Maragkos ,  Piyush Chunilal Patel ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    IPC分类号： G06F7/00 ,  H04L12/28

    CPC分类号： H04L45/742 ,  H04L45/7453 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information. The length of the leaf is programmable, as is the length of the key. The leaf is stored in random access memory and is implemented as a single memory entry. If the key is located in the direct table then it is called a direct leaf.

    摘要翻译： 用于在搜索图案和存储在搜索树的叶中的模式之间找到完全匹配的新型数据结构，方法和装置。 键输入，对密钥执行哈希函数，访问直接表（DT），并通过模式搜索控制块（PSCB），树直到达到叶。 搜索机制使用一组可以位于几个寄存器和常规内存中的数据结构，然后用于构建可由相对简单的硬件宏操作的Patricia树结构。 检索所需的两个密钥和相应的信息都存储在Patricia树结构中。 散列函数提供密钥的比特到散列密钥的比特的n> n映射。 用于存储散列键和树中相关信息的数据结构称为叶。 每个叶对应于与输入键完全匹配的单个键。 叶包含关键以及其他信息。 叶片的长度是可编程的，密钥的长度也是可编程的。 叶存储在随机存取存储器中，并被实现为单个存储器条目。 如果键位于直接表中，则称为直接叶。

    METHOD TO SAVE BUS SWITCHING POWER AND REDUCE NOISE IN AN ENGINEERED BUS
    6.
    发明申请
    METHOD TO SAVE BUS SWITCHING POWER AND REDUCE NOISE IN AN ENGINEERED BUS 有权
    保存总线开关电源并减少工程总线噪声的方法

    公开(公告)号：US20080126666A1

    公开(公告)日：2008-05-29

    申请号：US11564563

    申请日：2006-11-29

    申请人： Piyush Chunilal Patel ,  Deepak K. Singh

    发明人： Piyush Chunilal Patel ,  Deepak K. Singh

    IPC分类号： G06F13/36

    CPC分类号： G06F1/3203 ,  G06F1/3253 ,  Y02D10/151

    摘要： A computer implemented method, bus switching system, and computer usable program code are provided for saving bus switching power and reducing noise. A request for data is received from a requester by a first cache. A determination is made as to whether the data is stored on the first cache. Responsive to determining that the data is stored on the first cache, a bus in a plurality of buses is identified on which to return the data forming an identified bus. The data is sent to the requester on the identified bus. A logical state is initiated on the remaining plurality of buses stemming from the first cache in order to save bus switching power and reducing noise.

    摘要翻译： 提供了计算机实现的方法，总线交换系统和计算机可用程序代码，用于节省总线开关功率并降低噪声。 通过第一高速缓存从请求者接收对数据的请求。 确定数据是否存储在第一高速缓存上。 响应于确定数据存储在第一高速缓存上，识别出多个总线中的总线，以在其上返回形成识别的总线的数据。 数据在所识别的总线上发送到请求者。 为了节省总线开关功率并降低噪声，起始于从第一高速缓冲存储器产生的剩余多个总线上的逻辑状态。

    Software management tree implementation for a network processor
    7.
    发明授权
    Software management tree implementation for a network processor 失效
    网络处理器的软件管理树实现

    公开(公告)号：US07107265B1

    公开(公告)日：2006-09-12

    申请号：US09545100

    申请日：2000-04-06

    申请人： Jean Louis Calvignac ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi

    发明人： Jean Louis Calvignac ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi

    IPC分类号： G06F17/30 ,  G06F15/00 ,  G06F9/44

    CPC分类号： H04L45/742 ,  G06F17/30961 ,  G06F17/30985 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99937

    摘要： Novel data structures, methods and apparatus for a Software Managed Tree (SMT) which provides a mechanism to create tree structures that follow a search mechanism defined by a control point processor. The search mechanism does not require storage on the previous pointer and uses only a forward pointer along with a next bit or group of bits to test thereby reducing storage space for nodes. The search mechanism processes multiple filter rules for an application without requiring multiple searches and also allows various filter rules to be chained. Two patterns of the same length are stored in each leaf to define a range compare. A compare at the end operation is either a compare under range or a compare under mask. In a compare under range, the input key is checked to determine if it is in the range defined by the two patterns. In a compare under mask, the bits in the input key are compared with the bits in a first leaf pattern under a mask specified in a second leaf pattern.

    摘要翻译： 用于软件管理树（SMT）的新型数据结构，方法和装置，其提供了一种机制，用于创建遵循由控制点处理器定义的搜索机制的树结构。 搜索机制不需要在前一个指针上存储，并且仅使用前向指针以及下一个位或一组位来进行测试，从而减少节点的存储空间。 搜索机制处理应用程序的多个过滤器规则，而不需要多次搜索，并且还允许链接各种过滤器规则。 在每个叶中存储相同长度的两个图案以定义范围比较。 在最终操作中的比较是在范围之下的比较或掩码下的比较。 在范围比较范围内，检查输入键以确定是否在两种模式定义的范围内。 在掩码下的比较中，将输入密钥中的比特与在第二叶图案中指定的掩码下的第一叶图案中的比特进行比较。