Computer Architecture [UG] (ELL305)

The course is to be jointly taught by Prof. Tapan K. Gandhi, Sumantra and Prof. Subrat Kar
This page houses the part to be covered by the second instructor, Sumantra.


General Information

Apart from those who have to take this courses as a Program Core (PC), people are also welcome to sit through the course.

Credits: 3 (LTP: 3-0-0) [Slot E]

Schedule for Classes:

Tuesday
10:00 - 11:00
MS-Teams (online)
Wednesday
10:00 - 11:00
MS-Teams (online)
Friday
10:00 - 11:00
MS-Teams (online)

Schedule for Examination:

Minor-2: 12 Oct (Tue) 05:00pm-06:00pm. Upload deadline on gradescope: 06:30pm.

Teaching Assistants: 


Books, Papers and other Documentation

Basic Texts:

Reference Books:


Lecture Schedule, Links to Material (where applicable)

S.No.
Topics
Lectures
Instructor
References/Notes
1
Introduction:
Basic introduction to memory hierarchy.
01-01
SDR
The von Neumann and Harvard models. Instructions, memory, ALU, CPU, registers. Who addresses and access what. Instructions and data for a CPU. What is a cache, and what is the role of a cache.
10 Sep (Fri) {lecture#SDR-01} 10:00am-11:00am
SDR
MS-Teams folder: video_intro_10sep21.mp4, lecture_notes_intro_10sep21.pdf
2
Caches
Types and Designs, Multiprocessor systems.
01-06
SDR
[HP5, HP6] Cache Basics: Appendix B: Review of Memory Hierarchy. Sections B.1 and B.2 Multiprocessor Cache Coherence: Chapter 5: Thread-Level Parallelism. Sections 5.1 and 5.2
The need for a cache, predictions. The special role of a cache for DSPs: caching data and instructions. Cache and memory blocks, and address spaces. The four basic cache questions. Cache organisation: direct mapped, fully associative and set associative.
14 Sep (Tue) {lecture#SDR-02} 10:00am-11:00am
SDR
MS-Teams folder: video_cache1_14sep21.mp4, lecture_notes_cache1_14sep21.pdf
In detail: the three cache organisations: direct mapped, fully associative and set associative. Cache block replacement: LRU, and alternatives. Cache write strategies: Write-Through and Write-Back. Advantages and disadvantages of each. Write Allocate and No Write Allocate: an introduction.
15 Sep (Wed) {lecture#SDR-03} 10:00am-11:00am
SDR
MS-Teams folder: video_cache2_15sep21.mp4, lecture_notes_cache2_15sep21.pdf
Cache write strategies: Write-Through and Write-Back (contd). Advantages and disadvantages of each. Write Allocate and No Write Allocate: an introduction. An example of Write Allocate and No Write Allocate. Cache operation: a complete (loaded!) numerical example with split and unified caches. This will illustrate basics of cache operations, and practical issues with split and unified caches.
17 Sep (Fri) {lecture#SDR-04} 10:00am-11:00am
SDR

MS-Teams folder: video_cache3_17sep21.mp4, lecture_notes_cache3_17sep21.pdf
Cache operation: a complete (loaded!) numerical example with split and unified caches (contd.). A brief digression to understand the basic concepts of RISC pipelining, which are relevent to this example.
24 Sep (Fri) {lecture#SDR-05} 10:00am-11:00am
SDR


MS-Teams folder: video_cache4_24sep21.mp4, lecture_notes_cache4_24sep21.pdf
Cache operation: a complete (loaded!) numerical example with split and unified caches (contd.).

Introduction to Multiprocessor Cache Coherence. Centralised shared memory architectures. Snooping Protocols: The popular Write Invalidate Protocol.
25 Sep (Sat) {lecture#SDR-06} 08:00am-09:00am
SDR
MS-Teams folder: video_cache5_25sep21.mp4, lecture_notes_cache5_25sep21.pdf
The Write Invalidate Protocol (contd). Issues and basic philosophy. The three possible states of a cache block. The Write Invalidate Protocol, in all its gory details.
28 Sep (Tue) {lecture#SDR-07} 10:00am-11:00am
SDR
MS-Teams folder: video_cache6_28sep21.mp4, lecture_notes_cache6_28sep21.pdf
The Write Invalidate Protocol, in all its gory details (contd).
29 Sep (Wed) {lecture#SDR-08} 10:00am-11:00am
SDR
MS-Teams folder: video_cache7_29sep21.mp4, lecture_notes_cache7_29sep21.pdf
The Write Invalidate Protocol, in all its gory details (contd).
01 Oct (Fri) {lecture#SDR-09} 10:00am-11:00am
SDR
MS-Teams folder: video_cache8_vm1_01oct21.mp4, lecture_notes_cache8_vm1_01oct21.pdf
3
Memory:
Virtual Memory.
10-11
SDR
[HP5, HP6] Virtual Memory: Appendix B: Review of Memory Hierarchy. Section B.4
Introduction to Virtual Memory: Paging and Segmentation
01 Oct (Fri) {lecture#SDR-09} 10:00am-11:00am
SDR
MS-Teams folder: video_cache8_vm1_01oct21.mp4, lecture_notes_cache8_vm1_01oct21.pdf
Paging and Segmentation (contd).
05 Oct (Tue) {lecture#SDR-10} 10:00am-11:00am
SDR
MS-Teams folder: video_vm2_05oct21.mp4, lecture_notes_vm2_05oct21.pdf
Paging and Segmentation (contd).

A little follow-up on RISC pipelining: overcoming hazards through static scheduling, to alleviate cases of data hazards and control hazards.
06 Oct (Wed) {lecture#SDR-11} 10:00am-11:00am
SDR
MS-Teams folder: video_vm3_06oct21.mp4, lecture_notes_vm3_06oct21.pdf
Minor-2
12 Oct (Tue) 05:00pm-06:00pm. Upload deadline on gradescope: 06:30pm.
SDR
[Paper-and-pen exam, as described in the relevant email]
The above list is (obviously!) not exhaustive. Other reference material will be announced in the class. The Web has a vast storehouse of tutorial material on Computer Organisation/Architecture other related areas.




Examinations and Grading Information

The marks distribution is as follows (out of a total of 100):
Minor
33 (SDR)

Attendance Requirements:

Attendance requirements: according to the IITD policy for Online Semesters
Illness policy: illness to be certified by a registered medical practioner.
Attendance in Examinations is Compulsory.


Course Feedback

Link to Course Feedback Form
Tapan K. Gandhi, Sumantra Dutta Roy, Subrat Kar Department of Electrical Engineering, IIT Delhi, Hauz Khas,
New Delhi - 110 016, INDIA. tgandhi@ee.iitd.ac.in, sumantra@ee.iitd.ac.in, subrat@ee.iitd.ac.in