This thesis addresses the parallelisation of graph algorithms in functional programming languages, with a focus on OCaml and the use of the Domainslib library. The work concentrates on developing and analyzing parallel versions of classical algorithms, such as breadth-first search (BFS), Dijkstra's algorithm, and the Floyd-Warshall algorithm. The primary goal is to compare the effectiveness of parallel and sequential implementations of these algorithms in the context of functional programming. The analysis showed that parallel implementation can improve efficiency, especially in extensive graphs. However, improvements in efficiency are also identified to have limitations due to the inherent nature of parallel execution.
|
