130 likes | 187 Views
This article explores sequential, binary, and parallel search algorithms, discussing their implementation and results using arrays of different sizes. It explains how to convert binary search codes to parallel, comparing their efficiency in finding key values.
E N D
Parallel Search Algorithms Ümit Ataş
Used Search Algorithms • Sequential Search • Binary Search • 2. Binary Search
How to convert codes to Parallel? • Take all of data and split. • Make search sequentially for each node.
Sequential Search Algorithm • Send the split dataset to nodes. • Nodes check the dataset sequentially and ordered. • If any node find result return location of key value otherwise return -1.
Binary Search Algorithm • Send the splited dataset to nodes. • Sort the array. • Apply binary search • If any node find result return location of key value otherwise return -1.
2. Binary Search Algorithm(modified) • Sort all array. • Split array for nodes. • Send the sorted data to nodes. • Apply binary search • If any node find result return location of key value otherwise return -1.
Results • These methods coded and taking results for arrays with size 1000 and 10000.