Jezik: | Slovenski jezik |
---|---|
Leto izida: | 2014 |
Tipologija: | 2.11 - Diplomsko delo |
Organizacija: | UL FRI - Fakulteta za računalništvo in informatiko |
Založnik: | [M. Rezar] |
UDK: | 004.42(043.2) |
COBISS: |
1536061379
![]() |
Št. ogledov: | 76 |
Št. prenosov: | 13 |
Ocena: | 0 (0 glasov) |
Metapodatki: |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Sekundarni jezik: | Angleški jezik |
---|---|
Sekundarni naslov: | Parallel offsettings |
Sekundarni povzetek: | Using Erlang and a library written in C using OpenMP we implemented an algorithm that utilizes both parallel and distributed computing to find cycles in a graph which represents debtors. These cycles are then used to perform debt reconciliation between debtors. In the thesis we attempt to establish whether Erlang is suitable for the implementation of a work distribution component in a distributed system. After testing on random generated small-world graphs we conclude that Erlang in it's pure form is not appropriate for that task. |
Sekundarne ključne besede: | graph;cycle;directed graph;parallel programming;distributed programming;cycle detection;computer science;computer and information science;diploma; |
Vrsta datoteke: | application/pdf |
Vrsta dela (COBISS): | Diplomsko delo/naloga |
Študijski program: | 1000468 |
Komentar na gradivo: | Univ. v Ljubljani, Fak. za računalništvo in informatiko |
Strani: | 46 str. |
ID: | 8739430 |