ROUTING PROCESSOR AND ROUTING METHOD
    1.
    发明专利

    公开(公告)号:JP2003143198A

    公开(公告)日:2003-05-16

    申请号:JP2001325695

    申请日:2001-10-23

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide an efficient routing method for shortening a time required for routing. SOLUTION: In a branch B pointer, '11' is stored in a control area, '00010' is in a size storage area and a 'memory address A' is in an information storage area. The existence of a succeeding routing table is indicated by '11' of the control area. It is indicated that the number of branch pointers is 2 =4 in the routing table in a second stage being the succeeding one by '00010' of the size storage area. It is indicated that the number of bits to be referred to is two in a received network address by '00010' of the size storage area. The second and third bits from the highest-order of the network address are referred to in the second-stage of routing table.

    DRAM, AND REFRESHING METHOD FOR DRAM

    公开(公告)号:JP2002298574A

    公开(公告)日:2002-10-11

    申请号:JP2001095399

    申请日:2001-03-29

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide a DRAM and a refreshing method performing successively normal access and refreshing in one operation cycle of a SRAM. SOLUTION: A DRAM 10 comprises an execution instruction means instructing execution of refreshing, an address specifying means specifying a row address of a memory cell to be refreshed, and an execution means refreshing a memory cell of a row address specified by the address specifying means when execution of refreshing is instructed from the execution instruction means.

    SEARCH MEMORY, CONTROLLER FOR MEMORY SEARCH, AND MEMORY SEARCH METHOD

    公开(公告)号:JP2003256265A

    公开(公告)日:2003-09-10

    申请号:JP2002039940

    申请日:2002-02-18

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To search a large quantity of search targets (contents) at high speed. SOLUTION: A little circuits (a distributor 12 and a controller 13 for search) are added inside the memory. For a search, the algorithm of a quick search, for example, is utilized, memory cells are repeatedly read, the read results are compared and a compare target is narrowed down on the basis of the compared (sized) result. Valid data can be obtained approximately for the middle bus time and cycle time in the conventional case of repeatedly reading the memory. Since comparison and the generation of the address of the next memory cell can be performed in the latter half of the cycle time, the search can be completed just for the bus time of 'the number of times of repeated read of memory cells' + 'one time'. As a result, a CAM function capable of having not several hundreds to several thousands of entry data like a conventional CAM but the number of entry data dividing the size of a DRAM with the number of banks, namely, several tens of thousands of or more entry data can be achieved. COPYRIGHT: (C)2003,JPO

    SDRAM AND METHOD FOR ACCESSING SDRAM DATA

    公开(公告)号:JP2000195262A

    公开(公告)日:2000-07-14

    申请号:JP36984998

    申请日:1998-12-25

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To perform seamless access by specifying a bank to be accessed, specifying an address of the data to be accessed in the bank to be accessed, changing the bank specified with a bank specification means in a prescribed order and changing the address specified with an address specification means in the range of the prescribed number of data. SOLUTION: Respective banks are connected to a bank register 32 through an. address register 42 and a decoder 26, and the data of the address specified by the address register 42 of the bank specified by the bank register 32 are outputted. The addresses of the data to be accessed for every bank are stored in the address register 42, and further an increment counter 44 is connected to the address register 42. The increment counter 44 rewrites the information of the address register 42 to the next address of the accessed data, when the access to the data shown by the address register 42 is executed.

Patent Agency Ranking