An empirical performance analysis of minimal and non-minimal routing in cube-based OTIS multicomputers

摘要: In this study, the performance of virtual cut-through switching in cube-based OTIS architecture, an optoelectronic interconnection architecture for multicomputer systems, is empirically analyzed. Deadlock-free deterministic and adaptive minimal path routing algorithms are introduced, effects different network traffic parameters on average message latency investigated. This analysis presents a relatively more realistic view than that presented previous work by considering issues related to lower level abstraction (the messages). Among other results, indicates depending pattern, these architectures may cause extreme congestion occur over certain channels network, resulting severe degradation. Alternative non-minimal schemes therefore suggested their compared. One approaches found be able sustain at least half maximum possible bandwidth under all studied patterns. Yet determining single algorithm capable attaining highest throughput patterns remains open problem. A constraint-based effect dimensionality also conducted.