REORDERING DEVICE, REORDERING METHOD, AND REORDERING PROGRAM

摘要

PROBLEM TO BE SOLVED: To reorder adjacency matrixes of a large-scale graph.SOLUTION: An extraction unit 51 extracts clusters forming a hierarchical structure from a set of vertices of a graph representing a coupling state between a vertex and a vertex with an adjacency matrix, and a constitution unit 52 imparts successive vertex IDs to vertices in each extracted cluster and constitutes the adjacency matrix of the group using the vertex IDs. Consequently, following graph processing and memory access of SpMV are improved in locality by reordering with a high deletion rate of a matrix band width for the adjacency matrix of the large-scale graph, so a processing speed of analysis processing is improved.SELECTED DRAWING: Figure 1