research-article

Parallelism in Comparison Problems

Author:

Leslie G. ValiantAuthors Info & Claims

SIAM Journal on Computing, Volume 4, Issue 3

Pages 348 - 355

https://doi.org/10.1137/0204030

Published: 01 September 1975 Publication History

Abstract

The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated. It is shown that for the problems of finding the maximum, sorting, and merging a pair of sorted lists, if n, the size of the input set, is not less than k, the number of processors, speedups of at least $O(k/\log \log k)$ can be achieved with respect to comparison operations. The algorithm for finding the maximum is shown to be optimal for all values of k and n.

References

[1]

A. V. Aho, N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quart., 11 (1973), 429–437

Google Scholar

[2]

K. E. Batcher, Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conf., Vol. 32, 1968, 307–314

Google Scholar

[3]

Claude Berge, Graphs and hypergraphs, North-Holland Publishing Co., Amsterdam, 1973xiv+528

Google Scholar

[4]

Manuel Blum, Vaughan Pratt, Robert E. Tarjan, Robert W. Floyd, Ronald L. Rivest, Time bounds for selection, J. Comput. System Sci., 7 (1973), 448–461

Digital Library

Google Scholar

[5]

A. B. Borodin, I. Munro, Notes on “Efficient and Optimal Algorithms”, 1972

Google Scholar

[6]

Donald E. Knuth, The art of computer programming. Volume 3, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973xi+722 pp. (1 foldout)

Google Scholar

[7]

P. Turán, On the theory of graphs, Colloquium Math., 3 (1954), 19–30

Crossref

Google Scholar

Cited By

View all

El Ferchichi HLerasle MPerchet VSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Active ranking and matchmaking, with perfect matchingsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692610(13460-13480)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692610
Agarwal ABoyle EChandran NGilboa NGupta DIshai YKelkar MMa YLuo BLiao XXu JKirda ELie D(2024)Secure Sorting and Selection via Function Secret SharingProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690359(3023-3037)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690359
Choo DShiragur KEvans RShpitser I(2023)Adaptivity complexity for causal graph discoveryProceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence10.5555/3625834.3625871(391-402)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.5555/3625834.3625871
Show More Cited By

Index Terms

Parallelism in Comparison Problems

Index terms have been assigned to the content through auto-classification.

Recommendations

A sublinear-time randomized approximation algorithm for matrix games

This paper presents a parallel randomized algorithm which computes a pair of @e-optimal strategies for a given (m,n)-matrix game A = [a"i"j] @e [-1, 1] in O(@e^-^2log^2(n+m)) expected time on an (n+m)/log(n+m)-processor EREW PRAM. For any fixed accuracy ...
Searching, Merging, and Sorting in Parallel Computation

We study the number of comparison steps required for searching, merging, and sorting with P processors. We present a merging algorithm that is optimal up to a constant factor when merging two lists of equal size (independent of the number of processors);...
Work-Time Optimal k-Merge Algorithms on the PRAM

For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 4, Issue 3

Sep 1975

188 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1975.4.issue-3

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 September 1975

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

El Ferchichi HLerasle MPerchet VSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Active ranking and matchmaking, with perfect matchingsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692610(13460-13480)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692610
Agarwal ABoyle EChandran NGilboa NGupta DIshai YKelkar MMa YLuo BLiao XXu JKirda ELie D(2024)Secure Sorting and Selection via Function Secret SharingProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690359(3023-3037)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690359
Choo DShiragur KEvans RShpitser I(2023)Adaptivity complexity for causal graph discoveryProceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence10.5555/3625834.3625871(391-402)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.5555/3625834.3625871
Reif JSen S(2023)Optimal randomized parallel algorithms for computational geometryAlgorithmica10.1007/BF017587537:1-6(91-117)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01758753
Cabannes VBach FPerchet VRudi AKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Active labelingProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601547(17568-17581)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601547
Balkanski ERubinstein ASinger Y(2022)An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity ModelOperations Research10.1287/opre.2021.217070:5(2967-2981)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/opre.2021.2170
Afshar RGoodrich M(2022)Exact Learning of Multitrees and Almost-Trees Using Path QueriesLATIN 2022: Theoretical Informatics10.1007/978-3-031-20624-5_18(293-311)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-20624-5_18
Braverman MMao JWeinberg SWichs DMansour Y(2016)Parallel algorithms for select and partition with noisy comparisonsProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897642(851-862)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897642
Ajtai MFeldman VHassidim ANelson J(2015)Sorting and Selection with Imprecise ComparisonsACM Transactions on Algorithms10.1145/270142712:2(1-19)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2701427
Berman PKarpinski MNekrich Y(2002)Approximating Huffman Codes in ParallelProceedings of the 29th International Colloquium on Automata, Languages and Programming10.5555/646255.684582(845-855)Online publication date: 8-Jul-2002
https://dl.acm.org/doi/10.5555/646255.684582
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

A sublinear-time randomized approximation algorithm for matrix games

Searching, Merging, and Sorting in Parallel Computation

Work-Time Optimal k-Merge Algorithms on the PRAM

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations