filmov
tv
Analysis and Comparison of Parallel Sorting Algorithms
Показать описание
Student Presenter: Chen Kai Tsai
Faculty Adviser: Jing-Chiou Liou
Abstract: Nowadays, modern CPUs are multicore processors and the number of the cores in it is still increasing. However, computing power brought by these cores will not automatically improve the performance of any program in our computer. They have to be parallelized. This research will first introduce the sorting algorithms we chose and analyze them theoretically. Then, introduce the OpenMP, MPI and Hybrid OpenMP/MPI. Finally, we will show the result involve three different sets of implementation and environment. To show the result, we will draw charts in each set to compare the performance of the algorithms. In addition, we will introduce and measure the scaling performance on algorithms in each set.
Faculty Adviser: Jing-Chiou Liou
Abstract: Nowadays, modern CPUs are multicore processors and the number of the cores in it is still increasing. However, computing power brought by these cores will not automatically improve the performance of any program in our computer. They have to be parallelized. This research will first introduce the sorting algorithms we chose and analyze them theoretically. Then, introduce the OpenMP, MPI and Hybrid OpenMP/MPI. Finally, we will show the result involve three different sets of implementation and environment. To show the result, we will draw charts in each set to compare the performance of the algorithms. In addition, we will introduce and measure the scaling performance on algorithms in each set.
0:03:41
0:03:41
0:05:47
0:04:56
0:03:05
0:00:19
0:02:59
0:05:29
0:01:25
0:05:26
0:06:02
0:00:19
0:07:10
0:00:43
0:00:15
0:00:12
0:01:01
0:00:38
0:05:17
0:00:16
0:00:32
0:00:16
0:17:59
0:00:59