![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并行计算
文章平均质量分 74
Valar_Morghulis
Open your world
展开
-
OpenMp之快速排序
并行计算中的经典案例原创 2014-09-30 09:35:54 · 4961 阅读 · 1 评论 -
QuickSort(.net)
using System;using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading; using System.Diagnostics; namespace _原创 2014-12-05 17:32:03 · 618 阅读 · 0 评论 -
Quicksort (win32API )
// api_quicksort.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include #include "time.h"#include #define N 1000000using namespace std;long wht_length;long wht_array[N];long wht_array1[N];lon原创 2014-12-05 17:35:35 · 659 阅读 · 0 评论 -
QuickSort (MFC )
#include "stdafx.h"#include #include #include #include "time.h"#define Num 10000000using namespace std;long wht_length;long wht_array[Num];long wht_array1[Num];long wht_array2[Num];CEven原创 2014-12-05 17:34:00 · 733 阅读 · 0 评论 -
QuickSort(java_Thread)
package quicksort;import java.util.Random;public class quick extends Thread{ private int wht_start; private long wht_end;private long[] wht_array=new long[1000000]; public quick(int wht_start,原创 2014-12-05 18:57:30 · 560 阅读 · 0 评论 -
QuickSort (MPI 实现)
// #include "stdafx.h" #include"mpi.h" #include #include #include using namespace std; #define TRUE 1 /* * 函原创 2014-12-05 17:28:28 · 2118 阅读 · 0 评论 -
OpenMP之矩阵转置
并行计算中的 矩阵的简单样例原创 2014-09-30 09:53:17 · 1565 阅读 · 0 评论 -
OpenMp之reduction求和
Openmp中的reduction求和原创 2014-09-30 09:45:16 · 3103 阅读 · 0 评论 -
OpenMp之临界区求和
// OpenMP1.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include"omp.h"#include#include#includeusing namespace std;#define NUM_THREADS 4int _tmain(int argc, _TCHAR* argv[]){o原创 2014-09-30 09:49:10 · 616 阅读 · 0 评论 -
QuickSort(java_Runnable)
package quicksort;public class quick1 { public static void main(String[] args) throws InterruptedException { System.out.println("Runnable实现"); int wht_length =10000000; int wht_array[]=new i原创 2014-12-05 18:44:51 · 660 阅读 · 0 评论