A Mapping Strategy for Parallel Processing
IEEE Transactions on Computers
IEEE Transactions on Computers
Hi-index | 0.00 |
Mapping one-measured ("line", "ring") and two-measured ("mesh", "torus") parallel program structures onto a distributed computer system (DCS) regular structures ("torus", "two-measured circulant", "hypercube") with faulty elements (processor nodes and links) is investigated. It is shown that: 1) one-measured program structures mapped better than two-measured structures; 2) when failures are injected to the DCS structure the one-measured structures mapping aggravated very lesser than the two-measured structures mapping. The smaller a node degree of a program graph and the greater a node degree of a DCS graph the better the mapping quality. Thus, the one-measured program structure's mappings are more fault-tolerant than two-measured structure's one and more preferable for organization of computations in the DCS with faulty elements.