By Topic

An efficient parallel searching algorithm on Hypercube Interconnection 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
$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

4 Author(s)

In the information age, the huge amount of data and information are exchanged which requires fast and efficient searching mechanisms for effective use of this information. There are various sequential searching algorithms to search an element in an unsorted array or sorted array of elements. A number of researchers have explored methods for improving the efficiency and speedup of search using parallel hardware, for eg. A 2-D Mesh of Processors can be used to solve various searching problems in O(n1/2) time regardless of any assumption about wire delay. We proposed an algorithm for searching on Hypercube Interconnection network that solves the basic query problem, namely given an integer x, it is required to search a file of records on the s field for x. Proposed algorithm produces a yes or no answer to such a query in O(log n) time.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on

Date of Conference:

6-8 Dec. 2012