Calculation method of simultaneous linear equations of sparse positive value symmetric matrix, equipment, program

摘要

PROBLEM TO BE SOLVED: To prevent memory access from being concentrated on the same memory storage area when operating parallel calculation for calculating a solution of the simultaneous linear equations of a sparse symmetric positive definite matrix.;SOLUTION: A branch node set detection unit 101 detects a set of branch nodes for each parallel level by searching an elimination tree from a route node. A memory allocation chain generation unit 102 respectively allocates different memory storage areas to subtrees in the same parallel levels and to a node group where there is high possibility that the subtrees are not configured, levels are close, and parallel calculations are operated. A task chain generation part 103 executes an arithmetic operation by selecting the node group, in which a plurality of threads are configured by subtree units, and executes an arithmetic operation by successively selecting the node, where the subtrees are not configured, from a leaf side, to generate an execution task chain. An LDL^T solution execution part 104 uses the memory storage area allocated to for every node thereof when executing the arithmetic operation of each node to the plurality of threads based on the task chain.;COPYRIGHT: (C)2011,JPO&INPIT