By Topic

Hypercube computations on partitioned optical passive stars networks

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

2 Author(s)
A. Mei ; Dept. of Comput. Sci., Univ. of Rome "La Sapienza", Italy ; R. Rizzi

This paper shows that an n=2k processor partitioned optical passive stars (POPS) network with g groups and d processors per group can simulate every bidirectional move of an n processor hypercube using one slot when d<g, two slots when d=g, and lceild/grceil slots when d>g. Moreover, the same POPS network can simulate every monodirectional move of a processor hypercube using one slot when d=g. All these results are shown to be optimal. Our simulations improve on the literature whenever dneg and directly yield several important consequences. For example, as a direct consequence of our simulations, a POPS network, n=dg and d<g, can compute the prefix sums of n data values in log2n slots. This is faster than the best previously known ad hoc algorithm and is actually optimal. Similarly, we improve on the best POPS network algorithms for both the prefix sums problem on general POPS networks and the fundamental online permutation routing problem, among others

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:17 ,  Issue: 6 )