On the relative performance merits of hypercube and hypermesh networks
โ Scribed by S. Loucif; M. Ould-Khaoua
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 216 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1383-7621
No coin nor oath required. For personal study only.
โฆ Synopsis
Topology and routing algorithm are among the most important factors that greatly inยฏuence network performance. This paper assesses the interaction of these factors on two related but distinct types of multicomputer networks, the hypercube and hypermesh. This study shows that the routing algorithm can have a great inยฏuence on deciding the outcome of any comparison between competing network topologies. The results reveal that deterministic routing favours the hypermesh due to its smaller diameter which reduces considerably message blocking compared to the hypercube. However, adaptive routing favours the hypercube as it can beneยฎt from its multiple paths to overcome the degrading eects of its high diameter.
๐ SIMILAR VOLUMES
## Abstract The possibility of estimating equilibrium freeโenergy profiles from multiple nonโequilibrium simulations using the fluctuationโdissipation theory or the relation proposed by Jarzynski has attracted much attention. Although the Jarzynski estimator has poor convergence properties for simu
range of computer systems, including general-purpose systems and many real-time systems in which some of the above information is not available. Our focus in this paper is on dynamic scheduling. A dynamic scheduler for a hypercube system can be divided into two components: a job scheduler and a pro