Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

PDF

Selected Works

2018

Computer Sciences

Greedy routing

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh Jan 2018

Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh

Ronald Greenberg

We examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη + cLηlog P) time, where L is the number of flits in a packet, and η = min {d,L]; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area Θ(A) can simulate wormhole routing on any network of comparable area with O(log 3 …


Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh Jan 2018

Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh

Ronald Greenberg

In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+cLηlogP) time with high probability, where L is the number of flits in a packet, and η=min{d,L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area Θ(A) can simulate wormhole routing on any network of comparable area with O(log^3 A) …