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
Performance comparison of parallel turbulent noise evaluation with different gradient selection methods
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
Prestandaanalys av parallel turbulent brusevaluering med olika gradienturvalsmetoder (Swedish)
Abstract [en]

Noise is of vital interest in many parts of computer sciene, especially in the computer graphics eld where noise is used to create nature-like e ects. Perlin’s 1985 algorithm to generate noise remains the most pop- ular in spite of many alternatives having been presented over the years. In this report we have examined the execution time impact of two new gradient table data structures and a new hash method for this algo- rithm, suggested by Perlin in 2002 and Olano in 2005 respectively. Our implementation simulated turbulence and ran in parallel on a modern GPU using the OpenCL framework. We also examined if the turbulence method’s octave summation could bene t from parallelization.

Results suggest that Olano’s hash method performs signi cantly faster, while Perlin’s original gradient table data structure performs slightly faster than the suggested improvements. We also found that a paral- lelization of the octave summation in the turbulence method performs signi cantly faster. 

Abstract [sv]

Brusalstring är av stort intresse i många datavetenskapliga områden, speciellt i datorgra ksfältet där det används för att simulera naturliga fenomen. Perlins algoritm från 1985 fortsätter vara den mest populära, trots att åtskilliga alternativ har presenterats genom åren. I den här rap- porten har vi undersökt hur exekveringstiden av denna algoritm påverkas av två nya gradientliststrukturer och en ny hashmetod som föreslagits av Perlin i 2002 respektive Olano i 2005. Vår implementation simulerade virvelströmning och kördes parallelt på en modern GPU via ramverket OpenCL. Vi undersökte också om virvelströmningens oktavsummering kunde förbättras med parallelisering.

Resultaten var att Olanos föreslagna hashmetod förbättrade körtiden betydligt, medan gradientliststrukturen i Perlins ursprungliga algoritm resulterade in en snabbare körtid än de två föreslagna förbättringarna. Vi fann också att en parallelisering av virvelströmningens oktavsummation förbättrade körtiden betydligt. 

Place, publisher, year, edition, pages
2017. , 51 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-208410OAI: oai:DiVA.org:kth-208410DiVA: diva2:1107715
Supervisors
Examiners
Available from: 2017-06-18 Created: 2017-06-10 Last updated: 2017-06-18Bibliographically approved

Open Access in DiVA

fulltext(1706 kB)23 downloads
File information
File name FULLTEXT01.pdfFile size 1706 kBChecksum SHA-512
d01dbbcc29f302937e0f06a9c2fa3ea24cd4e6db96d652d028b7fd52c9a943e4329c7590363488d4c9bd3e39d074378a701fc60fd03a677dd920d323670564da
Type fulltextMimetype application/pdf

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 23 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

Total: 48 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