MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ †

DOI10.1080/10637199408915411MaRDI QIDQ4819986zbMATH OpenOpenAlexFDO

Authors Clay P. Breshears, Michael A. Langston

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199408915411

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Cites work

• A complexity theory of efficient parallel algorithms
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 194538 (Why is no real title available?)

This page was built for publication: MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ †

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