顺序查询算法在并行计算环境下的实现 摘 要随着计算机和计算方法的飞速发展，几乎所有的学科都走向定量化和精确化，在理论模型复杂甚至理论尚未建立，或者实验费昂贵甚至试验无法进行的情况下，此时计算就成为求解问题的唯一或主要手段。在磁记录技术、新药设计、高速民航、催化作用、燃料燃烧、海洋建模、臭氧耗损、数字解析、大气污染、蛋白质结构设计、图像理解、密码破译等领域，都对计算性能有着极高的要求。在其他的应用领域中，计算性能也起着关键性的作用，它的效率甚至影响着结果的准确性、精确度，比如数值气象预报、商务应用、网络计算等，这些应用都迫切的需要高性能的计算来支撑。随着计算机的高速发展，研究并行计算机上的计算已经成为历史的潮流，必然的趋势。本文为顺序查询算法在并行计算中的实现。先介绍了顺序查询算法在并行计算中的实现的选题背景和研究意义，然后介绍了并行计算的研究现状，最后介绍了论文的研究内容。 然后简单介绍了并行计算基础、MPI 技术和 OpenMP 技术的概念，为后面的实现奠定理论基础。最后对顺序查询算法，选择排序算法和合并排序算法分别进行了介绍，串行实现，以及在串行实现的基础上的并行实现改动。关键词：查询算法，并行计算，Openmp AbstractWith the rapid development of computer and calculation methods, almost all disciplines are towards quantification and accuracy. When the theoretical model is complex or even the theory has not been established, or the experimental cost is expensive or even the experiment cannot be carried out, the calculation becomes the only or main means to solve the problem. In the fields of magnetic recording technology, new drug design, high-speed civil aviation, catalysis, fuel combustion, Ocean Modeling, ozone depletion, digital analysis, air pollution, protein structure design, image understanding, password decoding, etc., there are very high requirements for computing performance. In other applications, computing performance also plays a key role. Its efficiency even affects the accuracy and accuracy of the results, such as numerical weather fo...
