The [course_title] course covers the essential areas of computer architecture. You will learn How does an assembly program end up executing as digital logic and how is a computer designed using logic gates and wires to satisfy specific goals. The power of abstraction, crossing the abstraction layers, Concepts and ISA, ISA Tradeoffs, Multi-Cycle Microarchitectures, Microprogrammed Microarchitectures, Data Dependence Handling will be discussed in the course.
Other topics included Control Dependence Handling, Branch Prediction, Out-of-Order Execution, Dataflow and SIMD, Virtual Memory, etc.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer need to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: Carnegie Mellon University
Course Curriculum
| Lecture 1 – Introduction and Basics – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 2 – Fundamental Concepts and ISA – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 3 – ISA Tradeoffs – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 4 – More ISA Tradeoffs – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 5 – ISA Wrap-Up, Single-Cycle – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 6 -Multi-Cycle Microarchitecture – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 7 – Microprogramming – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:50:00 | ||
| Lecture 8 – Pipelining – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 9 – Data Dependence Handling – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 10 – Control Dependence Handling – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 11 – Branch Prediction – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 02:00:00 | ||
| Lecture 12 – Predication and Exceptions – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 13 -State Maintenance & Recovery – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 02:10:00 | ||
| Lecture 14 – Out-of-Order Execution – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:50:00 | ||
| Lecture 15 – Data Flow and SIMD – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:50:00 | ||
| Lecture 16 – Virtual Memory 1 – Carnegie Mellon – Computer Architecture 2013 – Justin Meza | 01:10:00 | ||
| Lecture 17 – Virtual Memory 2 – Carnegie Mellon – Computer Architecture 2013 – Yoongu Kim | 01:00:00 | ||
| Lecture 18 – Virtual Memory 3 – Carnegie Mellon – Computer Architecture 2013 – Yoongu Kim | 01:15:00 | ||
| Lecture 19 – SIMD and GPUs – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 00:30:00 | ||
| Lecture 20 – GPUs, VLIW, Systolic Arrays – Carnegie Mellon – Computer Architecture 2013 | 01:50:00 | ||
| Lecture 21 Static Instruction Scheduling – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:50:00 | ||
| Lecture 22 – Memory Hierarchy – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 23 – Caches – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 24 – Advanced Caches – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 25 – Main Memory and DRAM Basics – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:35:00 | ||
| Lecture 26 – Memory Controllers & Scheduling – Carnegie Mellon – Computer Architecture 2013 | 01:30:00 | ||
| Lecture 27 – Memory Scheduling – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 28 – Runahead Execution – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 29 – Prefetching – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:40:00 | ||
| Lecture 30A – Advanced Prefetching – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 30B – Multiprocessors – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:50:00 | ||
| Lecture 31 – Consistency & Coherence – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 32 – Interconnects – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 33 – Heterogeneous Multi-Core – Carnegie Mellon – Computer Architecture 2013 – Onur Mutlu | 01:45:00 | ||
| Lecture 34 – Emerging Memory Tech – Carnegie Mellon – Computer Architecture 2013 – Justin Meza | 01:35:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
