By Topic

Fast, deterministic routing, on hypercubes, using small buffers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kuszmaul, B.C. ; MIT, Cambridge, MA, USA

A deterministic routing scheme for a communications network based on the k-dimensional hypercube is proposed. The author presents two formulations of the scheme. The first formulation delivers messages in O(k2) bit times using O(K ) bits of buffer space at each node in the hypercube. The second formulation assumes that there are several batches of messages to be delivered, and makes certain assumptions about the cost of sending messages along the various dimensions of the cube. In this case, the latency for delivery time is still O(k2) bit times, but the throughput is increased to one set of messages every O(k) bit times. For the first formulation, the author restricts himself to routings which are subsets of permutations (i.e. every node sends at most one message and receives at most one message). The second formulation indicates a way to perform routings which are subsets of H-permutations (i.e. every node sends at most H messages and receives at most H messages)

Published in:

Computers, IEEE Transactions on  (Volume:39 ,  Issue: 11 )