共 50 条
- [31] Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing The Journal of Supercomputing, 2005, 31 : 63 - 78
- [32] Effective methodology for deadlock-free minimal routing in InfiniBand networks 2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 409 - 418
- [34] German methodologies for deadlock-free routing 10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 638 - 643
- [35] Transitively Deadlock-Free Routing Algorithms 2016 2ND IEEE INTERNATIONAL WORKSHOP ON HIGH-PERFORMANCE INTERCONNECTION NETWORKS IN THE EXASCALE AND BIG-DATA ERA (HIPINEB), 2016, : 16 - 24
- [38] Configuring Methods for Deadlock-Free Routing INTERNATIONAL JOURNAL OF EMBEDDED AND REAL-TIME COMMUNICATION SYSTEMS (IJERTCS), 2022, 13 (01):
- [39] Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks Journal of Automated Reasoning, 2012, 48 : 419 - 439
- [40] Proof pearl: A formal proof of dally and seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks Schmaltz, J. (julien@cs.ru.nl), 1600, Kluwer Academic Publishers (48):