By Topic

Constant time sorting on reconfigurable 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
$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

2 Author(s)
Chen, Y.-C. ; Information Tech. Lab., Telecommun. Lab., Taoyuan, Taiwan ; Wen-Tsuen Chen

We present a constant time sorting algorithm by adopting a 3D reconfigurable mesh with only O(n3/2) processors. Our algorithm is developed on an n1/2×n1/2×n1/2 3-D reconfigurable mesh. Moreover, we further extend the result to k-dimensional reconfigurable meshes for k⩾3. Consequently, an O(4 k+1) time sorting algorithm is obtained by adopting an n1(k-1)/×n1(k-1)/×...×n1 (k-1)/k-D reconfigurable mesh of size O(n1+1(k-1)/). Hence, constant time sorting using O(n1+ε) processors, where O<ε≪1, can be realized by adopting reconfigurable meshes of high dimensions

Published in:

Computers, IEEE Transactions on  (Volume:43 ,  Issue: 6 )