### Lower Bounds on Merging NetworksLower Bounds on Merging Networks

Access Restriction
Subscribed

 Author Yao, Andrew Chi-Chih ♦ Yao, Foong Frances Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1976 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Let $\textit{M}(\textit{m,$ n) be the minimum number or comparators needed in an (m, n)-merging network. It is shown that $\textit{M}(\textit{m,$ n) ≥ $\textit{n}(lg(\textit{m}$ + 1))/2, which implies that Batcher's merging networks are optimal up to a factor of 2 + ε for almost all values of $\textit{m}$ and $\textit{n}.$ The limit $\textit{r}m$ = limn→∞ $\textit{M}(\textit{m,$ $n})/\textit{n}$ is determined to within 1. It is also proved that $\textit{M}(2,$ $\textit{n})$ = $[3\textit{n}/2].$ ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1976-07-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 23 Issue Number 3 Page Count 6 Starting Page 566 Ending Page 571

#### Open content in new tab

Source: ACM Digital Library