Article

Free access

Highly parallelizable problems

Authors:

Uzi VishkinAuthors Info & Claims

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

Pages 309 - 319

https://doi.org/10.1145/73007.73036

Published: 01 February 1989 Publication History

PDF eReader

References

[1]

A. Aggarwal, B. Chazelle, L. Guiba~, C. O'Dunlaing and C. Yap, "Parallel computational geometry", Algorithmica, 8 (1988), pp. 203-327.

Google Scholar

[2]

M.J. Atallah and M.T. Goodrich, "Efficient parallel solutions to geometric problems", J. of Parallel and Distributed Comp., 3 (1986), pp. 492-507.

Digital Library

Google Scholar

[3]

N. Alon and B. Schieber, "Optimal preprocessing for answering on-line product queries", TR 71/87, The Moise and Frida Eskena~y Institute of Computer Science, Tel Aviv University (1987).

Google Scholar

[4]

D. Breslauer and Z. Galil, "An optimal O (loglogn) time parallel string matching algorithm", manuscript, 1988.

Google Scholar

[5]

P. Beame and .t. Hastad, "Optimal bounds for decision problems on the CRCW PRAM", Proc. 19th ACM Syrup. on Theory of Computing (1987), pp. 83-93.

Digital Library

Google Scholar

[6]

A. Borodin and J.E. Hopcroft, "Routing, merging, and sorting on parallel models of comparison", J. of ComB. and System Sci., 30 (1985), pp. 130-145.

Digital Library

Google Scholar

[7]

H.A. Burgdorff, S. Lajodia, F.N. Springsteel and Y. Zalcstein, "Alternative methods for the reconstruction of trees from their traversals", BIT, 27 (1987), pp. 134-140.

Digital Library

Google Scholar

[8]

O. Berkman, B. Schieber and U. Vishkin, "Some doubly logarithmic parallel algorithms based on finding all nearest smaller values", UMIACS-TR-88-79, University of Maryland Inst. for Advanced Comp. Studies (1988).

Google Scholar

[9]

I. Bar-On and U. Vishkin, "Optimal parallel generation of a computation tree form", ACM Trans. on Prog. Lang. and Systems, 7 (1985), pp. 348-357.

Digital Library

Google Scholar

[10]

O. Berkman and U. Vishkin, "Fully and almost fully parallel algorithmic techniques'', manuscript, January 1989.

Google Scholar

[11]

S.A. Cook, C. Dwork and R. Rcischuck, "Upper and lower time bounds for parallel random access machines without simultaneous writes", SIAM or. on Computing, 15 (1986), pp. 87-97.

Digital Library

Google Scholar

[12]

R. Cole and U. Vishkin, "Deterministic coin tossing with applications to optimal parallel list ranking", Information and Control, 70 (1986), pp. 32-53.

Digital Library

Google Scholar

[13]

G.H. Chen, M.S. Yu and L.T. Liu, "Two algorithms for constructing a binary tree from its traversals", Information Processing Letters, 28 (1988) 297-299.

Digital Library

Google Scholar

[14]

E. Dekel, and S. Sahni, "Parallel generation of postfix and tree forms", A CM Trans. o7, Prog. Lang. and Sy, tems, 5(1083), pp. 300-317.

Digital Library

Google Scholar

[15]

F.E. Fich, F. Meyer auf der Heide and A. Wigderson, "Lower bounds for parallel random access machines with unbounded shared memory", Advances in Computer Research, 4 (1987), 1-15.

Google Scholar

[16]

F.E. Fich, P. Ragde and A. Wigderson, "Relations between concurrent-write models of parallel computation", SIAM J. on Computing, 17 (1988), pp. 606-627.

Digital Library

Google Scholar

[17]

Z. Galil, "Optimal parallel algorithms for string matching", Information and Controt, 67 (1985), pp. 144-157.

Digital Library

Google Scholar

[18]

M.T. Goodrich, "Triangulating a polygon in parallel", preprint, 1987.

Google Scholar

[19]

M.T. Goodrich, "Finding the convex hull of a sorted point set in parallel", Information Proc. Letters, 26 (1987), pp. 173-179.

Digital Library

Google Scholar

[20]

M.T. Goodrich, "Efficient parallel techniques for computational geometry", Ph.D. thesis, Dept. of Computer Science, Purdue Univ., 1987.

Digital Library

Google Scholar

[21]

H.N. Gabow, J.L. Bentley and R.E. Tarjan, "Scaling and related techniques for geometry problems", Pro~. 16th ACM Syrup. on Theory of Computing (1984), pp. 135-143.

Digital Library

Google Scholar

[22]

R. Haggkvist and P. Hell, "Sorting and merging in rounds", SIAM J. on Alg. and Disc. Methods, 3 (1982), pp. 465-473.

Crossref

Google Scholar

[23]

C.P. Kruskal, "Searching, merging, and sorting in parallel computation", ~EEE Trans. on Computers, C-32 (1983), pp. 942-046.

Digital Library

Google Scholar

[24]

Z.M. Kedem, G.M. Landau and K.V. Palem, "Optimal parallel algorithms for matching problems", TR 410, Dept. of Computer Science, Courant inst., NYU (1988).

Google Scholar

[25]

R.E. Ladner and M.J. Fischer, "Parallel prefix computation", Y. of the ACM 27,4 (1980), 831-838.

Digital Library

Google Scholar

[26]

F. Meyer auf der Heide and A. Wigderson, "The complexity of parallel sorting", Proe. 26th Syrup. on Foundations of Computer Science (1985), pp. 532-540.

Digital Library

Google Scholar

[27]

V.L. Ramachandran and U. Vishkin, "Efficient parallel triconnectivity in logarithmic parallel time" Pro~. A WcC 88, Lecture Notes in Computer Science 319, Springer-Verlag (1988), pp. 33-42t

