O( n) numerical algorithms on a mesh with wormhole routing
From MaRDI portal
(Redirected from Publication:1327296)
\(O(\log n)\) numerical algorithms on a mesh with wormhole routing
\(O(\log n)\) numerical algorithms on a mesh with wormhole routing
Recommendations
Cites work
Cited in
(6)- Parallel computation of the multi-exponentiation for cryptosystems
- 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
- scientific article; zbMATH DE number 2080867 (Why is no real title available?)
- Optimal fully adaptive minimal wormhole routing for meshes
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)