xsortmain.cpp

归并排序的并行算法 intel 多线程优化大赛

#include "XQSort.h"
#include "XMergeSort.h"

// 使用说明
void Usage(void)
{
	printf("Usage: XSort.exe <file name> [mp|ms|qp|qs|std|pgo|test] [Count] [Seed]\n");
	printf("Usage: mp = MergeSort Parallel\n");
	printf("Usage: ms = MergeSort Serial\n");
	printf("Usage: qp = QSort Parallel\n");
	printf("Usage: qs = QSort Serial\n");
	printf("Usage: std = parallel_sort\n");
	printf("Usage: pgo = for PGO\n");
	printf("Usage: test = Create Test Data\n");
}

// 程序运行模式
enum enSortMode
{
	XMERGESORT_PARALLEL = 0x00000001,
	XMERGESORT_SERIAL   = 0x00000002,
	XQSORT_PARALLEL     = 0x00000004,
	XQSORT_SERIAL       = 0x00000008,
	XQSORT_STD          = 0x00000010,
	XSORT_FORPGO		= 0x00000015,
	XSORT_CREATETESTDATA= 0x00000020,
};

int main(int argc, char* argv[])
{
	// 创建任务scheduler
	task_scheduler_init init;
	tick_count nBeg,nEnd;
	tick_count nBegAll,nEndAll;
	char szInput[MAX_PATH]  =  "data.in";
	char szOutput[MAX_PATH] =  "sorted.out";
	uint32 nSortMode = XMERGESORT_PARALLEL;

	// 解析命令行参数
	switch(argc)
	{
	case 2:
		strcpy(szInput, argv[1]);
	case 1:
		nSortMode = XMERGESORT_PARALLEL;
		break;
	case 3:
	case 4:
	case 5:
		strcpy(szInput, argv[1]);
		if(strcmp(argv[2], "ms") == 0)		{ nSortMode = XMERGESORT_SERIAL; }
		else if(strcmp(argv[2], "mp") == 0) { nSortMode = XMERGESORT_PARALLEL; }
		else if(strcmp(argv[2], "qs") == 0) { nSortMode = XQSORT_SERIAL; }
		else if(strcmp(argv[2], "qp") == 0) { nSortMode = XQSORT_PARALLEL; }
		else if(strcmp(argv[2], "std") == 0) { nSortMode = XQSORT_STD; }
		else if(strcmp(argv[2], "test") == 0) { nSortMode = XSORT_CREATETESTDATA; printf("Create Test Data:\n");}
		else if(strcmp(argv[2], "pgo") == 0) { nSortMode = XSORT_FORPGO; }
		else { nSortMode = XMERGESORT_PARALLEL;}
		break;
	default:
		Usage();
		exit(0);
		break;
	}

	// 创建测试数据
	if(nSortMode == XSORT_CREATETESTDATA)
	{
		int nRand = 10000000;
		if(argc >= 4) nRand = atoi(argv[3]);
		if(argc >= 5) srand(atoi(argv[4]));
		XDataFileRand(nRand, szInput);
	}

	if (nSortMode == XSORT_FORPGO) 
	{
		printf("警告:只在启用PGO编译时使用!!!!!!\n\n\n");  
		XDataFileRand(10000000, szInput);
	}

	do
	{
		uint32 nMask = nSortMode & -nSortMode;

		// 输出当前模式
		if(nMask == XQSORT_STD)					{ printf("parallel_sort:\n"); }
		else if(nMask == XMERGESORT_SERIAL)		{ printf("MergeSort Serial:\n"); }
		else if(nMask == XQSORT_PARALLEL)		{ printf("QSort Parallel:\n");  }
		else if(nMask == XQSORT_SERIAL)			{ printf("QSort Serial:\n");  }
		else									{ printf("MergeSort Parallel:\n"); }

		// 加载测试数据
		nBeg = nBegAll = tick_count::now(); 

		XSortArray* pSrc = XDataFileRead(szInput);
		//XSortArray* pSrc = XSortArrayRand(10000000);
		//XSortArray* pSrc = XMergeSortParallel_IO<uint32>(szInput);

		nEnd = tick_count::now(); 

		printf("Load Data Time: %f seconds\n", (nEnd - nBeg).seconds());

		// 调用排序算法
		nBeg = tick_count::now(); 

		if(nMask == XQSORT_STD)					{ parallel_sort<uint32>(pSrc->pData, pSrc->pData + pSrc->nData); }
		else if(nMask == XMERGESORT_SERIAL)		{ XMergeSortSerial<uint32>(pSrc->pData, pSrc->nData); }
		else if(nMask == XQSORT_PARALLEL)		{ XQSortParallel<uint32>(pSrc->pData, pSrc->nData); }
		else if(nMask == XQSORT_SERIAL)			{ XQSortSerial<uint32>(pSrc->pData, pSrc->nData); }
		else									{ XMergeSortParallel<uint32>(pSrc->pData, pSrc->nData); }

		nEnd = tick_count::now(); 

		printf("Sort Data Time: %f seconds\n", (nEnd - nBeg).seconds());

		// 校验排序结果正确性
		//XSortArrayVerify(pSrc);

		// 输出排序结果
		nBeg = tick_count::now(); 

		XDataFileSave(szOutput, pSrc);

		nEnd = nEndAll = tick_count::now(); 

		printf("Save Data Time: %f seconds\n", (nEnd - nBeg).seconds());

		printf("Total Time: %f seconds\n\n", (nEndAll - nBegAll).seconds());

		// 销毁数组
		XSortArrayDestroy(&pSrc);

		nSortMode -= nMask;

	} while(nSortMode);

	return 0;
}