Optimizing the Cyclic K-conflict-free Shortest Path Problem in a Network-on-chip

Boureima Zerbo 1 Marc Sevaux 1 André Rossi 2 Jean-Charles Créput 3
1 Lab-STICC_UBS_CID_DECIDE
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : 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. The model allows to avoid collisions and deadlocks in irregular network topologies, while minimizing latency. A time-expanded graph approach is retained for the solution process. First, we present a mixed integer linear programming model for the problem. Second, a set of shortest paths operators are combined within three iterated local search schemes able to quickly generate admissible solutions for the problem. To evaluate the method, experiments are conducted on a set of five real-life problem instances, and on many artificial unstructured random instances derived from them. We detail the problem of traffic instance generation, that also illustrates the designer’s task of flow decomposition between communicating components. Intensive simulations illustrate the accuracy of the solution method.
Type de document :
Article dans une revue
International Journal of Computer & Software Engineering, Graphy Publications, 2017, 2 (1), pp.115.1-115.12. 〈10.15344/2456-4451/2017/115〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01588051
Contributeur : Marc Sevaux <>
Soumis le : vendredi 15 septembre 2017 - 08:36:43
Dernière modification le : mercredi 21 février 2018 - 15:48:03

Identifiants

Citation

Boureima Zerbo, Marc Sevaux, André Rossi, Jean-Charles Créput. Optimizing the Cyclic K-conflict-free Shortest Path Problem in a Network-on-chip. International Journal of Computer & Software Engineering, Graphy Publications, 2017, 2 (1), pp.115.1-115.12. 〈10.15344/2456-4451/2017/115〉. 〈hal-01588051〉

Partager

Métriques

Consultations de la notice

172