Application-aware Deadlock-free Oblivious Routing

Download or read book Application-aware Deadlock-free Oblivious Routing written by Michel A. Kinsy and published by . This book was released on 2009 with total page 71 pages. Available in PDF, EPUB and Kindle. Book excerpt: (Cont.) This thesis examines oblivious routing schemes for NoC architectures. It introduces various non-minimal, oblivious routing algorithms that globally allocate network bandwidth for a given application when estimated bandwidths for data transfers are provided, while ensuring deadlock freedom with no significant additional hardware. The work presents and evaluates these oblivious routing algorithms which attempt to minimize the maximum channel load (MCL) across all network links in an effort to maximize application throughput. Simulation results from popular synthetic benchmarks and concrete applications, such as an H.264 decoder, show that it is possible to achieve better performance than traditional deterministic and oblivious routing schemes.