Routing Permutations on Graphs via Factors

@article{Barth1998RoutingPO,
  title={Routing Permutations on Graphs via Factors},
  author={Dominique Barth and Petrisor Panaite},
  journal={J. Parallel Distrib. Comput.},
  year={1998},
  volume={54},
  pages={162-182}
}
We deal with the permutation routing problem on graphs modeling interconnection networks. In our model, called routing via factors, at each routing step, the communication pattern is a directed 1-factor in a symmetric digraph. This adds a new feature, that of continuous packet movement, to preciously studied routing types, where the routing of a permutation is reduced to a sequence of permutations from a given class. We especially focus on bipartite graphs and we give sufficient conditions for… CONTINUE READING

Citations

Publications citing this paper.

Parametric Permutation Routing via Matchings

Nord. J. Comput. • 1998
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Routing permutations on graphs via factors, Rapport de recherche, No

D. Barth, P. Panaite
1066 L.R.I., Univ. de Paris-Sud, • 1996
View 12 Excerpts
Highly Influenced

Routing Permutations on Graphs Via Matchings

SIAM J. Discrete Math. • 1994
View 8 Excerpts
Highly Influenced

Hot-Potato Algorithms for Permutation Routing

IEEE Trans. Parallel Distrib. Syst. • 1995
View 1 Excerpt

Routing permutations on a graph

Networks • 1993
View 3 Excerpts

``Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes,'

F. T. Leighton
1992
View 2 Excerpts

Similar Papers

Loading similar papers…