Optimizing the Cyclic K-conflict-free Shortest Path Problem in a Network-on-chip - Archive ouverte HAL
Article Dans Une Revue International Journal of Computer & Software Engineering Année : 2017

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

Résumé

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.

Dates et versions

hal-01588051 , version 1 (15-09-2017)

Identifiants

Citer

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, 2017, 2 (1), pp.115.1-115.12. ⟨10.15344/2456-4451/2017/115⟩. ⟨hal-01588051⟩
146 Consultations
0 Téléchargements

Altmetric

Partager

More