期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2016
卷号：7
期号：6
页码：290-296
出版社：ARPN Publishers
摘要：We define an integer linear programming model of combinatorial optimization problem that models re¬configurable multi-path routing in a Network-on-Chip with guaranteed traffic. Based on time division mul¬tiplexing, the model allows avoiding collisions, dead¬locks and livelocks in irregular network topologies, while minimizing latency. The model allows dynamic recon¬figurable routing. In that case, independent sets of valid routes are pre-computed in such a way they can be in¬terchanged with no impact on the existing traffic, while reusing all the vacant time-slot resources.
关键词：Multiprocessor routing problem; network on chip; MPSoC; K-shortest paths problem; integer linear programming; modification; guaranteed traffic routing; reconfigurable routing
