Leslie M. Goldschlager
ABSTRACT
A number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception, running time on these models has been shown to be polynomially related to the classical space complexity measure. The general applicability of this relationship is called “the parallel computation thesis” and strong evidence of its truth is given in this paper by introducing the notion of “conglomerates” - a very large class of parallel machines, including all those which could feasibly be built.
Basic parallel machine models are also investigated, in an attempt to pin down the notion of parallel time to within a constant factor. To this end, a universal conglomerate structure is developed with can simulate any other basic model within linear time. This approach also leads to fair estimates of instruction execution times for various parallel models.
- 1.A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley, 1974. Google Scholar
Digital Library
- 2.A.K. Chandra, L.J. Stockmeyer, "Alternation", Proc. 17th FOCS, Oct. 1976 (98-108).Google Scholar
- 3.S.A. Cook, "Linear Time Simulation of Deternlinistic Two-Way Pushdown Automata", Proc. IFIP Congress, Aug. 1971 (75-80).Google Scholar
- 4.M. Flynn, "Very High-Speed Computing Systems", Proc. IEEE, vol.54, Dec. 1966 (1901-1909).Google ScholarCross Ref
- 5.L.M. Goldschlager, "Synchronous Parallel Computation", Tech. Report No.114, Department of Computer Science, University of Toronto, Dec. 1977.Google Scholar
- 6.J. Hartmanis, J. Simon, "On the Power of Multiplication in Random Access Machines", Proc. 15th SWAT, Oct. 1974 (13-23).Google Scholar
- 7.D. Kozen, "On Parallelism in Turing Machines", Proc. 17th FOCS, Oct. 1976 (89-97).Google Scholar
- 8.V.R. Pratt, L.J. Stockmeyer, "A Characterization of the Power of Vector Machines", JCSS, vol.12, No.2, April 1976 (198-221).Google ScholarDigital Library
- 9.W.J. Savitch, M.J. Stimson, "Time Bounded Random Access Machines with Parallel Processing", TR IW 67/76, Mathematisch Centrum, Amsterdam, Nov. 1976.Google Scholar
Index Terms
- A unified approach to models of synchronous parallel machines
Recommendations
Mapping onto three classes of parallel machines: a case study using the cyclic reduction algorithm
IPPS '93: Proceedings of the 1993 Seventh International Parallel Processing SymposiumMapping cyclic reduction, a known approach for the parallel solution of tridiagonal systems of equations, onto the MasPar MP-1, nCUBE 2, and PASM parallel machines is discussed. Each of these represents a different mode of parallelism. Issues addressed ...
Bulk Synchronous Parallel: Practical Experience with a Model for Parallel Computing
PACT '96: Proceedings of the 1996 Conference on Parallel Architectures and Compilation TechniquesValiant proposed the Bulk Synchronous Parallel (BSP) model as a possible model for parallel computing. He refers to BSP as a ``bridging'' model, being applicable to both system and algorithm design. The model allows hardware and software design to ...
Hybrid parallel programming with MPI and unified parallel C
CF '10: Proceedings of the 7th ACM international conference on Computing frontiersThe Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited by the amount of local memory within a compute node. Partitioned Global ...
Comments