Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Examining Sorting Algorithm Performance Under System Load
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2017 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Analys av sorteringsalgoritmprestanda under systemstress (Swedish)
Abstract [en]

In this thesis, we conducted tests in order to determine how system load affected the speed of commonly used algorithms. The difficulty of obtaining these type of results theoretically due to a large number of factors that can affect performance motivated the use of simulation. An implementation was constructed that ran the sorting algorithms Mergesort, Quicksort and Radixsort while the system was put under different levels of stress. This stress was created by generating cache misses using the software stress-ng. The resulting completion times, as well as the cache activity was logged. The result of the simulations were mostly within expectations, faster algorithms still performed better even under heavy loads and even handled the load better than the competition

Abstract [sv]

I denna rapport har vi utfört tester för att utvärdera hur systembelastning påverkar hastigheten på en samling vanligt förekommande algoritmer. Svårigheterna med att teoretiskt räkna ut dessa resultat är på grund av dess många påverkande faktorer. Detta ledde till användandet av en simulation. Ett testsystem skapades för att köra sorteringsalgoritmerna Mergesort, Quicksort och Radixsort med varierad systembelastning. Denna systembelastning skapades genom att generera cachemissar med hjälp av programmet stress-ng. Dessa simulationer, såväl som cache aktiviteten loggades. Resultatet var inom förväntan, de lättare och snabbare algoritmerna klarade sig fortfarande bättre även under svår belastning, och hanterade den ökade belastningen bättre.

Place, publisher, year, edition, pages
2017.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-209765OAI: oai:DiVA.org:kth-209765DiVA, id: diva2:1114264
Supervisors
Examiners
Available from: 2017-06-22 Created: 2017-06-22 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(600 kB)26 downloads
File information
File name FULLTEXT01.pdfFile size 600 kBChecksum SHA-512
9807bcf2c73c9224ba2961241015fc8fabef609d99203f427f0a00db62eecfb0b884977d3818e54a3c9424f4e872ed72a316cbb0f3cb349b61a3444b92943db1
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Hamrin, Niklas
By organisation
School of Computer Science and Communication (CSC)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 26 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 68 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf