kth.sePublications KTH
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
Evaluating the performance of CUDA Graphs in common GPGPU programming patterns
KTH, School of Electrical Engineering and Computer Science (EECS).
KTH, School of Electrical Engineering and Computer Science (EECS).
2023 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Evaluering av prestandan för CUDA Graphs i vanligt förekommande GPGPU-programmeringsmönster (Swedish)
Abstract [en]

CUDA Graphs is a relatively new and unexplored feature of CUDA that presents an alternative for submitting work to the GPU. This report aims to evaluate the performance benefits of CUDA Graphs. The means to this end was a benchmark suite containing CUDA applications that do not utilise CUDA Graphs. Its BFS application was modified to do so and compared against its original. The results showed an improvement of up to 14 % for medium-sized workloads, but no difference for large workloads and worse performance for small workloads. In conclusion, the performance gains are noticeable albeit only for certain types of workload.

Abstract [sv]

CUDA Graphs är en relativt ny och outforskad funktion för CUDA vilken erbjuder ett alternativt sätt att skicka instruktioner till grafikkortet. Denna rapport avser utforska fördelar med CUDA Graphs. I detta syfte användes en CUDA-implementation av bredden-först-sökning som inte använder sig av CUDA Graphs. Denna applikation modifierades för att dra nytta av CUDA Graphs för att sedan jämföras med originalversionen. Resultatet pekar på en förbättring med upp till 14 % för medelstor indata, men ingen skillnad för stora indata och en försämring för mindre indata. Sammanfattningsvis kan det vara värt att utnyttja CUDA Graphs, men inte i alla sammanhang.

Place, publisher, year, edition, pages
2023. , p. 17
Series
TRITA-EECS-EX ; 2023:292
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-330840OAI: oai:DiVA.org:kth-330840DiVA, id: diva2:1779194
Supervisors
Examiners
Available from: 2023-08-01 Created: 2023-07-03 Last updated: 2023-08-01Bibliographically approved

Open Access in DiVA

fulltext(626 kB)1737 downloads
File information
File name FULLTEXT01.pdfFile size 626 kBChecksum SHA-512
4ff254e0bf94a61d561a2e9f9440c6cee7944da7903deac494ff45798890f1d34775f952deef7924eb0ae717c78798bfe0ed1320a13b60c85d4fdd78eb5590b5
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Computer and Information Sciences

Search outside of DiVA

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