Abstract:
PROBLEM TO BE SOLVED: To provide a communication controller in which total processing time is shortened by decreasing the number of hierarchies and the number of nodes for the number of prefixes for mask in a tree structure pertaining to search information being used for determining next forwarding destination route of a received packet from the destination address thereof, and to provide a communication control method, a communication control program and a data structure for communication control. SOLUTION: Search information is made to correspond with a tree structure. Each prefix for mask is made to correspond with at least one entry where each entry includes information of mask length of the corresponding prefix for mask and a sort key and is assigned to any one node in the tree structure according to the sorting order. Each node is linked to a different node in a lower hierarchy by a branch based on the entry thereof. An extracting means 26 extracts the destination address of a received packet, and a searching means 27 searches an entry having information of a prefix most matching the extracted address at an objective node 28 indicated by a search control means 29. After ending search of each node, a routing means 30 determines the forwarding destination route of the received packet based on the longest one of the most matching prefixes at all current search object nodes. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To much more efficiently achieve data registration in a data table and data retrieval from the data table. SOLUTION: Data registration in a data table (3) in which the first item data are registered with the corresponding second item data and data retrieval from the data table is executed by using a first pointer table (1) in which a pointer to a portion of registered data in the data table is registered at a storage position shown by a hash value obtained by applying a first hash function (6) to the first item data of the registered data and a second pointer table (2) in which the pointer is registered at a storage position shown by a hash value obtained by applying a second hash function (22) to the first item data of the registered data. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To retrieve fixed length data such as MAC addresses to be stored in a data table in large bulk at high speed. SOLUTION: This fixed data retrieval device is provided with a hash operation means 11 for calculating and outputting a hash value of inputted fixed length data, a data table memory 14 consisting of N (N is an integer ≥2) memory banks and for storing the data table in which many pieces of fixed length data are held, a pointer table memory 13 for storing a memory pointer table in which memory addresses of storing destinations of each piece of fixed length data are held by using the hash value as an index and a comparison means 15 for simultaneously comparing a plurality of pieces of fixed length data stored in the same memory address of the N memory banks with one piece of fixed length data inputted in the hash operation means and for outputting a comparison result. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To allow each node processor of a geometry subsystem to operate without considering memory resources on the side of a raster subsystem by providing a texture memory and a texture memory managing means. SOLUTION: A merge processor 30 includes a texture list 30-1 for managing the contents of a texture memory 45 being the memory resource of a raster subsystem. When texture ID designated by a texture command outputted by each geometry node processor 20 is absent, the merge processor 30 issues an interruption request to a resource managing unit 35. The resource managing unit 35 downloads texture data corresponding to texture ID designated by the request to the texture memory 45. Texture memory is downloaded without regard to geometry processing.
Abstract:
PURPOSE: To cope with such a case as to plot many spheres and pipings at a high speed. CONSTITUTION: This device is provided with a texture memory 27 for storing the color information on the surface of an object and the depth information on the object, a read means for reading the chrominance information on the surface of the object and the depth information required for plotting the object in response to the reception of a command for plotting the object stored in the memory corresponding to specified size and position, and the chrominance information and the depth information when it is required. the processing means of magnification and reduction, etc., for performing magnification, reduction and depth change processing to the chrominance information on the surface of the object and the depth information on the object, a color processing for executing a processing for the chrominance information of the surface of the object for which the processing of the magnification and the reduction, etc., is performed and a hidden surface processing means for performing a hidden surface elimination processing for the surface of the object to be plotted from the chrominance information on the surface of the object, the depth information on the abject and the position specified by the command.