By Topic

Online communication on circuit-switched fixed routing meshes

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
$33 $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)
A. Youssef ; Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA

The paper addresses routing on the circuit-switched fixed routing n×n mesh Mn where paths follow the row-column rule. It first presents a self-routing algorithm that schedules any BPC permutation in L(logN) time ( N=n2) to run in n routing steps on Mn, and another self-routing algorithm that schedules in constant time any Ω- or ω1-realizable permutation to run in 2n routing steps on Mn. Finally, it is shown that broadcasting and fan-in communication self-route in log N routing steps, that parallel prefix requires log2N routing steps and that FFT requires O(n) routing steps. In all but the FFT case, the circuit-switched mesh delivers better performance than its packet-switched counterpart

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992