The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ACM Computing Surveys (CSUR)
Parallel algorithms for minimum cuts and maximum flows in planar networks
Journal of the ACM (JACM)
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Asynchronous Analysis of Parallel Dynamic Programming Algorithms
IEEE Transactions on Parallel and Distributed Systems
An efficient parallel algorithm for the general planar monotone circuit value problem4
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Journal of the ACM (JACM)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Speedups of deterministic machines by synchronous parallel machines
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algorithms and theory of computation handbook
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.00 |
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.