Parallel models of computation: An introductory survey

DOI10.1007/BF02575730MaRDI QIDQ916358zbMATH OpenOpenAlexFDO

Authors Mauro Leoncini

Publication date 1989

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02575730

zbMATH Keywords

structured modelparallel complexitygeneral model

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Parallel computation: Theory and algorithms (review)
• scientific article; zbMATH DE number 3915629
• scientific article; zbMATH DE number 1163092
• scientific article; zbMATH DE number 108376
• Array processing machines: an abstract model

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• A taxonomy of problems with fast parallel algorithms
• Bounding Fan-out in Logical Networks
• Complete problems for deterministic polynomial time
• Fast Parallel Matrix Inversion Algorithms
• Fast parallel matrix and GCD computations
• Log Depth Circuits for Division and Related Problems
• Logarithmic Depth Circuits for Algebraic Functions
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
• On Relating Time and Space to Size and Depth
• On computing the determinant in small parallel time using a small number of processors
• On uniform circuit complexity
• Parallel Prefix Computation
• Parallelism in random access machines
• Relations Among Complexity Measures
• Relations between Concurrent-Write Models of Parallel Computation
• Relationships between nondeterministic and deterministic tape complexities
• Simulation of Parallel Random Access Machines by Circuits
• Simulations among concurrent-write PRAMs
• Space-bounded reducibility among combinatorial problems
• The maximum flow problem is log space complete for P
• Towards a complexity theory of synchronous parallel computation

Cited in

(20)

• scientific article; zbMATH DE number 1432347 (Why is no real title available?)
• A Semantic Model for Many-Core Parallel Computing
• scientific article; zbMATH DE number 3917713 (Why is no real title available?)
• Relations between Concurrent-Write Models of Parallel Computation
• Layered models of parallel computation
• scientific article; zbMATH DE number 3915629 (Why is no real title available?)
• Imperative process algebra and models of parallel computation
• scientific article; zbMATH DE number 578414 (Why is no real title available?)
• scientific article; zbMATH DE number 3866584 (Why is no real title available?)
• scientific article; zbMATH DE number 1728439 (Why is no real title available?)
• Computational models for parallel computers
• Parallel machine models: how they are and where are they going
• scientific article; zbMATH DE number 1110778 (Why is no real title available?)
• Parallel computation: Theory and algorithms (review)
• Array processing machines: an abstract model
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 996551 (Why is no real title available?)
• A comparison of associative computation models
• Preface to the special issue on parallel models
• Relations among parallel and sequential computation models

This page was built for publication: Parallel models of computation: An introductory survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916358)