Transpose on vertex symmetric digraphs

TL;DR

This paper analyzes the efficiency of transpose operations on vertex symmetric networks, introducing a method to compare different schemes based on processor and wire costs for algorithm execution.

Contribution

It presents a novel method to evaluate transpose schemes on vertex symmetric networks using a cost function related to hardware resources.

Findings

Provides a comparison framework for transpose schemes

Introduces a cost-based efficiency measure

Facilitates optimization of network designs for transpose operations

Abstract

We discuss transpose (sometimes called universal exchange or all-to-all) on vertex symmetric networks. We provide a method to compare the efficiency of transpose schemes on two different networks with a cost function based on the number processors and wires needed to complete a given algorithm in a given time.