| 摘要 |
PROBLEM TO BE SOLVED: To shorten a clustering processing time of graph data.SOLUTION: A clustering device executes processes of: selecting a set &Ggr; of adjacent nodes from input graph data; expanding data on N adjacent nodes selected from the set &Ggr; on an SIMD register; and calculating a clustering precision improvement quantity using an SIMD instruction for all the adjacent nodes included in the set &Ggr;. Here, N=[R/T] holds for an SIMD register size R of a control section and a size T of a data type of the graph data. |
