Vzporedni poboti : diplomsko delo

Rezar, Matija (author), Brodnik, Andrej (mentor)

V jeziku Erlang smo s pomočjo knjižnice napisane v jeziku C, ki uporablja vmesnik OpenMP implementirali algoritem, ki uporablja tako vzporedno kot porazdeljeno računanje za iskanje ciklov v grafu, ki predstavlja dolžnike. Te cikle nato uporabimo za izvedbo pobotov med dolžniki. Cilj naloge je bil ugotoviti, ali je Erlang primeren za implementacijo razdeljevalnika za porazdeljen sistem. Po testiranju na naključno zgrajenih grafih majhnega sveta smo prišli do zaključka, da Erlang v čisti obliki za tako nalogo ni primeren in je potrebno poiskati druge rešitve.

• Language: Slovenian
• Keywords: graf, cikel, usmerjen graf, vzporedno programiranje, porazdeljeno programiranje, odkrivanje ciklov, računalništvo, računalništvo in informatika, univerzitetni študij, diplomske naloge
• Work type: Bachelor thesis/paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: FRI - Faculty of Computer and Information Science
• Publisher: [M. Rezar]
• Year: 2014
• Number of pages: 46 str.
• PID: 20.500.12556/RUL-68888
• UDC: 004.42(043.2)
• COBISS.SI-ID: 1536061379
• Publication date in RUL: 10.07.2015

Secondary language

• Language: English
• Title: Parallel offsettings

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.

• Keywords: graph, cycle, directed graph, parallel programming, distributed programming, cycle detection, computer science, computer and information science, diploma