An Efficient Parallel Searching Algorithm on Hypercube Interconnection Network

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 ego A 2-D Mesh of Processors can be used to solve various searching problems in O(n(1/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.