Scientific Research

An Academic Publisher

An NC Algorithm for Sorting Real Numbers in *O*(nlogn/√loglogn) Operations

**Author(s)**Leave a comment

KEYWORDS

1. Introduction

It is known widely that serial comparison sorting takes $\theta \left(n\mathrm{log}n\right)$ time for sorting n numbers [1] . Although integer sorting can outperform the $\Omega \left(n\mathrm{log}n\right)$ lower bound for sorting n integers [2] [3], these algorithms generally do not apply to the problem of sorting real numbers. It has been known that n integers can be sorted in $O\left(n\mathrm{log}\mathrm{log}n\right)$ time and linear space [2] [3] . The $O\left(n\mathrm{log}n\right)$ time bound remains for sorting real numbers ever since. Only very recently Han showed that real numbers can be converted to integers for the sorting purpose in $O\left(n\sqrt{\mathrm{log}n}\right)$ time [4], thus enabling the serial sorting of real numbers in $O\left(n\sqrt{\mathrm{log}n}\right)$ time.

Parallel sorting algorithms for sorting real numbers run on the PRAM (Parallel Random Access Machine) model are known [5] [6] . The AKS sorting network [5] can be transformed into an EREW (Exclusive Read Exclusive Write) PRAM algorithm with $O\left(\mathrm{log}n\right)$ time and $O\left(n\mathrm{log}n\right)$ operations. Cole’s parallel merge sort [6] sorts n numbers in $O\left(\mathrm{log}n\right)$ time using n processors on the EREW PRAM. On the CRCW (Concurrent Read Concurrent Write) PRAM Cole showed [7] that his parallel merge sort can run in $O\left(\mathrm{log}n/\mathrm{log}\mathrm{log}\left(2p/n\right)\right)$ time using p processors. Also see [7] .

There are also parallel algorithms for integer sorting [8] [9] [10] [11] . In the case of integer sorting, the operation bound can be improved to below $O\left(n\mathrm{log}n\right)$. In particular, [10] presents a CRCW PRAM integer sorting algorithm with $O\left(\mathrm{log}n\right)$ time and $O\left(n\mathrm{log}\mathrm{log}n\right)$ operations and [11] presents an EREW PRAM integer sorting algorithm with $O\left(\mathrm{log}n\right)$ time and $O\left(n\sqrt{\mathrm{log}n}\right)$ operations.

For sorting real numbers, the previous best serial algorithm sorts in $O\left(n\mathrm{log}n\right)$ time. It was also known that for comparison sorting, $\Omega \left(n\mathrm{log}n\right)$ is the tight lower bound. Thus if we use comparison sorting to sort real numbers, then in serial algorithms, we cannot avoid the $\Omega \left(n\mathrm{log}n\right)$ time bound and in parallel algorithms, we cannot avoid the $\Omega \left(n\mathrm{log}n\right)$ operation bound. In the past, no other sorting methods are known to sort real number in less than $O\left(n\mathrm{log}n\right)$ time and comparison sorting remained the norm for sorting real numbers.

However, the situation is recently changed completely as Han found a way to convert real numbers to integers for sorting purpose and he showed that real numbers can be sorted in $O\left(n\sqrt{\mathrm{log}n}\right)$ time [4] . This result enables us to move further to improve the operation bound of parallel algorithms for sorting real numbers to below $O\left(n\mathrm{log}n\right)$, as in the past, all parallel algorithms for sorting real numbers have an operation bound at least $O\left(n\mathrm{log}n\right)$.

In this paper, we will apply the $O\left(n\sqrt{\mathrm{log}n}\right)$ time serial real number sorting algorithm [4] to the design of an NC algorithm with $O\left({\mathrm{log}}^{1+\epsilon}n\right)$ time and

$O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}\mathrm{log}n}}\right)$ operations on the CREW (Concurrent Read Exclusive Write)

