Mixed-Language Programming with XcalableMP
159
Fig. 9 Code in Python
4.3 Evaluation
To evaluate the performance of the Graph Golf application, we used the “coma”
system located in University of Tsukuba, the specifications of which are shown in
Table 4.
We measured the time required to calculate all of the shortest paths once by
changing the number of nodes. We assigned 20 XMP nodes to each compute node,
and used a medium-sized number of vertices and degrees (n = 9344, d = 10), as
shown in Table 3.
159
Fig. 9 Code in Python
4.3 Evaluation
To evaluate the performance of the Graph Golf application, we used the “coma”
system located in University of Tsukuba, the specifications of which are shown in
Table 4.
We measured the time required to calculate all of the shortest paths once by
changing the number of nodes. We assigned 20 XMP nodes to each compute node,
and used a medium-sized number of vertices and degrees (n = 9344, d = 10), as
shown in Table 3.