L. D. Aronson

Learn More
ÐThe performance analysis of dynamic routing algorithms in interconnection networks of parallel computers has thus far predominantly been done by simulation studies. A limitation of simulation studies is that they usually only hold for specific combinations of network, routing algorithm, and traffic pattern. In this paper, we derive saturation point results(More)
  • 1