On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
type: Item
instance of: scholarly article
title: On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
zbMATH Open document ID: 0642.68059
DOI: 10.1016/0304-3975(87)90058-2
author: Ian Parberry
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 4047088
zbMATH Keywords: completely-connected network of random-access machines
zbMATH Keywords: semigroup summation problem
zbMATH Keywords: upper bounds
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90058-2
OpenAlex ID: W2051985991
cites work: Parallelism in random access machines
cites work: Q4198056
cites work: A universal interconnection pattern for parallel computers
cites work: Q3484350
cites work: Q3746885
cites work: Q3746884
cites work: Q3677183
cites work: Q3751010
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Finding the maximum, merging, and sorting in a parallel computation model
Wikidata QID: Q127203541
description: scientific article; zbMATH DE number 4047088