Digital Library

Google Scholar

[28]

B. Schieber, "Design and analysis of some parallel algorithms", Ph.D. thesis, Dept. of Computer Science, Tel Aviv Univ., 1987.

Google Scholar

[29]

Y. Shiloach and U. Vishkin, "Finding the maximum, merging and sorting in a parallel computation model", J. of Algorithms, 2 (1981), pp. 88-102.

Crossref

Google Scholar

[30]

B. Schieber and U. Vishkin, "Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm", UMIACS-TR-88- 82, University of Maryland Inst. for Advanced Comp. Studies (1988). To appear in Discrete Applied Math.

Digital Library

Google Scholar

[31]

L.G. Valiant, "Parallelism in comparison models", SIAM or. on Computing, 4 (1975), pp. 348-355.

Crossref

Google Scholar

[32]

U. Vishkin "Optimal parallel pattern matching in strings", information and Control, 67 (1985), pp. 91-113.

Digital Library

Google Scholar

[33]

J. Vuillemin, "A unified look at data structures", Comm. of the AC'M 23 (1980), pp. 229-239.

Digital Library

Google Scholar

[34]

A.C. Yao, "Space-time tradeof{ for answering range queries", Proc. ldth ACM Syrup. on Theory of Computing (1982), pp. 128- 136.

Digital Library

Google Scholar

Cited By

View all

Sitchinava NSvenning RAgrawal KPetrank E(2024)The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External MemoryProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659979(259-268)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659979
Yang SCarmi SPe'er I(2016)Rapidly Registering Identity-by-Descent Across Ancestral Recombination GraphsJournal of Computational Biology10.1089/cmb.2016.001623:6(495-507)Online publication date: Jul-2016
https://doi.org/10.1089/cmb.2016.0016
Farach-Colton M(2016)Lowest Common Ancestors in TreesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_630(1169-1174)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_630
Show More Cited By

Index Terms

Highly parallelizable problems

Recommendations

A highly reliable and parallelizable data distribution scheme for data grids

The major drawback of the replication-based RAID (redundant arrays of independent disks) architectures is that, in spite of the high redundancy level, they cannot balance the load increased by the disk failures and this results in reliability and access ...
A block JRS algorithm for highly parallel computation of SVDs
HPCC'07: Proceedings of the Third international conference on High Performance Computing and Communications

This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iteration, which enables the computation of all Jacobi rotations of a sweep ...
Fast multipole singular boundary method for Stokes flow problems

This paper firstly employs the fast multipole method (FMM) to accelerate the singular boundary method (SBM) solution of the Stokes equation. We present a fast multipole singular boundary method (FMSBM) based on the combination of the SBM and the FMM. ...

Comments

Information & Contributors

Information

Published In

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

February 1989

600 pages

ISBN:0897913078

DOI:10.1145/73007

Editor:
D. S. Johnson

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC89

Sponsor:

SIGACT

STOC89: 21st Annual ACM Symposium on the Theory of Computing

May 14 - 17, 1989

Washington, Seattle, USA

Acceptance Rates

STOC '89 Paper Acceptance Rate 56 of 196 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

77
Total Citations
View Citations
776
Total Downloads

Downloads (Last 12 months)96
Downloads (Last 6 weeks)8

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sitchinava NSvenning RAgrawal KPetrank E(2024)The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External MemoryProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659979(259-268)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659979
Yang SCarmi SPe'er I(2016)Rapidly Registering Identity-by-Descent Across Ancestral Recombination GraphsJournal of Computational Biology10.1089/cmb.2016.001623:6(495-507)Online publication date: Jul-2016
https://doi.org/10.1089/cmb.2016.0016
Farach-Colton M(2016)Lowest Common Ancestors in TreesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_630(1169-1174)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_630
Farach-Colton M(2015)Lowest Common Ancestors in TreesEncyclopedia of Algorithms10.1007/978-3-642-27848-8_630-1(1-8)Online publication date: 2-Apr-2015
https://doi.org/10.1007/978-3-642-27848-8_630-1
Yang SCarmi SPe’er I(2015)Rapidly Registering Identity-by-Descent Across Ancestral Recombination GraphsResearch in Computational Molecular Biology10.1007/978-3-319-16706-0_35(340-353)Online publication date: 26-Mar-2015
https://doi.org/10.1007/978-3-319-16706-0_35
Chan TDurocher SLarsen KMorrison JWilkinson B(2014)Linear-Space Data Structures for Range Mode Query in ArraysTheory of Computing Systems10.1007/s00224-013-9455-255:4(719-741)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1007/s00224-013-9455-2
Kashkoush MElMaraghy H(2013)Product Design Retrieval by Matching Bills of MaterialsJournal of Mechanical Design10.1115/1.4025489136:1(011002)Online publication date: 17-Oct-2013
https://doi.org/10.1115/1.4025489
Kashkoush MElMaraghy H(2013)Matching Bills of Materials Using Tree ReconciliationProcedia CIRP10.1016/j.procir.2013.05.0297(169-174)Online publication date: 2013
https://doi.org/10.1016/j.procir.2013.05.029
Dean BMohan R(2013)Building Cartesian trees from free trees with k leavesInformation Processing Letters10.1016/j.ipl.2013.02.014113:9(345-349)Online publication date: May-2013
https://doi.org/10.1016/j.ipl.2013.02.014
Brodal GDavoodi PRao S(2012)On Space Efficient Two Dimensional Range Minimum Data StructuresAlgorithmica10.5555/3118246.311861363:4(815-830)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.5555/3118246.3118613
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A highly reliable and parallelizable data distribution scheme for data grids

A block JRS algorithm for highly parallel computation of SVDs

Fast multipole singular boundary method for Stokes flow problems