About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISCA 1991
Conference paper
Chaos router: Architecture and performance
Abstract
The chaos router is an adaptive, randomized message router for multicomputers. Adaptive routers are superior to oblivious routers, the state-of-the-art, because they can bypass congestion and faults. The chaos router has reduced the complexity along the critical path of the routing decision by using randomization to eliminate livelock protection. The foundational theory for chaotic routing, proving that this approach is sound, has been previously developed by the authors (1990). The authors present the complete design of the router together with (simulated) performance figures. The results show that the chaos router is competitive with the simple and fast oblivious routers for random loads and greatly superior for loads with hot spots.