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

DOI10.1007/3-540-60609-2_1zbMATH Open1542.68061MaRDI QIDQ6573922

Juraj 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Array processing machines: an abstract model
• The problem of space invariance for sequential machines
• A characterization of the power of vector machines
• Time bounded random access machines
• Computer science today. Recent trends and developments
• Scheduling parallel communication: The h-relation problem
• A model of computation for VLSI with related complexity results
• Fast Simulation of Turing Machines by Random Access Machines
• Locality, Communication, and Interconnect Length in Multicomputers
• Alternation
• A universal interconnection pattern for parallel computers
• Time Bounded Random Access Machines with Parallel Processing
• Improved deterministic PRAM simulation on the mesh
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Weak parallel machines: A new class of physically feasible parallel machine models
• Some Computer Organizations and Their Effectiveness

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