Abstract
We demonstrate that parallel machines are always faster than sequential machines for a wide range of machine models, including tree Turing machine (TM), multidimensional TM, log-cost random access machine (RAM), and unit-cost RAM. More precisely, we show that every sequential machine M (in the above list) that runs in time T can be sped up by a parallel version M′ of M that runs in time o(T). All previous speedup results either rely on the severe limitation on the storage structure of M (e.g., M is a TM with linear tapes) or require that M′ has a more versatile storage structure than M (e.g., M′ is a parallel RAM (PRAM), and M is a TM with linear tapes). It is unclear whether it is the parallelism, or the restriction on the storage structures, or the combination of both that realizes such speedup. We remove all the above restrictions on storage structures in previous results. We present speedup theorems where both M and M′ use the same kind of storage medium, which is not linear tapes. Thus, we prove conclusively that parallelism alone suffices to achieve the speedup.
Supported by the National Science Foundation under Grant CCR-8922008.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Englewood Cliffs, New Jersey, 1989.
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. Assoc. Comput. Mach., 28:114–133, 1981.
A. K. Chandra and L. J. Stockmeyer. Alternation. In Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science, pages 98–108, 1976.
S. A. Cook and R. A. Reckhow. Time bounded random access machines. J. Comput. System Sci., 7:354–375, 1973.
P. W. Dymond and M. Tompa. Speedups of deterministic machines by synchronous parallel machines. J. Comput. System Sci., 30:149–161, 1985.
S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. 10th Ann. ACM Symp. on Theory of Computing, pages 114–118, 1978.
L. M. Goldschlager. A universal interconnection pattern for parallel computers. J. Assoc. Comput. Mach., 29:1073–1086, 1982.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 17, pages 869–941. MIT Press, Cambridge, Massachusetts, 1990.
J. Katajainen, J. van Leeuwen, and M. Penttonen. Fast simulation of Turing machines by random access machines. SIAM J. Comput., 17:77–88, 1988.
I. Parberry. Parallel speedup of sequential machines: a defense of the parallel computation thesis. ACM SIGACT News, 18:54–67, 1986.
I. Parberry and G. Schnitger. Parallel computation with threshold functions. J. Comput. System Sci., 36:278–302, 1988.
W. Paul and R. Reischuk. On alternation II. Acta Inform., 14:391–403, 1980.
W. Paul and R. Reischuk. On time versus space II. J. Comput. System Sci., 22:312–327, 1981.
J. H. Reif. On synchronous parallel computations with independent probabilistic choice. SIAM J. Comput., 13:46–56, 1984.
K. R. Reischuk. A fast implementation of a multidimensional storage into a tree storage. Theoret. Comput. Sci., 19:253–266, 1982.
W. J. Savitch. Parallel random access machines with powerful instruction sets. Math. Systems Theory, 15:191–210, 1982.
W. J. Savitch and M. J. Stimson. Time bounded random access machines with parallel processing. J. Assoc. Comput. Mach., 26:103–118, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mak, L. (1994). Are parallel machines always faster than sequential machines?. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_137
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive