Show all publications

Optimizing the Cyclic K-Conflict-Free Shortest Path Problem in a Network-on-Chip

Open DOI PageDownload Bibliography in Open DocumentDownload Bibliography in HTMLDownload BibTeXDownload RISDownload Bibliographical Ontology (RDF)
In International Journal of Computer & Software Engineering, vol. 1(2), pp. 115.1-115.12, Graphy Publications, 2017.
DOI: 10.15344/2456-4451/2017/115.
We study a combinatorial optimization problem for conflict-free routing in a Network-on-Chip. Based on time division multiplexing and cyclic emission, the problem consists in finding a set of K shortest paths, such that packets will never conflict through the network but can use shared communication links. in an efficient way.
Routing, NoC, K-shortest-path
Publication Category:
International journal with reading committee
Copyright 2010-2019 © Laboratoire Connaissance et Intelligence Artificielle Distribu√©es - Université Bourgogne Franche-Comté - Privacy policy