Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
Vzporedni poboti
ID
Rezar, Matija
(
Author
),
ID
Brodnik, Andrej
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(6,21 MB)
MD5: 8EAB9C348E04F90EC835C2673AA1A6B6
PID:
20.500.12556/rul/08f6495c-cfeb-46e2-a616-4579c2ac34c0
Image galllery
Abstract
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"
Work type:
Bachelor thesis/paper
Organization:
FRI - Faculty of Computer and Information Science
Year:
2014
PID:
20.500.12556/RUL-29519
Publication date in RUL:
19.09.2014
Views:
1384
Downloads:
537
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
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"
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back