O( n) numerical algorithms on a mesh with wormhole routing
From MaRDI portal
Publication:1327296
DOI10.1016/0020-0190(94)00029-8zbMATH Open0807.68048OpenAlexW2016002730MaRDI QIDQ1327296FDOQ1327296
Authors: Dongseung Kim, Seung-Hoon Kim
Publication date: 8 March 1995
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00029-8
Recommendations
Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)
Cites Work
Cited In (6)
- Parallel prefix computation on extended multi-mesh network.
- Fast parallel algorithm for prefix computation in multi-mesh architecture
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Title not available (Why is that?)
- Optimal fully adaptive minimal wormhole routing for meshes
- Parallel computation of the multi-exponentiation for cryptosystems
This page was built for publication: \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327296)