44 citations · 71 across the 21 of their papers we have counts for
4 papers · 1 filter
Transpose on vertex symmetric digraphs
Vance Faber
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 dif…
Network routing on regular directed graphs from spanning factorizations
Randall Dougherty, Vance Faber
Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, uni…
Automorphisms of the cycle prefix digraph
William Y. C. Chen, Vance Faber, Bingqing Li
Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix network…
Analysis of first order systems for the solution of Laplace's equation
Vance Faber
Kelner, Orecchia, Sidford, and Zhu have given a randomized iterative method for approximating the solution to the discrete Laplace equation that has expected running time nearly li…