| Language: | Slovenian |
|---|---|
| Year of publishing: | 2014 |
| Typology: | 2.11 - Undergraduate Thesis |
| Organization: | UL FRI - Faculty of Computer and Information Science |
| Publisher: | [M. Rezar] |
| UDC: | 004.42(043.2) |
| COBISS: |
1536061379
|
| Views: | 76 |
| Downloads: | 13 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
| Secondary language: | English |
|---|---|
| Secondary title: | Parallel offsettings |
| Secondary abstract: | 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. |
| Secondary keywords: | graph;cycle;directed graph;parallel programming;distributed programming;cycle detection;computer science;computer and information science;diploma; |
| File type: | application/pdf |
| Type (COBISS): | Bachelor thesis/paper |
| Study programme: | 1000468 |
| Thesis comment: | Univ. v Ljubljani, Fak. za računalništvo in informatiko |
| Pages: | 46 str. |
| ID: | 8739430 |