Lectures of weeks 13-14:
Mon. 04/5 (sec. 6.1) by N. Chrysos;
Wed. 06/5 (sec. 6.2) by N. Chrysos;
Wed. 13/5 (sec. 6.3) by N. Chrysos;
Fri. 15/5 (sec. 6.3) by N. Chrysos.
Lectures of weeks 11-12:
Mon. 20/4 (sec. 5.2.3, 5.2.4) by N. Chrysos;
Wed. 22/4 (sec. 5.2.5, 5.2.6) by N. Chrysos;
Mon. 27/4 (sec. 5.3) by N. Chrysos;
Wed. 29/4 (sec. 5.3.1) by N. Chrysos.
Lectures of week 8:
Mon. 30/3 (sec. intro, 5.1, 5.2.1, 5.2.2) by N. Chrysos and
Midterm Exam on Friday 3 April (no lecture on Wed.).
Lectures of week 7:
Mon. 23/3 (sec. 4.4-5) by M. Katevenis and
Friday 27/3 (sec. 5, 5.1) by N. Chrysos.
Lectures of weeks 5-6:
Mon. 9/3 (sec. 3.5) and Wed. 11/3 (sec. 4.1) by M. Katevenis;
Mon. 16/3 (sec. 4.2) and Friday 20/3 (sec. 4.3) by M. Katevenis.
Lectures of weeks 3-4:
Wed. 25/2 (sec. 2.A) and Fri. 27/2 (sec. 3.1) by M. Katevenis;
Mon. 2/3 (sec. 3.2, 3.3) and Wed. 4/3 (sec. 3.3, 3.4) by M. Katevenis.
Lectures of weeks 1-2:
Mon. 9/2 by A. Psathakis (sec. 2.2), Fri. 13/2 by N. Chrysos (ch.1);
Mon. 16/2 by N. Chrysos (ch.1), Wed. 18/2 by M. Katevenis (sec. 2.1).
Lecture Notes, Transparencies, Exercises:
This Year:
Chapter 1:Basic Concepts and Queueing Architectures
Chapter 2:
Link and Memory Architectures and Technology
2.1
Links, Throughput/Buffering, Multi-Access Overheads
[Slides in PDF]
[Slides Handout in PDF]
[to be done: move "cut-through" from 3.1 to 2.1.
Older text for section 2.1.1:
[Text in HTML]
[Text in PDF] ]
Exercises 2
(due 4 Mar. 2015, week 4.2):
Transmission Rate and Throughput, Turn-Around Overhead
– same exercises as in Spring 2013:
[HTML]
[PDF]
[note - to be fixed:
exercise 2.4 is duplicated as also exercise 4.2]
Exercises 4
(due 16 Mar. 2015, week 6.1):
Switch Generations, Cut-Through
– same exercises as in Spring 2013:
[HTML]
[PDF]
[note - to be fixed: exercise 4.2 is the same as exercise 2.4]
3.3, 3.4
Multiple Queues within a Buffer Memory, Queueing for Multicast Traffic
[Slides in PDF]
[Slides Handout in PDF]
[animated PPT
for queue operations with free-block preallocation]
Exercises 5
(due 20 Mar. 2015, week 6.3):
Linked-List Queue Management
– same exercises as in Spring 2013:
[HTML]
[PDF]
Exercises 8
(due 22 April 2015):
Input Queueing, VOQ Crossbar Scheduling, and their Simulation
[HTML]
[PDF]
[in 2009 and earlier, this exercise concerned a
simulation by hand, rather than in software,
of a CIOQ switch with a speedup of 2:
2009 version (HTML)]
6.3
Buffer Space versus Number of Flows
[Slides - PDF]
[Slides Handout - PDF]: [Updated 16 May 2015.]
[Alternative source, containing a subset of above material,
mostly in a similar form --in a few cases formatted slightly better:
ACACES 2007
(Third International Summer School on
Advanced Computer Architecture and Compilation for Embedded Systems)
- Slides for the course on
"Queue and Flow Control Architectures for Interconnection Switches",
by Manolis Katevenis, Part 4 of 4, in PDF:
[Slides]
[Handouts]
Flow and Congestion Control in Switching Fabrics]
Exercises 11
(due 25 May 2015):
Flow control, per-flow queueing
– same exercises as in Spring 2013:
[HTML]
[PDF]
Chapter 7:
Output Scheduling for Quality-of-Service (QoS) Guarantees