Large parallel machines can be extremely slow for small problems
type: Item
instance of: scholarly article
title: Large parallel machines can be extremely slow for small problems
zbMATH Open document ID: 0729.68019
DOI: 10.1007/BF01759055
author: Vince Grolmusz
published in: Algorithmica
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 4205975
zbMATH Keywords: parallel computation
zbMATH Keywords: lower bounds
zbMATH Keywords: fault tolerant computation
MaRDI profile type: Publication
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Simulations among concurrent-write PRAMs
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: A universal interconnection pattern for parallel computers
cites work: Incomparability in parallel computation
cites work: Parallel computation and conflicts in memory access
cites work: The Complexity of Parallel Sorting
cites work: The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
cites work: Simulation of Parallel Random Access Machines by Circuits
description: scientific article; zbMATH DE number 4205975