 |
Lecture 03 [April 05 2011]
Play in Silverlight Play in Flash
This lecture discusses cube networks, designing with node and bisection bandwidth constraints to optimize throughput and latency, and ends with how to slice a node as well as how to do concentration.
|
|
 |
Lecture 04 [April 07 2011]
Play in Silverlight Play in Flash
This lecture discusses high-radix and non-blocking networks. Topologies such as the dragonfly, the flattened butterfly and Clos networks are presented.
|
|
 |
Lecture 05 [April 12 2011]
Play in Silverlight Play in Flash
This lecture introduces the basics of routing, describes important bounds and performance measures, and presents a taxonomy of routing functions. Furthermore, a methodology for finding a network's worst-case...
|
|
|
|
|
|
|
|
 |
Lecture 09 [April 26 2011]
Play in Silverlight Play in Flash
This lecture discusses deadlock and livelock, as well as deadlock avoidance using virtual channels.
|
|
 |
Lecture 10 [April 28 2011]
Play in Silverlight Play in Flash
This lecture introduces the canonical router pipeline, sources of stalls, and various ways of optimizing the pipeline.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|