ROMM Routing: A Class of Efficient Minimal Routing Algorithms
1994 (English)Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
1994. 185-199 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-64555OAI: oai:DiVA.org:kth-64555DiVA: diva2:483125
IN PROC. PARALLEL COMPUTER ROUTING AND COMMUNICATION WORKSHOP
NR 201408052012-01-242012-01-24Bibliographically approved