Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Quicksort and permutation routing on the hypercube and de Bruijn 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
$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)
Wei, D.S.L. ; Sch. of Comput. Sci. & Eng., Aizu Univ., Fukushima, Japan

We consider the problems of sorting and routing on some unbounded interconnection networks, namely hypercube and de Bruijn network. We first present two efficient implementations of quicksort on the hypercube. The first algorithm sorts N items on an N-node hypercube, one item per node, in O((log2 N)/(log log N)) time with high probability, while the other one sorts N items on an (N/log N)-node hypercube, log N items per node, in O(log2 N) time with high probability, which achieves optimal speedup in the sense of PT product. Both algorithms beat the fastest previous quicksort that runs in O(log 2 N) expected time on a butterfly of N nodes. We also present a deterministic (nonoblivious) permutation routing algorithm which runs in O(d·n2) time on a d-ary de Bruijn network of N=d n nodes. To the best of our knowledge, this routing algorithm is so far the fastest deterministic one for the de Bruijn network of arbitrary degree. The best previous one runs in O((log d)·d·n2) time. All algorithms presented are simple, the constants hidden behind the big Oh being small

Published in:

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Date of Conference:

14-16 Dec 1994