Data Input Algorithm for Image Processing in a Distributed Computer System

摘要

A parallel algorithm is presented for the input of data arrays (particularly, images) into a distributed computer system (CS). The algorithm minimizes the input time by efficiently routing the array fragments to the CS interconnection network. The algorithm modeling shows that it is optimal for the computer systems of the E_2-Graph (toroidal) and the D_2-graph (circulant) topologies. The time required for the input of an array is determined by the number N of the graph nodes and by the degree of the CS root node, which initially contains the input array, and does not depend on the graph type (toroidal or circulant) for N > 20.