Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Pseudoslumptalsgenerering: En studie av pseudoslumpsalgoritmer i allmänhet med fokus på C++11-biblioteket Random samt implementation av en modifierad XORShift
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Pseudo random number generation (English)
Abstract [en]

Randomness is a complex area of computer science, where only pseudo random numbers are possible to generate algorithmically.This report presents established algorithms for random number generation by conducting a basic study of relevant literature, while testing distribution and speed of the algorithms contained within the C++11 Random library. The results are compared to the algorithm XORShift and a modified version of it. The study shows that the modified algorithm passes all tests in Small Crush, andthat the run time is shorter than for those in the Random library. The conclusion is that it is possible to, with simple means, modify an algorithm to outperform the algorithms of the C++11 Random library.

Abstract [sv]

Slumpmässighet är ett komplext område inom datalogin,där endast pseudoslumptal går att producera algoritmiskt. Denna rapport presenterar etablerade algoritmer för att generera pseudoslumptal genom att utföra en grundläggande litteraturstudie, samt testa fördelning och tidseffektivitet hos algoritmerna i C++11:s Random-bibliotek. Resultaten jämförs med algoritmen XORShift och en modifierad versionav denna. Studien visar att den modifierade algoritmen klarar alla ingående test i Small Crush, samt att körtidenär kortare än för algoritmerna inbyggda i Randombiblioteket. Slutsatsen är att det med med enkla medel är möjligt att modifiera en algoritm till att överträffa algoritmerna i C++11:s Random-bibliotek.

Place, publisher, year, edition, pages
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-157410OAI: oai:DiVA.org:kth-157410DiVA: diva2:769905
Examiners
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2015-12-11Bibliographically approved

Open Access in DiVA

fulltext(459 kB)84 downloads
File information
File name FULLTEXT01.pdfFile size 459 kBChecksum SHA-512
a9ad2e4abef727770ea7dc232ce65fa27ceb856da62e5ffb351bad49f510e72884fb87e0af8a95382496f65600b483541f6b124cd7e0035bc0334b812ca5ff8c
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 84 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: 306 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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