公开(公告)号：GB2500553A

公开(公告)日：2013-09-25

申请号：GB201313026

申请日：2011-12-19

Applicant: IBM

Inventor： PORET MICHEL LOUIS RAYMOND ,  BASSO CLAUDE ,  CALVIGNAC JEAN L ,  CHANG CHIH-JEN ,  PHILIPPE DAMON ,  VAIDHYANATHAN NATARAJAN ,  VERRILLI COLIN ,  VERPLANKEN FABRICE JEAN

IPC: G06F5/10 ,  G06F13/12

Abstract: The invention provides a method for adding specific hardware on both receive and transmit sides that will hide to the software most of the effort related to buffer and pointers management. At initialization, a set of pointers and buffers is provided by software, in quantity large enough to support expected traffic. A Send Queue Replenisher (SQR) and Receive Queue Replenisher (RQR) hide RQ and SQ management to software. RQR and SQR fully monitor pointers queues and perform recirculation of pointers from transmit side to receive side.

公开(公告)号：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.