An Appropriate Search Algorithm for Finding Grid Resources
| dc.contributor.author | Olusegun, O. A., Babatunde, A. N., Omotehinwa, T. O., Aremu, D. R. & Balogun, B. F. | |
| dc.date.accessioned | 2025-10-18T19:08:51Z | |
| dc.date.available | 2025-10-18T19:08:51Z | |
| dc.date.issued | 2014-06-16 | |
| dc.description.abstract | Abstract: A grid is a collection of computing resources that perform tasks. Searching within a grid resource is very challenging considering the potential size of the grid and wide range of resources that are represented. The aim of this study is to find the search algorithm that is appropriate for a search problem in a grid environment. Breadth first search, Depth first search and Depth first iterative deepening search algorithms were studied and analyzed to find the one with minimal complexity. The algorithms were implemented using graph with a collection of nodes. They were analyzed based on their completeness and optimality in terms of running time. Octave was used as the analysis tool to measure the time complexity of these search algorithms. From the analysis of these algorithms, Depth First Iterative deepening search algorithm was adopted as a search strategy for grid resources because of its completeness and optimality in terms of running time. The research shows that Depth First Iterative Deepening search algorithm is asymptotically optimal in terms of cost of solution, running time, and space required for uninformed searches. Therefore, DFID search is the best search strategy suitable for grid resources among the three search strategy studied in this work. Keywords: Grid, Breadth first search, Depth first search, Depth first iterative deepening search. | |
| dc.identifier.uri | https://kwasuspace.kwasu.edu.ng/handle/123456789/5971 | |
| dc.publisher | International Journal of Emerging Trends and Technology in Computer Science | |
| dc.title | An Appropriate Search Algorithm for Finding Grid Resources |