Essays about: "Data Parallelism"
Showing result 11 - 15 of 77 essays containing the words Data Parallelism.
-
11. Rate Flexible Soft Decision Viterbi Decoder using SiLago
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The IEEE 802.11a protocol is part of the IEEE 802 protocols for implementing WLAN Wi- Fi computer communications in various frequencies. These protocols find applications worldwide, covering a wide range of devices like mobile phones, computers, laptops, household appliances, etc. READ MORE
-
12. Distributed Robust Learning
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Accuracy obtained when training deep learning models with large amounts of data is high, however, training a model with such huge amounts of data on a single node is not feasible due to various reasons. For example, it might not be possible to fit the entire data set in the memory of a single node, training times can significantly increase since the dataset is huge. READ MORE
-
13. A study about differences in performance with parallel and sequential sorting algorithms
University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknikAbstract : Background: Sorting algorithms are an essential part of computer science. With the use of parallelism, these algorithms performance can improve. Objectives: To assess parallel sorting algorithms performance compared with their sequential counterparts and see what contextual factors make a difference in performance. READ MORE
-
14. Parallelization of Online Random Forest
University essay fromAbstract : Context. Random Forests (RFs) is a very popular machine learning algorithm for mining large scale data. RFs is mainly known asan algorithm that operates in offline mode. However, in recent yearsimplementations of online random forests (ORFs) have been introduced. READ MORE
-
15. Comparative Study of CPU and GPGPU Implementations of the Sievesof Eratosthenes, Sundaram and Atkin
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : Background. Prime numbers are integers divisible only on 1 and themselves, and one of the oldest methods of finding them is through a process known as sieving. A prime number sieving algorithm produces every prime number in a span, usually from the number 2 up to a given number n. READ MORE