20.500.12556/RUL-156045 Paralelizacija grafovskih algoritmov v funkcijskih programskih jezikih delo diplomskega seminarja Parallelisation of graph algorithms in functional programming languages Diplomska naloga obravnava paralelizacijo grafovskih algoritmov v funkcijskih programskih jezikih, s poudarkom na OCamlu in uporabi knjižnice Domainslib. Delo se osredotoča na razvoj in analizo paralelnih različic klasičnih algoritmov, kot so iskanje v širino (BFS), Dijkstrov algoritem in Floyd-Warshallov algoritem. Glavni cilj je primerjava učinkovitosti paralelnih in sekvenčnih implementacij teh algoritmov v kontekstu funkcijskega programiranja. Analiza je pokazala, da paralelna implementacija lahko izboljša učinkovitost, še posebej pri obsežnih grafih. Kljub temu pa smo identificirali tudi omejitve pri izboljšavah učinkovitosti zaradi same narave paralelnega izvajanja. 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. paralelizacija grafovski algoritmi funkcijski programski jeziki OCaml iskanje v širino (BFS) Dijkstrov algoritem Floyd-Warshallov algoritem večjedrno računanje parallelisation graph algorithms functional programming languages OCaml breadth-first search (BFS) Dijkstra's algorithm Floyd-Warshall algorithm multi-core computing true false false Slovenski jezik Angleški jezik Delo diplomskega seminarja/zaključno seminarsko delo/naloga 2024-05-01 08:15:04 2024-05-01 08:15:09 2024-05-29 09:37:34 0000-00-00 00:00:00 2024 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.43 139788 194478083 12058.pdf 12058.pdf 1 94DAE6AEB84F71EAA2E31967DD94FD9D 367b4e0e42091a8ac75725ded1fc02e3b6b522a9d54c05e77d9a567a071ea5f1 283e78de-0782-11ef-8526-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=183254 Fakulteta za matematiko in fiziko 0 0 0