Designing Deadlock-Free Turn-Restricted Routing Algorithms for Irregular Wormhole-Routed Networks

摘要

Irregular networks connected by wormhole-routed switches are becoming increas- ingly popular for building networks of workstations for cost-effective parallel processing. A promary strategy to achieve deadlock-free routing in such networks is to first configure The links in a network into some specific directions, and then prohibit the turns that a Message may traverse. A routing algorithm imposes fewer turn prohibitions will have a Higher adaptively and thus a higher performance.