Parallel machine models: how they are and where are they going

DOI10.1007/3-540-60609-2_1MaRDI QIDQ6573922zbMATH OpenFDO

Authors Jiří Wiedermann

Publication date 17 July 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• Parallel models of computation: An introductory survey
• scientific article; zbMATH DE number 4068238
• scientific article; zbMATH DE number 800569
• scientific article; zbMATH DE number 996551
• Array processing machines: an abstract model

Cites work

• scientific article; zbMATH DE number 4130026 (Why is no real title available?)
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)
• scientific article; zbMATH DE number 17800 (Why is no real title available?)
• scientific article; zbMATH DE number 177809 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 641702 (Why is no real title available?)
• scientific article; zbMATH DE number 745300 (Why is no real title available?)
• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• scientific article; zbMATH DE number 872005 (Why is no real title available?)
• A characterization of the power of vector machines
• A model of computation for VLSI with related complexity results
• A universal interconnection pattern for parallel computers
• Alternation
• Array processing machines: an abstract model
• Computer science today. Recent trends and developments
• Fast Simulation of Turing Machines by Random Access Machines
• Improved deterministic PRAM simulation on the mesh
• Locality, Communication, and Interconnect Length in Multicomputers
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Scheduling parallel communication: The \(h\)-relation problem
• Some Computer Organizations and Their Effectiveness
• The problem of space invariance for sequential machines
• Time Bounded Random Access Machines with Parallel Processing
• Time bounded random access machines
• Weak parallel machines: a new class of physically feasible parallel machine models

This page was built for publication: Parallel machine models: how they are and where are they going

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