-
公开(公告)号：GB2366426A
公开(公告)日：2002-03-06
申请号：GB0108828
申请日：2001-04-09
Applicant: IBM
Inventor： DAVIS GORDON TAYLOR , HEDDES MARCO C , LEAVENS ROSS BOYD , RINALDI MARK A
Abstract: A processor system comprises a core language processor 101, co-processors 107 - 111; each having special purpose, scalar 116 and array 117, registers; and an interface between the processors, where the interface maps the special purpose registers into a common address map. The system may be utilised as a protocol processor unit to provide instruction communication to a network, and the co-processors may compute CRC checksums, move data between local and main memories, search a tree structure, enqueue packets or assist in accessing the contents of registers. The interface may take the form of an execution interface 106 or a data interface 130.
-
公开(公告)号：GB2366426B
公开(公告)日：2004-11-17
申请号：GB0108828
申请日：2001-04-09
Applicant: IBM
Inventor： DAVIS GORDON TAYLOR , HEDDES MARCO C , LEAVENS ROSS BOYD , RINALDI MARK A
Abstract: A network processor utilizes protocol processor units (PPUs) to provide instruction communication for the network. Each PPU includes a core language processor (CLP). Each CLP contains general purpose registers and includes a coprocessor that contains scalar registers and array registers. The CLP controls and instructs a plurality of coprocessors that run in parallel with the CLP. Each coprocessor is a specialized hardware assist engine having direct access to the CLP registers and arrays through two sets of interface signals, a coprocessor execution interface and a coprocessor data interface.
-
公开(公告)号：GB2371381B
公开(公告)日：2004-09-01
申请号：GB0108545
申请日：2001-04-05
Applicant: IBM
Inventor： BASS BRIAN M , CALVIGNAC JEAN L , HEDDES MARCO C , MARAGKOS ANTONIOS , SIEGEL MICHAEL S , VERPLANKEN FABRICE J , PATEL PIYUSH , JEFFRIES CLARK D , RINALDI MARK A
IPC: G06F17/30 , H04L12/701 , H04L12/741 , H04L12/743
Abstract: A method of performing a search based upon a search criterion using a tree is proposed. In use an input is read as a search key and the most significant bits are used as an index to a search table representing a plurality of search nodes. Each non empty entry in the search table will contain a pointer to the next branch of the tree. The search table may use a hash function to generate an index key. A determination is then made if the pointer points to a leaf or branch of the tree. If the pointer is to a branch the procedure is repeated until a leaf object is identified and returned to the calling application. In no entry is found that matches the search a no match is returned. The search criterion may be a longest prefix match in which instance the method is executed to find the position of the distinguishing bit.
-
公开(公告)号：GB2371381A
公开(公告)日：2002-07-24
申请号：GB0108545
申请日：2001-04-05
Applicant: IBM
Inventor： BASS BRIAN M , CALVIGNAC JEAN L , HEDDES MARCO C , MARAGKOS ANTONIOS , SIEGEL MICHAEL S , VERPLANKEN FABRICE J , PATEL PIYUSH , JEFFRIES CLARK D , RINALDI MARK A
IPC: G06F17/30 , H04L12/701 , H04L12/741 , H04L12/743
Abstract: A method of performing a search based upon a search criterion using a tree is proposed. In use an input is read as a search key and the most significant bits are used as an index to a search table representing a plurality of search nodes. Each non empty entry in the search table will contain a pointer to the next branch of the tree. The search table may use a hash function to generate an index key. A determination is then made if the pointer points to a leaf or branch of the tree. If the pointer is to a branch the procedure is repeated until a leaf object is identified and returned to the calling application. In no entry is found that matches the search a no match is returned. The search criterion may be a longest prefix match in which instance the method is executed to find the position of the distinguishing bit.
-
-
-
Search Results
4
records
(took 0.016 seconds)
