A bypassing path based routing algorithm for the pyramid structures
From MaRDI portal
Publication:856156
DOI10.1016/J.AMC.2006.02.044zbMATH Open1110.65020OpenAlexW2035861364MaRDI QIDQ856156FDOQ856156
Publication date: 7 December 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.02.044
Recommendations
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diagonal and toroidal mesh networks
- Fault tolerance properties of pyramid networks
- Data Movement Techniques for the Pyramid Computer
- The calculation of average distance in mesh structures.
- The impact of the apex node on routing inside a pyramid structure
Cited In (1)
This page was built for publication: A bypassing path based routing algorithm for the pyramid structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856156)