PRAM. NC stands for Nick’s Class [12] . NC algorithms are parallel algorithms with polylog time and polynomial operations. Algorithm in [4] is an inherently serial algorithm without much parallelism within it. Here, we use it in the design

of an NC algorithm with $O\left({\mathrm{log}}^{1+\epsilon}n\right)$ time and $O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}\mathrm{log}n}}\right)$ operations. This is the first NC algorithm for sorting real numbers with $o\left(n\mathrm{log}n\right)$ operations.

The computation model used for designing our algorithm is the CREW PRAM. On this model, in one step, any processor can read/write any memory cell. Concurrent read of one memory cell by multiple processors in one step is allowed and concurrent write of one memory cell by multiple processors in one step is prohibited. Parallel algorithms can be measured with their time complexity and the number of processors used. They can also be measured with time complexity and operation complexity which is the time processor product. The operation complexity (T_{p}p, with T_{p} time using p processors) of a parallel algorithm is often compared with the time T_{1} of the best serial algorithm. In general,
${T}_{p}p\ge {T}_{1}$. When
${T}_{p}p={T}_{1}$, the parallel algorithm is said to be an operation optimal algorithm.

The main contribution of this paper is the demonstration of the existence of an NC parallel algorithm with $o\left(n\mathrm{log}n\right)$ operations for sorting real numbers. All previous parallel algorithms for sorting real numbers have at least $O\left(n\mathrm{log}n\right)$ operations. The algorithm presented in this paper is derived from Han’s $O\left(n\sqrt{\mathrm{log}n}\right)$ time serial algorithm [4] for sorting real numbers by applying parallel algorithm design techniques. These parallel algorithm design techniques are specially tuned for the derivation of our parallel algorithm.

The remaining part of this paper is organized as follows. In Section 2 we present our NC algorithm for sorting real numbers with $O\left({\mathrm{log}}^{1+\epsilon}n\right)$ time and

$O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}\mathrm{log}n}}\right)$ operations. In Section 3, we present a running example of our algorithm and conclude our paper with the Main Theorem.

2. The Algorithm

Consider an algorithm for sorting n real numbers. Suppose each of the n/m lists with m real numbers in each list has already been sorted, we are to merge these n/m lists into one sorted list. We will do k-way merge in each pass to merge every k-lists into 1 sorted list and there are $\mathrm{log}\left(n/m\right)/\mathrm{log}k$ passes to have all n/m lists merged into 1 sorted list.

For simplicity, let us break down n elements into lists with m elements in each list. We can do parallel sort on the individual list of m elements recursively. Now we pick every k-lists and have them merged together.

The k-way merging of sorted lists
${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$ is done as follows. For each sorted list of m real numbers we pick every k^{2}-th real number, i.e. we pick the 0th real number, the k^{2}-th real number, the 2k^{2}-th real number, the 3k^{2}-th real number, and so on. Thus from each list L_{i} we picked m/k^{2} real numbers and these m/k^{2} real numbers form a sorted list
${{L}^{\prime}}_{i}$. and from these k lists we picked m/k real numbers they form sorted lists
${{L}^{\prime}}_{0},{{L}^{\prime}}_{\text{1}},\cdots ,{{L}^{\prime}}_{k-\text{1}}$. We merge
${{L}^{\prime}}_{0},{{L}^{\prime}}_{\text{1}},\cdots ,{{L}^{\prime}}_{k-\text{1}}$ into one sorted list L' using Valiant’s merging algorithm [13] (its improved version is given by Kruskal in [14] with time complexity of
$O\left(\mathrm{log}\mathrm{log}m\right)$ and linear operations for merging two sorted lists of m elements each) in logk passes and
$O\left(\mathrm{log}\mathrm{log}m\right)$ time and
$O\left(m/k\right)$ operations in each pass. Thus the total time for merging
${{L}^{\prime}}_{0},{{L}^{\prime}}_{\text{1}},\cdots ,{{L}^{\prime}}_{k-\text{1}}$ is
$O\left(\mathrm{log}k\mathrm{log}\mathrm{log}m\right)$ and the total operation is
$O\left(m\mathrm{log}k/k\right)$.

