prikaz prve stranice dokumenta Paralelne heuristike za problem max-cut
  Download
PDF 1.27 MB
master's thesis
Paralelne heuristike za problem max-cut
2014. urn:nbn:hr:217:852402
Buzov, Saša
University of Zagreb
Faculty of Science
Department of Mathematics

Cite this document

Buzov, S. (2014). Paralelne heuristike za problem max-cut (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:852402

Buzov, Saša. "Paralelne heuristike za problem max-cut." Master's thesis, University of Zagreb, Faculty of Science, 2014. https://urn.nsk.hr/urn:nbn:hr:217:852402

Buzov, Saša. "Paralelne heuristike za problem max-cut." Master's thesis, University of Zagreb, Faculty of Science, 2014. https://urn.nsk.hr/urn:nbn:hr:217:852402

Buzov, S. (2014). 'Paralelne heuristike za problem max-cut', Master's thesis, University of Zagreb, Faculty of Science, accessed 20 April 2024, https://urn.nsk.hr/urn:nbn:hr:217:852402

Buzov S. Paralelne heuristike za problem max-cut [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2014 [cited 2024 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:217:852402

S. Buzov, "Paralelne heuristike za problem max-cut", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2014. Available at: https://urn.nsk.hr/urn:nbn:hr:217:852402

Please login to the repository to save this object to your list.
Metadata
TitleParalelne heuristike za problem max-cut
AuthorSaša Buzov
MentorGoranka Nogo (mentor)
Committee memberGoranka Nogo (predsjednik povjerenstva)
Committee memberNela Bosner (član povjerenstva)
Committee memberVjeran Hari (član povjerenstva)
Committee memberMarko Vrdoljak (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2014-09-24, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom radu smo prezentirali jedan mogući pristup rješavanju problema maksimalnog reza. Uveli smo osnovne definicije i pojmove iz teorije grafova i složenosti algoritama, kako bi se razumio problem, i kojoj klasi pripada. Pokazali smo primjer sekvencijalne implementacije genetskog algoritma. Opisali smo arhitekturu CUDA, te našu implementaciju genetskog algorimna u CUDA okruženju. Opisali smo naš skup testnih primjera, metodologiju i okruženje testiranja, te rezultate i analizu istih. Pokazali smo da je paralelni pristup brži nakon što se prođe određena granica veličine problema, koja naravno ovisi o sustavu na kojem se testira.
Abstract (english)
In this thesis, we presented one possible solution to problem of finding maximum cut in graph. We started with describing the problem with basic definitions from graph theory and computational complexity. Later we provided both sequential and parallel algorithms for solving before mentioned problem. In last few chapter we described testing environment, test data set, and our test results. Obtained results show that parallel approach has better performance for large scale problems. After analysis, we came to conclusion that parallel is the way to go, if and only if you have large scale problem.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:852402
Study programmeTitle: Computer Science and Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra računarstva i matematike (magistar/magistra računarstva i matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2019-01-07 09:38:39