Chaos router

Abstract

The Chaos router is an adaptive, randomized message router for multlicomputers.

Segmented Buffer for NOC Router

“…Dynamically allocated buffer structured was proposed in [11]. DAMQ with self compacting buffers [12], FCCB [13], VC allocation on traffic condition [14], Chaos router [15], BLAM routing algorithm [16], Geyser 1 [17] are also discussed in literature. Some power aware models are discussed in [18], [19], [20].…”

LAPSES: a recipe for high performance adaptive router design

“…A third component, in addition to switching and flow control, that has a significant impact on network performance is the routing algorithm. Several research studies have shown performance benefits of various adaptive routing schemes compared to oblivious routing [15,14,9,17,7,2,5]. Theoretically, it is known that routing adaptivity is a desirable feature since it can lower average message latency at moderate to high load.…”

BLAM: a high-performance routing algorithm for virtual cut-through networks

“…Non-synchronous routers use the same principle of deflection routing but relax the constraint of synchronous operation by adding buffers that can hold incoming packets while waiting for output channels to become free [22,17]. Such routers need additional mechanisms like the packet exchange protocol [22] to prevent deadlocks.…”

“…Livelock can never occur in minimal adaptive routing, as packets always reach their destination within a finite number of hops because every hop takes a packet closer to its destination. In contrast, non-minimal adaptive routing, such as the Chaos routing algorithm [17], is not provably livelockfree, because it allows packets to be "misrouted" outside the minimal rectangle at every hop. That is, it allows hops that takes a packet farther from its destination and, hence, does not guarantee delivery within a finite number of hops.…”