快速小常数周期归并网络
Faster Small-Constant-Periodic Merging Networks
摘要:
我们考虑在一个重复使用的比较器网络上合并两个排序序列的问题,也就是说,如果输出没有排序,则使用输出作为输入再次应用网络。具有挑战性的任务是构建这种小深度的网络(在本文中称为周期)。在我们以前的论文中,题为更快的3-周期合并网络,我们减少了两倍的时间合并的$3$ -周期网络,即从$12\log N$到$6\log N$,相比,第一个结构由Kutykowski,Lorywald和Oesterdikhoff。请注意,在$2$周期网络上进行合并需要线性时间。本文将Canfield和Williamson的$(\log N)$ -周期分类器的构造和分析推广到任意周期的$p \ge 4$。对于$p\ge 4$,我们的$p$ -周期网络在至多$\frac{2p}{p-2}\log N + p\frac{p-8}{p-2}$轮中合并长度为$N/2$的两个排序序列。先前Kutykowski等人给出的界限是$\frac{2.25p}{p-2.42}\log N$。这意味着,例如,与相应的$5.67\log N$和$3.8\log N$之前的边界相比,我们的$4$ -周期性合并网络在时间上以$4\log N$为上限,而我们的$6$ -周期性合并网络在时间上以$3\log N$为上限。我们的构造是规则的,并且遵循相同的周期化模式,而之前使用了一些额外的技术来调整$p \ge 4$的构造。此外,我们的网络也是周期性的排序器和随机排列的测试表明,平均排序时间接近$\log^2 N$。
英文摘要:
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such networks of small depth (called a period in this context). In our previous paper entitled Faster 3-Periodic Merging Network we reduced twice the time of merging on $3$-periodic networks, i.e. from $12\log N$ to $6\log N$, compared to the first construction given by Kutyłowski, Loryś and Oesterdikhoff. Note that merging on $2$-periodic networks require linear time. In this paper we extend our construction, which is based on Canfield and Williamson $(\log N)$-periodic sorter, and the analysis from that paper to any period $p \ge 4$. For $p\ge 4$ our $p$-periodic network merges two sorted sequences of length $N/2$ in at most $\frac{2p}{p-2}\log N + p\frac{p-8}{p-2}$ rounds. The previous bound given by Kutyłowski at al. was $\frac{2.25p}{p-2.42}\log N$. That means, for example, that our $4$-periodic merging networks work in time upper-bounded by $4\log N$ and our $6$-periodic ones in time upper-bounded by $3\log N$ compared to the corresponding $5.67\log N$ and $3.8\log N$ previous bounds. Our construction is regular and follows the same periodification schema, whereas some additional techniques were used previously to tune the construction for $p \ge 4$. Moreover, our networks are also periodic sorters and tests on random permutations show that average sorting time is closed to $\log^2 N$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。