EbDa: A new theory on design and verification of deadlock-free interconnection networks

@article{Ebrahimi2017EbDaAN,
  title={EbDa: A new theory on design and verification of deadlock-free interconnection networks},
  author={Masoumeh Ebrahimi and Masoud Daneshtalab},
  journal={2017 ACM/IEEE 44th Annual International Symposium on Computer Architecture (ISCA)},
  year={2017},
  pages={703-715}
}
Freedom from deadlock is one of the most important issues when designing routing algorithms in on-chip/off-chip networks. Many works have been developed upon Dally's theory proving that a network is deadlock-free if there is no cyclic dependency on the channel dependency graph. However, finding such acyclic graph has been very challenging, which limits Dally's theory to networks with a low number of channels. In this paper, we introduce three theorems that directly lead to routing algorithms… CONTINUE READING
8 Extracted Citations
7 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-8 of 8 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

Similar Papers

Loading similar papers…