Changes

K2

526 bytes added, 20:20, 16 April 2018

→‎Assignment3

The bitonic sorting algorithm is devised for the input length n being a power of 2.

To check the noticeable time gap, we put 2^1516, 2^20, 2^2524.

void bitonicSort(int* array, int N){

==Assignment2==

Let's see how this algorithm works to sortand explanation of several terms.

[[File:BitonicSort1.png]]

==Assignment3==

While working on the project, we discovered that cudaMemcpy(HtoD) and (DtoH) takes long time.

so, we decided to use pinned memory instead of pageable memory to improve its performance.

"cudaHostAlloc() will allocate pinned memory which is always stored in RAM and can be accessed by GPU's DMA(direct memory access) directly"

[[File:Resultone.png|500px|thumb|left|pinned memory vs pageable memory]]

~~==Assignment3==~~using pinned memory is 2 times faster than pageable memory

44

edits