Reduction operations on a distributed memory machine with a reconfigurable interconnection network

Reduction operations as applied to distributed memory machines with reconfigurable interconnection networks are analyzed. A proposed method for implementing these operations assumes that the interconnection network is tree-based and every node transmits reduction results to the parent node. The best interconnection topology is derived as an indicator of processor quantity and machine-dependent parameters. Experimental results conform well with theoretical predictions.