mpi排序

思想

将一个较大的需要排序的数组，拆分成等大小的数据段,分配给不同的进程，利用归约排序算法的思想，将不同进程之间的数据进行排序，同时在规约中包含快排结合使用最大程度的加速程序的速度，最后将各个程序的内容发送到根进程中，完成输出。

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <mpi.h>
#define length 10//0//0000
//快排的实现
void swap(int* data, int i, int j) {
	int temp = data[i];
	data[i] = data[j];
	data[j] = temp;
}

int partition(int* data, int start, int end) {
	if (start >= end) return 0;
	int pivotValue = data[start];
	int low = start;
	int high = end - 1;
	while (low < high) {
		while (data[low] <= pivotValue && low < end) low++;
		while (data[high] > pivotValue && high > start) high--;
		if (low < high) swap(data, low, high);
	}
	swap(data, start, high);
	return high;
}

void quicksort(int* data, int start, int end) {
	if (end - start + 1 < 2) return;
	int pivot = partition(data, start, end);
	quicksort(data, start, pivot);
	quicksort(data, pivot + 1, end);
}
//主函数
int main(int argc, char* argv[]) {
	MPI_Init(&argc, &argv);
	int rank, size;
	MPI_Comm_rank(MPI_COMM_WORLD, &rank);
	MPI_Comm_size(MPI_COMM_WORLD, &size);
	printf("%d\n", size);//显示当前的进程数
	int* data = (int*)malloc(sizeof(int) * length);
	int i;
	for (i = 0; i < length / size; i++)
		data[i] = (i+1)*(rank+1); //对不同进程中的数据段进行赋值
	quicksort(data, 0, length / size);//不同进程中的数据进行快排
	MPI_Status status;
	if (rank == 0) {
		//for (i = 0; i < length / size; i++)
			//printf("%d ", data[i]);
		//printf("\n");
		for (i = 1; i < size; i++)
			MPI_Recv(data + i * length / size, length / size, MPI_INT, i, MPI_ANY_TAG, MPI_COMM_WORLD, &status);
	}
	else {
		MPI_Send(data, length / size, MPI_INT, 0, 0, MPI_COMM_WORLD);
	}
	MPI_Barrier(MPI_COMM_WORLD);
	if (rank == 0) {
		for (int i = 0; i < 10; i++) {
			printf("%d ", data[i]);//打印输出排序结果
		}
	}
	MPI_Finalize();
	return 0;
}

优化一

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <mpi.h>
#define length 10//0//0000

void swap(int* data, int i, int j) {
	int temp = data[i];
	data[i] = data[j];
	data[j] = temp;
}

int partition(int* data, int start, int end) {
	if (start >= end) return 0;
	int pivotValue = data[start];
	int low = start;
	int high = end - 1;
	while (low < high) {
		while (data[low] <= pivotValue && low < end) low++;
		while (data[high] > pivotValue && high > start) high--;
		if (low < high) swap(data, low, high);
	}
	swap(data, start, high);
	return high;
}

void quicksort(int* data, int start, int end) {
	if (end - start + 1 < 2) return;
	int pivot = partition(data, start, end);
	quicksort(data, start, pivot);
	quicksort(data, pivot + 1, end);
}

int main(int argc, char* argv[]) {
	MPI_Init(&argc, &argv);
	int rank, size;
	MPI_Comm_rank(MPI_COMM_WORLD, &rank);
	MPI_Comm_size(MPI_COMM_WORLD, &size);
	printf("%d\n", size);//显示当前的进程数
	
	int* data = (int*)malloc(sizeof(int) * length);
	int* shou = (int*)malloc(sizeof(int) * 2);
	int i;
	if (rank == 0) {
		for (i = 0; i < length; i++)
			data[i] = i; //对不同进程中的数据段进行赋值
	}
	MPI_Scatter(data, length / size, MPI_INT, shou, length / size, MPI_INT, 0, MPI_COMM_WORLD);//使用广播将数据分段广播到不同的进程中
	quicksort(shou, 0, length / size);//不同进程中的数据进行快排
	MPI_Gather(shou, 2, MPI_INT, data, 2, MPI_INT, 0, MPI_COMM_WORLD);//将数据有序拼接在一起
	MPI_Barrier(MPI_COMM_WORLD);
	if (rank == 0) {
	quicksort(data, 0, length);
		for (int i = 0; i < 10; i++) {
			printf("%d ", data[i]);//打印输出排序结果
		}
	}
	MPI_Finalize();
	return 0;
}

优化二

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include<math.h>
#include <mpi.h>
#define length 8//0//0000

void swap(int* data, int i, int j) {
	int temp = data[i];
	data[i] = data[j];
	data[j] = temp;
}

int partition(int* data, int start, int end) {
	if (start >= end) return 0;
	int pivotValue = data[start];
	int low = start;
	int high = end - 1;
	while (low < high) {
		while (data[low] <= pivotValue && low < end) low++;
		while (data[high] > pivotValue && high > start) high--;
		if (low < high) swap(data, low, high);
	}
	swap(data, start, high);
	return high;
}

void quicksort(int* data, int start, int end) {
	if (end - start + 1 < 2) return;
	int pivot = partition(data, start, end);
	quicksort(data, start, pivot);
	quicksort(data, pivot + 1, end);
}

int main(int argc, char* argv[]) {
	MPI_Init(&argc, &argv);
	int rank, size;
	MPI_Comm_rank(MPI_COMM_WORLD, &rank);
	MPI_Comm_size(MPI_COMM_WORLD, &size);
	printf("%d\n", size);//显示当前的进程数

	int* data = (int*)malloc(sizeof(int) * length);
	int* shou = (int*)malloc(sizeof(int) * 2);
	int i;
	if (rank == 0) {
		for (i = 0; i < length; i++)
			data[i] = i; //对不同进程中的数据段进行赋值
	}
	int j;
	for (int j = 1; j < sqrt(length); j++){
		MPI_Scatter(data, length / size*j, MPI_INT, shou, length / size*j, MPI_INT, 0, MPI_COMM_WORLD);
	quicksort(shou, 0, length / size);//不同进程中的数据进行快排
	MPI_Gather(shou, length / size * j, MPI_INT, data, length / size * j, MPI_INT, 0, MPI_COMM_WORLD);
}
	MPI_Barrier(MPI_COMM_WORLD);
	if (rank == 0) {
		for (int i = 0; i < 10; i++) {
			printf("%d ", data[i]);//打印输出排序结果
		}
	}
	MPI_Finalize();
	return 0;
}