A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks.
Sami TaktakEmmanuelle EncrenazJean Lou DesbarbieuxPublished in: PDP (2010)
Keyphrases
- experimental evaluation
- detection algorithm
- optimal solution
- times faster
- preprocessing
- cost function
- objective function
- convergence rate
- optimization algorithm
- simulated annealing
- computational cost
- worst case
- upper bound
- clustering method
- matching algorithm
- computational complexity
- improved algorithm
- high accuracy
- theoretical analysis
- segmentation algorithm
- dynamic programming
- tree structure
- learning algorithm
- fully connected