On optimal parallelization of sorting networks
From MaRDI portal
Publication:917287
DOI10.1016/0304-3975(90)90025-DzbMath0704.68039OpenAlexW2015373398MaRDI QIDQ917287
Hsu-Chun Yen, Suraj C. Kothari, Ethan Gannett
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90025-d
program transformationsorting networksBoyer-Moore theorem proveroptimal concurrencyParallelization of sequential program
Searching and sorting (68P10) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Unnamed Item
- Unnamed Item
- An incremental mechanical development of systolic solutions to the algebraic path problem
- The derivation of systolic implementations of programs
- A methodology for programming with concurrency: An informal presentation
- A methodology for programming with concurrency: The formalism
- The automated proof of a trace transformation for a bitonic sort
This page was built for publication: On optimal parallelization of sorting networks
