On the time required to sum n semigroup elements on a parallel machine with simultaneous writes

DOI10.1016/0304-3975(87)90058-2zbMath0642.68059OpenAlexW2051985991WikidataQ127203541 ScholiaQ127203541MaRDI QIDQ1101213

Ian Parberry

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90058-2

zbMATH Keywords

upper boundslower boundscompletely-connected network of random-access machinessemigroup summation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

A computer-assisted optimal depth lower bound for nine-input sorting networks ⋮ A nearly optimal deterministic parallel Voronoi diagram algorithm

Cites Work

• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Finding the maximum, merging, and sorting in a parallel computation model
• A universal interconnection pattern for parallel computers
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the time required to sum n semigroup elements on a parallel machine with simultaneous writes