Transpose on vertex symmetric digraphs
Combinatorics
2014-07-04 v1 Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1407.0958,
title = {Transpose on vertex symmetric digraphs},
author = {Vance Faber},
journal= {arXiv preprint arXiv:1407.0958},
year = {2014}
}
Comments
12 pages