Parallel processing is one of the significant research subjects in the field of computer science. Today’s real time applications expect higher throughput approaches than years away. There are various problems that require search algorithms as a part of their base operations. Some parallel search algorithms are available albeit we always need to find faster ones due to the new born technologies. This paper introduces a new searching algorithm on hypercube architecture with a tradeoff between the numbers of processor elements and the running time.