Parallel implemantation of search algorithms Babasegun Adeleye; Supervisor: Öykü Akaydın
Dil: İngilizce Yayın ayrıntıları:Nicosia Cyprus International University 2018Tanım: XIII, 67 p. table, figure 30.5 cmİçerik türü:- text
- unmediated
- volume
Thesis
| Materyal türü | Geçerli Kütüphane | Koleksiyon | Yer Numarası | Durum | Notlar | İade tarihi | Barkod | Materyal Ayırtmaları | |
|---|---|---|---|---|---|---|---|---|---|
|
Thesis
|
CIU LIBRARY Tez Koleksiyonu | Tez Koleksiyonu | YL 1279 A34 2018 (Rafa gözat(Aşağıda açılır)) | Kullanılabilir | Computer Engineering Department | T1399 |
CIU LIBRARY raflarına göz atılıyor, Raftaki konumu: Tez Koleksiyonu, Koleksiyon: Tez Koleksiyonu Raf tarayıcısını kapatın(Raf tarayıcısını kapatır)
Includes references (60-67 p.)
'ABSTRACT The constant advancement in technology has led to a significant change in the way processors are designed which now makes it possible for computer manufacturers to design multiple processors within a single chip. Recently, supercomputers are designed in a way that the nodes are connected and can work together to solve complex computing problems. The programming language used to develop parallel programs is Message Passing Interface (MPI). It works by running the program in parallel on multiple processors. In this research, two search algorithms namely Breadth-first Search and Depth-first Search are compared in parallel and in sequential using C programming language, MPI, and Linux operating system. The implementation is done on a distributed architecture on Linux platform comparing distances between different points on a graph. From the experiment, it is seen that breadth-first search performs better in parallel than depth-first search and gives quicker results. Keywords: Parallel computing, Message Passing Interface, Search Algorithms'