44 citations · 71 across the 21 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.NI2012
Livelock free routing schemes
Vance Faber
We give a livelock free routing algorithm for any allowed network. Unlike some other solutions to this problem: 1) packets entering the network have an absolute upper bound on the…
math.CO2012
Global sum on symmetric networks
Vance Faber
We are interested in the following problem we call global sum. Each processor starts with a single real value. At each time step, every directed edge in the graph can simultaneousl…