A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks-Reference-Cited by-同舟云学术

A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks

Published:2000 Issue: Volume: Page:45-60
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Sancho José Carlos,Robles Antonio,Duato José

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10720115_4

Reference15 articles.

1. Abali, B.: A Deadlock Avoidance Method for Computer Networks. In: Panda, D.K., Stunkel, C.B. (eds.) CANPC 1997. LNCS, vol. 1199. Springer, Heidelberg (1997)

2. Lecture Notes in Computer Science;F.J. Alfaro,2000

3. Arpaci-Duseau, A.C., et al.: High Performance sorting on networks of workstations. In: Proc. of ACM SIGMOD 1997 (1997)

4. Boden, N.J., et al.: Myrinet - A gigabit per second local area network. IEEE Micro 15 (1995)

5. Bollobas, B.: Graph Theory. Springer, New York Inc. (1979)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Performance Evaluation of Parallel Tasks for Fault-tolerant Routing Methods;2023 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan);2023-07-17

2. GANNoC: A Framework for Automatic Generation of NoC Topologies using Generative Adversarial Networks;Proceedings of the 2021 Drone Systems Engineering and Rapid Simulation and Performance Evaluation: Methods and Tools Proceedings;2021-01-18

3. Embedded Networks Design and Simulation;Tools and Technologies for the Development of Cyber-Physical Systems;2020

4. Routing on the Dependency Graph;Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing;2016-05-31

5. An efficient, low-cost routing framework for convex mesh partitions to support virtualization;ACM Transactions on Embedded Computing Systems;2013-06