Analytic performance comparison of hypercubes and star graphs with implementation constraints
From MaRDI portal
Publication:941452
DOI10.1016/j.jcss.2007.07.004zbMath1154.68345OpenAlexW2000867204MaRDI QIDQ941452
A. E. Kiasari, Hamid Sarbazi-Azad
Publication date: 1 September 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.07.004
hypercubeperformance evaluationinterconnection networksstar graphanalytical modelingmulticomputersimplementation constraints
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- A parallel algorithm for Lagrange interpolation on the star graph
- Embedding meshes on the star graph
- A group-theoretic model for symmetric interconnection networks
- Hypercube communication delay with wormhole routing
- An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks
This page was built for publication: Analytic performance comparison of hypercubes and star graphs with implementation constraints