Application-aware deadlock-free oblivious routing
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/53316 |
_version_ | 1811070209805516800 |
---|---|
author | Kinsy, Michel A |
author2 | Srinivas Devadas. |
author_facet | Srinivas Devadas. Kinsy, Michel A |
author_sort | Kinsy, Michel A |
collection | MIT |
description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. |
first_indexed | 2024-09-23T08:32:17Z |
format | Thesis |
id | mit-1721.1/53316 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T08:32:17Z |
publishDate | 2010 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/533162019-04-09T18:24:32Z Application-aware deadlock-free oblivious routing Kinsy, Michel A Srinivas Devadas. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. Cataloged from PDF version of thesis. Includes bibliographical references (p. 67-71). Systems that can be integrated on a single silicon die have become larger and increasingly complex, and wire designs as communication mechanisms for these systems on chip (SoC) have shown to be a limiting factor in their performance. As an approach to remove the limitation of communication and to overcome wire delays, interconnection networks or Network-on-Chip (NoC) architectures have emerged. NoC architectures enable faster data communication between components and are more scalable. In designing NoC systems, there are three key issues; the topology, which directly depends on packaging technology and manufacturing costs, dictates the throughput and latency bounds of the network; the flit control protocol, which establishes how the network resources are allocated to packets exchanged between components; and finally, the routing algorithm, which aims at optimizing network performance for some topology and flow control protocol by selecting appropriate paths for those packets. Since the routing algorithm sits on top of the other layers of design, it is critical that routing is done in a matter that makes good usage of the resources of the network. Two main approaches to routing, oblivious and adaptive, have been followed in creating routing algorithms for these systems. Each approach has its pros and cons; oblivious routing, as opposite to adaptive routing, uses no network state information in determining routes at the cost of lower performance on certain applications, but has been widely used because of its simpler hardware requirements. (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. by Michel A. Kinsy. S.M. 2010-03-25T15:30:25Z 2010-03-25T15:30:25Z 2009 2009 Thesis http://hdl.handle.net/1721.1/53316 550554046 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 71 p. application/pdf Massachusetts Institute of Technology |
spellingShingle | Electrical Engineering and Computer Science. Kinsy, Michel A Application-aware deadlock-free oblivious routing |
title | Application-aware deadlock-free oblivious routing |
title_full | Application-aware deadlock-free oblivious routing |
title_fullStr | Application-aware deadlock-free oblivious routing |
title_full_unstemmed | Application-aware deadlock-free oblivious routing |
title_short | Application-aware deadlock-free oblivious routing |
title_sort | application aware deadlock free oblivious routing |
topic | Electrical Engineering and Computer Science. |
url | http://hdl.handle.net/1721.1/53316 |
work_keys_str_mv | AT kinsymichela applicationawaredeadlockfreeobliviousrouting |