Impovement on Fast Scheduling in Parallel Computing

This thesis is mainly about the development of high-performance of computering and problem solving,and an example(quick sort) about the problems in parallel computing.Sorting by that takes up a lot of time in the class.Quick sort is a kind of typical serial sorting algorithm,and its average time complexity is O(nlogn).With parallel algorithms for quick sort,time complexity only O(2logn).However,when the number of huge sorting data(such as n10n),in parallel algorithm needs n set processor,in actual application of feasibility,as does not have the parallel processing technology and the development of our quick sort of further research,this paper puts forward a new kind of parallel scheduling algorithm by using the domain,and-the merge sort of thought to a parallel algorithms can be realized.