2000 character limit reached
Transpose on vertex symmetric digraphs (1407.0958v1)
Published 3 Jul 2014 in math.CO and cs.DS
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.