1

Computer Architecture. Instructor: Prof. Mainak Chaudhuri, Department of Computer Science and Engineering, IIT Kanpur.

FREE
This course includes
Hours of videos

999 years, 10 months

Units & Quizzes

36

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

This course discusses topics in computer architecture: Amdahl's law, CPI equation, instruction set architecture, binary instrumentation for architectural studies: PIN, basic pipelining, branch prediction, dynamic scheduling, virtual memory and caches, DRAM and SRAM technology, input/output, simultaneous multithreading, and so on. (from nptel.ac.in)

Course Currilcum

  • Lecture 01 – Introduction, Amdahl’s Law, CPI Equation Unlimited
  • Lecture 02 – CPI Equation, Research Practices, Instruction Set Architecture Unlimited
  • Lecture 03 – Instruction Set Architecture Unlimited
  • Lecture 04 – Instruction Set Architecture (cont.) Unlimited
  • Lecture 05 – Instruction Set Architecture (cont.), Case Study with MIPS-I Unlimited
  • Lecture 06 – Case Study with MIPS-I (cont.) Unlimited
  • Lecture 07 – Case Study with MIPS-I (cont.) Unlimited
  • Lecture 08 – Binary Instrumentation for Architectural Studies: PIN Unlimited
  • Lecture 09 – Binary Instrumentation for Architectural Studies: PIN (cont.) Unlimited
  • Lecture 10 – Basic Pipelining, Branch Prediction Unlimited
  • Lecture 11 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 12 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 13 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 14 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 15 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 16 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 17 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 18 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 19 – Basic Pipelining, Branch Prediction (cont.) Unlimited
  • Lecture 20 – Dynamic Scheduling, Speculative Execution Unlimited
  • Lecture 21 – Dynamic Scheduling, Speculative Execution (cont.) Unlimited
  • Lecture 22 – Dynamic Scheduling, Speculative Execution (cont.) Unlimited
  • Lecture 23 – Dynamic Scheduling, Speculative Execution (cont.) Unlimited
  • Lecture 24 – Dynamic Scheduling, Speculative Execution (cont.) Unlimited
  • Lecture 25 – Virtual Memory and Caches Unlimited
  • Lecture 26 – Virtual Memory and Caches (cont.) Unlimited
  • Lecture 27 – Virtual Memory and Caches (cont.) Unlimited
  • Lecture 28 – Topics in Memory System, DRAM and SRAM Technology Unlimited
  • Lecture 29 – Topics in Memory System, DRAM and SRAM Technology (cont.) Unlimited
  • Lecture 30 – Topics in Memory System, DRAM and SRAM Technology (cont.) Unlimited
  • Lecture 31 – Case Study: MIPS R10000 Unlimited
  • Lecture 32 – Case Study: MIPS R10000 (cont.) Unlimited
  • Lecture 33 – Case Study: Alpha 21264 Unlimited
  • Lecture 34 – Case Study: Intel Pentium 4 Unlimited
  • Lecture 35 – Input/Output Unlimited
  • Lecture 36 – Simultaneous Multithreading, Multi-cores Unlimited