Cuda ve Openmp Dillerini Kullanarak Paralel Algoritmalar ile İlgili Bir Çalışma
Loading...
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Tezde sunulan çözüm önerileri, hem sıralı yürütmeye göre zamanlamada kabul edilebilir sonuçlar elde etmek için, hem de parasal ve diğer çabaların sürdürebilir bir maliyetle paralellik çözümünü değerlendirir. CUDA, OpenMP ve sıralı kod zamanlamaları karşılaştırılarak edinilen detaylı zaman tabloları, ilgili bölümlerde bulunabilir.
The thesis evaluates the solution for parallelism at a maintainable cost of money and other efforts, for achieving acceptable results of timing when compared to parallel languages together, as well as the sequential execution. The detailed timetables comparing timings from CUDA, OpenMP and sequential code, are present in related chapters.
The thesis evaluates the solution for parallelism at a maintainable cost of money and other efforts, for achieving acceptable results of timing when compared to parallel languages together, as well as the sequential execution. The detailed timetables comparing timings from CUDA, OpenMP and sequential code, are present in related chapters.
Description
Keywords
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control, Paralel algoritmalar, Parallel algorithms
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Scopus Q
Source
Volume
Issue
Start Page
0
End Page
134