The performance of parallel algorithms is often inconsistent with their preliminary theoretical analyses. Indeed, the difference is increasing between the ability to theoretically predict the performance of a parallel algorithm and the results measured in practice. This is mainly due to the accelerated development of advanced parallel architectures, whereas there is still no agreed model for parallel computation, which has implications for the design of parallel algorithms and for the manner in which parallel programming should be taught.

In this study, we examined the practical performance of Cormen’s Quicksort parallel algorithm. We determined the performance of the algorithm with different parallel programming approaches and examine the capacity of theoretical performance analyses of the algorithm for predicting the actual performance. This algorithm is used for teaching theoretical and practical aspects of parallel programming to undergraduate students. We considered the pedagogic implications that may arise when the algorithm is used as a learning resource for teaching parallel programming.

并行算法的性能通常与其初步的理论分析不一致。实际上，理论上预测并行算法性能的能力与实际测量的结果之间的差异越来越大。这主要是由于先进的并行体系结构的加速发展，而对于并行计算仍然没有公认的模型，这对并行算法的设计以及应该教并行编程的方式产生了影响。

在这项研究中，我们研究了Cormen的Quicksort并行算法的实际性能。我们使用不同的并行编程方法确定了算法的性能，并研究了该算法的理论性能分析用于预测实际性能的能力。该算法用于向本科生教授并行编程的理论和实践方面。我们考虑了将该算法用作教学并行编程的学习资源时可能产生的教学意义。