ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Parallel offsettings

Matija Rezar (2014) Parallel offsettings. EngD thesis.

Download (6Mb)


    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.

    Item Type: Thesis (EngD thesis)
    Keywords: graph, cycle, "directed graph", "parallel programming", "distributed programming", "cycle detection"
    Number of Pages: 46
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Andrej Brodnik5540Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536061379 )
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2708
    Date Deposited: 17 Sep 2014 13:16
    Last Modified: 24 Nov 2014 15:20
    URI: http://eprints.fri.uni-lj.si/id/eprint/2708

    Actions (login required)

    View Item