Now for each real number r in
${{L}^{\prime}}_{i}$ and for any
${{L}^{\prime}}_{j}$, r knows the largest real number s in
${{L}^{\prime}}_{j}$ that is smaller than r and smallest real number l in
${{L}^{\prime}}_{j}$ that is larger than r. s and l are actually neighbors in
${{L}^{\prime}}_{j}$. There are k^{2} elements between s and l in L_{j}. r then uses binary search in
$O\left(\mathrm{log}k\right)$ time to find the largest real number among these k^{2} real numbers that is smaller than r and the smallest real number that is larger than r. That is, r finds the exact insertion point of r in L_{j}. Because there are k-lists and there are m/k real numbers in L' thus the time for this binary search is and the operation is. The operation for all lists is
$O\left(n\mathrm{log}k/k\right)$ because there are n/m lists and every k-lists are merged in the k-way merge, we picked n/k^{2} real numbers and every one of them has to use k processors to check k-lists in the k-way merging. Because r is arbitrary picked and thus we know that every real number in L' knows its insertion point in every L_{j}. Let the real numbers in sorted order in L' be
${r}_{0},{r}_{1},\cdots ,{r}_{m/k-1}$. To merge
${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$ we need now to merge or sort all real numbers between the insertion points of r_{i} and r_{i}_{+1} in
${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$. There are no more than k^{2} real numbers in L_{j} between the insertion points of r_{i} and r_{i}_{+1} and therefore the total number
$R\left(i,i+\text{1}\right)$ of real numbers (call them a block) in
${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$ between the insertion points of r_{i} and r_{i}_{+1} is no more than k^{3} (i.e.
$R\left(i,i+1\right)\le {k}^{3}$ ). When
$R\left(i,i+1\right)<{k}^{3}$ we will combine multiple blocks together to reach k^{3} real numbers. We use the
$O\left(n\sqrt{\mathrm{log}n}\right)$ serial sorting algorithm to sort them in
$O\left({k}^{3}\sqrt{\mathrm{log}k}\right)$ time. This represents
$O\left({k}^{3}\sqrt{\mathrm{log}k}\right)$ time and
$O\left(n\sqrt{\mathrm{log}k}\right)$ operations in our parallel algorithm.

Thus the time for each stage is $O\left({k}^{3}\sqrt{\mathrm{log}k}\right)$ and the operation for each stage is $O\left(n\sqrt{\mathrm{log}k}\right)$. When we start with m as a constant then there are $\mathrm{log}n/\mathrm{log}k$

stages and therefore the time of our algorithm is $O\left(\frac{{k}^{3}\mathrm{log}n}{\sqrt{\mathrm{log}k}}\right)$ and the operation is $O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}k}}\right)$.

Pick $k={\mathrm{log}}^{\epsilon}n$, we get $O\left({\mathrm{log}}^{1+\epsilon}n\right)$ time and $O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}\mathrm{log}n}}\right)$ operations.

3. Procedure

Step 1: Let’s say we have “m” sorted elements in each list, and we have a total of “n” elements to sort (Figure 1).

This implies that we have “n/m” lists to sort. To sort these blocks, we will apply k-way merging.

Step 2: Each stage of k-way merging is to merge every k sorted lists into 1 sorted list. This is repeatedly until all n/m lists are merged into one list (Figure 2).

Step 3: To merge k lists into 1 list, we need to pick the “0-th”, “k^{2}-th”, “2k^{2}-th”, “3k^{2}-th”, … real numbers in each list L_{i} to form a new list
${{L}^{\prime}}_{i}$ of m/k^{2} elements. This is shown as Figure 3.

Step 4: We merge ${{L}^{\prime}}_{0},{{L}^{\prime}}_{\text{1}},\cdots ,{{L}^{\prime}}_{k-\text{1}}$ into one sorted list L'. The elements of this new formed list L' then use binary search to find their exact insertion point in

