By Topic

An efficient sorting algorithm on the multi-mesh network

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

4 Author(s)
De, M. ; Kalyani Univ., India ; Das, D. ; Ghosh, M. ; Sinha, B.P.

The shear-sort algorithm on an SIMD mesh model requires 4√N+o(√N) time for sorting N elements arranged on a √N×√N mesh. In this paper, we present an algorithm for sorting N elements in time O(N1/4) on an SIMD multi-mesh architecture, thereby significantly improving the order of the time complexity. The multi-mesh architecture is built around n2 blocks, where each block is an n×n mesh with n=N1/4, so that each processor will uniformly have four neighbors in the final topology

Published in:

Computers, IEEE Transactions on  (Volume:46 ,  Issue: 10 )