Nesson, Ted

Johnsson, Lennart

KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)

1994 (English)Conference paper, Published paper (Refereed)

Abstract [en]

ROMM is a class of Randomized, Oblivious, Multi-phase, Minimal routing algorithms. ROMM routing offers a potential for improved performance compared to fully randomized algorithms under both light and heavy loads. ROMM routing also offers close to best case performance for many common permutations. These claims are supported by extensive simulations of binary cube networks for a number of routing patterns. We show that k \Theta n buffers per node suffice to make k--phase ROMM routing free from deadlock and livelock on n--dimensional binary cubes.