Figure 1. n/m sorted lists of m elements each.

Figure 2. k-way merging of k lists.

Figure 3. Pick every k^{2}-th element of each list.

${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$. These insertion points then partition
${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$ into m/k blocks with each block containing no more than k^{3} real numbers.

Step 5: When every one of these m/k blocks are sorted, we effectively merged ${L}_{0},{L}_{\text{1}},\cdots ,{L}_{k-\text{1}}$ into one sorted list L.

Main Theorem: n real numbers can be sorted in $O\left({\mathrm{log}}^{1+\epsilon}n\right)$ time and $O\left(\frac{n\mathrm{log}n}{\sqrt{\mathrm{log}\mathrm{log}n}}\right)$ operations on the CREW PRAM.

Proof: The algorithm and its time complexity analysis are presented in Section 2. An example of the running of the algorithm is presented in Section 3. □

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

*O*(nlogn/√loglogn) Operations.

*Open Journal of Applied Sciences*,

**9**, 403-408. doi: 10.4236/ojapps.2019.95034.

[1] | Corman, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2009) Introduction to Algorithms. Third Edition, The MIT Press. |

[2] |
Han, Y. (2015) A Linear Time Algorithm for Ordered Partition. International Workshop on Frontiers in Algorithmics (FAW'15), LNCS, 9130, 89-103.
https://doi.org/10.1007/978-3-319-19647-3_9 |

[3] |
Han, Y. (2004) Deterministic Sorting in O(nloglogn) Time and Linear Space. Journal of Algorithms, 50, 96-105. https://doi.org/10.1016/j.jalgor.2003.09.001 |

[4] | Han, Y. (2017) Sort Real Numbers in Time and Linear Space. In arXiv.org with paper id 1801.00776. |

[5] |
Ajtai, A., Komlós, J. and Szemerédi, E. (1983) An O(nlogn) Sorting Network. Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, MA, 11-13 May 1983, 1-9. https://doi.org/10.1145/800061.808726 |

[6] |
Cole, R. (1988) Parallel Merge Sort. SIAM Journal on Computing, 17, 770-785.
https://doi.org/10.1137/0217049 |

[7] |
Saxena, S., Chandra, P., Bhatt, P. and Prasad, V.C. (1994) On Parallel Prefix Computation. Parallel Processing Letters, 4, 429-436.
https://doi.org/10.1142/S0129626494000399 |

[8] |
Bhatt, P.C.P., Diks, K., Hagerup, T., Prasad, V.C., Radzik, T. and Saxena, S. (1991) Improved Deterministic Parallel Integer Sorting. Information and Computation, 94, 29-47. https://doi.org/10.1016/0890-5401(91)90031-V |

[9] |
Hagerup, T. (1987) Towards Optimal Parallel Bucket Sorting. Information and Computation, 73, 39-51. https://doi.org/10.1016/0890-5401(87)90062-9 |

[10] |
Han, Y. and Shen, X. (1995) Conservative Algorithms for Parallel and Sequential Integer Sorting. International Computing and Combinatorics Conference, Lecture Notes in Computer Science, 959, 324-333. https://doi.org/10.1007/BFb0030847 |

[11] |
Han, Y. and Shen, X. (2002) Parallel Integer Sorting Is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), Baltimore, Maryland, January 1999, 419-428. https://doi.org/10.1137/S0097539799352449 |

[12] | Cook, S.A. (1981) Towards a Complexity Theory of Synchronous Parallel Computation. L’Enseignement Mathématique, 27, 99-124. |

[13] |
Valiant, L.G. (1975) Parallelism in Comparison Problems. SIAM Journal on Computing, 4, 348-355. https://doi.org/10.1137/0204030 |

[14] |
Kruskal, C.P. (1983) Searching, Merging, and Sorting in Parallel Computation. IEEE Transactions on Computers, C-32, 942-946.
https://doi.org/10.1109/TC.1983.1676138 |

Copyright © 2019 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.