搜索资源列表
quicksort
- 快排的并行实现,使用openMP,程序自动生成随机数,分别使用单线程和多线程排序,并比较最后的结果-quick sort based on openMP
ComputePi
- 采用了多线程的pi值计算,效率比单线程高-Using a multi-threaded pi value, high-efficient than single-threaded
parallel-compute.
- 一个基于OpenMp并行编程的实例,基于多线程,多线程比单线程下节省运行时间的典型例子。算法内容主要是计算矩阵乘积,再求个元素和。可通过"任务管理器"-"性能"查看运行在多核上。-Typical example of a parallel programming based OpenMp instance, save run time based on the multi-threaded, multi-threading than single-threaded. The algorithm
duo
- 代码主要实现了单线程、多线程求π的计算方法,在集群上运行,比较时间。-The code mainly implements the single-thread, multithreaded method of calculating π, runs on the cluster, compares the time.