Nearly logarithmic-time parallel algorithms for the class of 2^ b ASCEND computations on a SIMD hypercube

DOI10.1006/JPDC.1994.1028MaRDI QIDQ1325982zbMATH OpenOpenAlexFDO

Authors David Nassimi

Publication date 15 May 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1028

zbMATH Keywords

parallel algorithmsSIMD hypercube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Parallel Implementation of Lemke's Algorithm on the Hypercube
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• Parallel Algorithms and Subcube Embedding on a Hypercube
• A parallel version of the cyclic reduction algorithm on a hypercube
• Parallel algorithms for modular multi-exponentiation
• Parallel branch and bound on fine-grained hypercube multiprocessors
• Implementing Lanczos-like algorithms on hypercube architectures
• On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
• Paradigms for Fast Parallel Approximability

Cited in

(1)

• Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors

This page was built for publication: Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube

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