A survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routing methods are compared in terms of their efficiency in supporting programming models, efficiency in mapping to parallel machines, and practicality. Among the outlined methods, three nonadaptive techniques and some adaptive routing algorithms are discussed.>
No takes yet. Share an insight, caveat, or question.
Felperin et al. (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: