Abstract
We propose a model of parallel computation, the Y-PRAM, that allows general parallel algorithms to be designed for a wide class of the parallel models. There are two basic quantities captured by the model, which the algorithm designer must leave open as parameters: latency and bandwidth.
We design Y-PRAM algorithms for solving several fundamental problems: parallel prefix, sorting, sorting numbers from a bounded range, and list ranking. We show that our model predicts, reasonably accurately, the actual known performances of several basic parallel models — PRAM, hypercube, mesh, and tree — when solving these problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, A. Chandra, and M. Snir. Communication complexity of prams. Technical Report RC 14998(64644), IBM Tech. Report, 1989.
A. Aggarwal, A. Chandra, and M. Snir. On communication latency of prams. Technical Report RC 14973(66882), IBM Tech. Report, 1989.
R. J. Anderson and G. L. Miller. Deterministic parallel list ranking. In Proc. 3rd AWOC,pages 81–90, 1988.
R. Cole. Parallel merge sort. In Proc. 27th Annual IEEE Symp. on Foundations of Computer Science, pages 511–516, 1986.
R. Cole and U. Vishkin. Approximate parallel scheduling, part i: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comput, 17: 128–142, 1988.
R. Cypher. Efficient communication in massively parallel computers. PhD thesis, University of Washington, 1989. Department of Computer Scienceeig.
R. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. In Proc. 15th Annual ACM Symp. on Theory of Computing, pages 193–203, 1990.
A. M. Gibbons and Y.N. Srikant. A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation. Information Processing Letters, 32: 305–311, 1989.
A. Gottlieb and C. P. Kruskal. Complexity results for permuting data and other computations on parallel processors. JA CM, 31: 193–209, 1984.
Y. Han. Parallel algorithms for computing linked list prefix. J. of Parallel and Distributed Computing, 6: 537–357, 1989.
R. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, 1988. Ed. J. van Leeuwen, North Holland, to appear.
C. P. Kruskal, T. Madej, and L. Rudolph. Parallel prefix on fully connected direct connection machine. In Proc. International Conference on Parallel Processing, pages 278–283, 1986.
C. P. Kruskal, L. Rudolph, and M. Snir. The power of parallel prefix. IEEE Transactions on Computers, pages 965–968, 1985.
C. P. Kruskal, L. Rudolph, and M. Snir. Efficient parallel algorithms for graph problems. In Proceedings International Conference on Parallel Processing, pages 869–876, 1986.
C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. In Proc. 15th Annual ICALP. Springer Verlag Lecture Notes in Computer Science, Vol. 317, pp. 333–346, July 1988. (Theoretical Computer Science, to appear 1989 ).
D. J. Kuck, E. S. Davidson, D. H. Lawrie, and A. H. Sameh. Parallel supercomputing today and the cedar approach. Science, 231: 967–974, 1986.
F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34: 344–354, 1985.
L. Meertens. Recurrent ultracomputers are not log n-fast. Technical Report 2, New York University, 1979. Ultracomputer.
K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of prams by parallel machines with restricted granularity of parallel of parallel memories. Acta Informatica, 21: 339–374, 1984.
F. P. Preparata and J. E. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. CACM, 24: 300–309, 1981.
T. Leighton B. Maggs S. Rao. Universal packet routing algorithms. In Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, pages 256–271, 1988.
J. H. Reif. An optimal parallel algorithm for integer sorting. In Proc. 26th Annual Symp. on Foundations of Computer Science, pages 496–504, 1985.
R. J. Swan, S. H. Fuller, and D. P. Siewiorek. Cm* — a modular, multi-processor. In Proc. AFIPS Conf., volume 46, pages 637–644, 1977.
L. G. Valiant. General purpose parallel architectures. In A handbook of Theoretical Computer Science. MIT Press, 1990. J. van Leeuwen (ed.).
R. A. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In Proc. International Conference on Parallel Processing, pages 924–930, 1986.
J. C. Wyllie. The complexity of parallel computation. PhD thesis, Cornell University, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Torre, P., Kruskal, C.P. (1991). Towards a Single Model of Efficient Computation in Real Parallel Machines. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-25209-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-23206-4
Online ISBN: 978-3-662-25209-3
eBook Packages: Springer Book Archive