毕业论文设计《基于OpenMP的快速排序算法分析与程序设计》.docVIP

PAGE lw lw XXXX大学 毕 业 设 计（论 文） 题 目 基于OpenMP的快速排序算法分析与程序设计 专 业 学生姓名 班级学号 指导教师 评阅教师 指导单位 日期： 年 月 日至 年 月 日 摘 要 ?OpenMP是一种面向共享内存以及分布式共享内存的多处理器多线程并行编程语言。具有良好的可移植性，支持Fortran和C/C++编程语言，操作系统平台方面则支持UNIX系统以及Windows?系统。OpenMP的重要性在于它能够为编写多线程程序提供一种简单的方法，而无需程序员进行复杂的线程创建、同步、负载平衡和销毁工作。而快速排序（Quicksort）是对冒泡排序的一种改进，它采用了分治的思想，是所有排序算法中最高效，应用最广泛的一种。本文将对OpenMP的快速排序算法进行分析并设计程序。 论文根据执行模式和三个基本要素分析了OpenMP技术的基本原理，并详细讲解了它的优缺点，阐述其发展趋势。接着列举了主要的几个排序算法进行比较说明，以便能更好地了解其性能特点。对快速排序算法分别从最好情况，最坏情况，平均情况进行总体分析。最后对快速排序，基于归并的快速排序，双倍快速排序举例进行程序编码，通过实践编程来加深对本课题知识的掌握。 关键字：OpenMP，并行程序，多线程共享，库函数，编译系统，快速排序。 ABSTRACT OpenMP for shared memory and distributed shared memory multi-processor, multi-threaded parallel programming language. Has good portability, Support for FORTRAN and C / C + + programming language，Operating system platform support UNIX systems and Windows systems. The OpenMP importance lies in its ability to provide a simple method for the preparation of a multithreaded program, Without the need for programmers to create complex threads, synchronization, load balancing, and destruction. Quick Sort (Quicksort) is an improvement on the bubble sort, it uses the idea of ??partition, is the most efficient, the most widely used one among all the sorting algorithm. In this paper, OpenMP quick sort algorithm analysis and design process. According to the execution mode and three basic elements, the paper analyzes the basic principles of OpenMP technology, and explain in detail the advantages and disadvantages of its development trend. Goes on to list the main sorting algorithm compare instructions, in order to better understand its performance characteristics. From the best-case, worst-case, average case, the overall analysis of the quick sort algorithm. Finally, the quick sort, quick sort merge double quick sort example program code, programming practice to deepen the mastery of knowledge on the subject. Keywords: OpenMP，Parallel program, Multi-threaded shared, Library functions, C