Abstract
ROMM is a class of Randomized, Oblivious, Multi-phase, Minimal routing algorithms. Our conjecture is that ROMM routing offers a potential for improved performance compared to fully randomized algorithms under both light and heavy loads. Our conjecture is also that ROMM routing offers close to best case performance for many common permutations. These conjectures are supported by extensive simulations of binary cube networks for a number of routing patterns. We show that k×n buffers per node suffice to make k-phase ROMM routing free from deadlock and livelock on n-dimensional binary cubes.
Cite
CITATION STYLE
Nesson, T., & Johnsson, L. (1994). ROMM routing: A class of efficient minimal routing algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 853 LNCS, pp. 187–199). Springer Verlag. https://doi.org/10.1007/3-540-58429-3_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
