US 11,961,073 B2
Information processing device
Hirofumi Iwato, Tokyo (JP); and Takehiro Ogawa, Tokyo (JP)
Assigned to AXELL CORPORATION, Tokyo (JP)
Appl. No. 17/593,259
Filed by AXELL CORPORATION, Tokyo (JP)
PCT Filed Feb. 5, 2020, PCT No. PCT/JP2020/004345
§ 371(c)(1), (2) Date Sep. 14, 2021,
PCT Pub. No. WO2020/217640, PCT Pub. Date Oct. 29, 2020.
Claims priority of application No. 2019-086434 (JP), filed on Apr. 26, 2019.
Prior Publication US 2022/0156734 A1, May 19, 2022
Int. Cl. G06Q 20/38 (2012.01); G06N 7/01 (2023.01); G06Q 20/06 (2012.01); G06Q 20/22 (2012.01); G06Q 20/36 (2012.01); H04L 9/32 (2006.01); H04L 9/00 (2022.01)
CPC G06Q 20/3827 (2013.01) [G06N 7/01 (2023.01); G06Q 20/065 (2013.01); G06Q 20/223 (2013.01); G06Q 20/3678 (2013.01); G06Q 20/38215 (2013.01); H04L 9/3236 (2013.01); H04L 9/50 (2022.05); H04L 2209/56 (2013.01)] 6 Claims
OG exemplary drawing
 
1. An information processing device comprising:
a memory including a plurality of banks;
a plurality of hash computation circuits; and
an interconnect that respectively connects the banks in the memory and the hash computation circuits to each other, wherein
the hash computation circuits of even number are assigned to a first half of a number of the banks of the memory,
the hash computation circuits of odd number are assigned to a second half of a number of the banks of the memory,
in each of the hash computation circuits, a selector, in which counter values are input from a counter that counts up by 1 per cycle with all initial counter values set to different values, selects read requests that respectively specify a bank with a bank number equal to the counter values such that the read requests from each of the hash computation circuits for reading data from the memory respectively specify different banks in a same cycle,
a routing portion of the interconnect is set up so that arbitration of the read requests from each of the hash computation circuits does not occur by wire connection of butterfly connection,
the memory memorizes DAG data calculated beforehand therein, DAG indicating directed acyclic graph files of a large dataset,
the hash computation circuits each include a hash computation unit, a thread portion, a thread controller, an address-generation and bank-determination unit, FIFOs number of which is equal to number of the banks, a selector, and a counter,
the hash computation unit performs hash computation based on DAG data read from the memory,
the address-generation and bank-determination unit performs hash computation for input data based on a context of the thread portion to obtain a bank number of a bank and an address where DAG data to be accessed is stored, and stores each of the read requests in one of the FIFOs which has an equal number to the bank number,
the counter has a different initial value and outputs the count value obtained by performing a counting operation in synchronization to the selector, and
the selector determines the FIFO based on a counter value to be input thereto.