Change search
ReferencesLink to record
Permanent link

Direct link
ROMM Routing: A Class of Efficient Minimal Routing Algorithms
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1994 (English)Conference 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.

Place, publisher, year, edition, pages
1994. 185-199 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-64555OAI: diva2:483125
NR 20140805Available from: 2012-01-24 Created: 2012-01-24Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 8 hits
ReferencesLink to record
Permanent link

Direct link