By Topic

An Efficient Parallel Sorting Algorithm on OTIS Mesh of Trees

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)
Lucas, K.T. ; Dept. of Inf. Manage., Xavier Inst. of Social Service, Ranchi ; Jana, P.K.

OTIS (Optical Transpose Interconnection System) is popular model of optoelectronic parallel computers. This is a hybrid interconnection network using electronic and optical communication channels. In the recent years, many parallel algorithms for various numeric and non-numeric computations have been developed on these networks. In this paper, we propose a parallel algorithm for sorting N (=n2) data elements on an OTIS model of parallel computers, called OTIS-mesh of trees. Our algorithm is based on sparse enumeration sort (Horowitz et al., 2002) and shown to run in 4.5 log N electronic moves + 5 OTIS moves.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009