Courses/Computer Science/CPSC 457.S2016/Lecture Notes/L6

From wiki.ucalgary.ca

< Courses‎ | Computer Science‎ | CPSC 457.S2016‎ | Lecture Notes

Revision as of 05:11, 8 June 2016 by Tjkendon (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

Contents

1 Lecture 6 - Process Scheduling

Lecture 6 - Process Scheduling

Concepts

Scheduling Algorithms
Memory Management

Outline

Assignment 2
Scheduling Algorithms
- Round-Robin
- Priority Scheduling
- Multi-Queue Scheduling
- And many more!
- Windows
- Linux
Memory Management
- Memory Hierarchy
- Why we want Memory Abstraction

Slides

My slides are available as PDF PPTX or Handout PDF

Notes

Questions for next time

Retrieved from "http://wiki.ucalgary.ca/index.php?title=Courses/Computer_Science/CPSC_457.S2016/Lecture_Notes/L6&oldid=70886"