| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To calculate a whole path from a starting point to an ending point by utilizing a function of a multicore CPU. <P>SOLUTION: The invention acquires a requirement including at least a starting point and an ending point and stores it to requirement storage means; adds a path from the starting point to a base point branch by using the starting point as a base point to path storage means; selects a point of a path, which is one of the paths between the starting point and the base point branch, faces to the ending point, and is not selected yet, from network information storage means for storing a network configuration and information on respective nodes in the network; generates as many threads as the branches of the selected points; adds a path of the points from the starting point to the generated threads to the path storage means; and stops, when a new branch is found, previous threads and repeats processing of deleting the stopped paths from the path storage means, to the ending point. <P>COPYRIGHT: (C)2012,JPO&INPIT</p> |
