A novel approach using a minimum cost maximum flow algorithm for fault-tolerant topology reconfiguration in NoC architectures.
Leibo LiuYu RenChenchen DengShouyi YinShaojun WeiJie HanPublished in: ASP-DAC (2015)
Keyphrases
- maximum flow
- fault tolerant
- np hard
- minimum cost
- fault tolerance
- computational complexity
- minimum cut
- spanning tree
- dynamic programming
- optimal solution
- combinatorial optimization
- distributed systems
- interconnection networks
- graph structure
- undirected graph
- minimal cost
- network flow problem
- network simplex algorithm
- push relabel