8隣接格子網の性能評価

概要

論文の詳細を見る
Abstract　This paper deals with performance evaluation of an eight-neighbor mesh-connected processor array, in which each processor has eight links, that is degree 8. We obtain l0 performance measures for the array in two cases of without wraparounds and with wraparounds (that is a torus), and then compare with the four-neighbor mesh-connected processor array and the binary n-cube. As a results, we conclude that (1) the eight-neighbor mesh-connected processor array basically has properties as a lattice as well as the four-neighbor mesh-connected one, (2) the torus is superior to the binary n-cube if the number of processors is not so large, but it is inferior if the number of processors becomes large. A critical number exists between 128 and 256, (3) depending on performance measures, some properties of the array without wraparounds are better than ones of the four-neighbor mesh-connected array with wraparounds, but the others are worse.
山形大学の論文
1992-04-20