| 摘要 |
<p>A problem in a scale-free graph is that, as the size thereof becomes larger, the calculation time becomes longer even when parallel processing is used. The invention solves this problem, in a parallel computer system that executes a plurality of processes each being assigned a memory space, by placing the information of a first graph vertex and the information of a first graph vertex group connected to the first graph vertex in a first memory space assigned to a first process, placing the information of the first graph vertex and the information of a second graph vertex group connected to the first graph vertex in a second memory space assigned to a second process, and sharing the result of computation concerning the first graph vertex in the first process and the result of computation concerning the first graph vertex in the second process between the first process and the second process.</p> |
