1. Scheduling & File Management
Operating Systems
Scheduling
&
File Management
1) These notes are © Aiman Hanna. All copyrights reserved. For more information please to:
2) These notes are also based on: Operating System Concepts, 9th edition by Silberschatz/Galvin/Gagne, published by Wiley 2013, ISBN: | ISBN BRV: These notes still totally enforce all copyrights for Silberschatz/Galvin/Gagne & J. Wiley . For more information on these rights, please refer to the original publication of the book.
3) VERY IMPORTANT: These notes are neither complete nor sufficient to study for the course. They are merely given so that you can follow the covered subjects. You should NEVER depend solely on these notes for your study.
Any use of these notes that results in violation of any of the copyrights indicated above is strictly prohibited.
© Dr. Aiman Hanna
Department of Computer Science Concordia University Montreal, Canada
Data Communications & Computer Networking, by: Aiman Hanna

2. Preemptive Strategies
SJN
Priority
Deadline
Round Robin (RR)

3. Issues with RR Number of Context Switches
RR with overhead must then be considered
Priority issues with RR; how can priority be implemented?

4. Multiple-level Queues
Needed to achieve priority
However, how can priority be achieved, yet starvation be avoided?
Multiple-level queues with and without feedback

5. File Management Why files, in particular, need an OS manager
File descriptors
Low-level vs. high-level file systems

6. Allocation Strategies for File Blocks
Contiguous strategy
Linked List strategy
Doubly Linked List strategy
Indexed (Index Table) strategy
Advantages and disadvantages of each of these strategies

7. Allocation Strategies for File Blocks
Unix File Structure
Why is it too good?
Examples of this allocation strategy were discussed in class

8. Strategies for Tracking Unallocated Blocks
Linked List
Bit Map

9. Where is this week coverage in the textbook?
Chapter 6:
Sections: 6.3, 6.6 & 6.8
 Permanently Skip: 6.4, 6.5 & 6.7
VERY IMPORTANT|:
1) Definitions of Service time, wait time, and turnaround time MUST be taken from the notes supplied in class (if you missed this class, please ask me for these notes)
2) Examples of the different scheduling schemes, and the calculation the different times, MUST be taken from the notes supplied in class.
3) Much details were provided in class for multiple-level Queues. You must refer to your class notes for these details.

10. Where is this week coverage in the textbook?
Chapter 11:
Sections 11.1, 11.2 & 11.3, (If time allows)
 Permanently Skip: 11.4 & 11.5
Chapter 12:
Sections: 12.1, 12.2, 12.3, 12.4, 12.5, 12.6 & 12.7
 Skip: 12.8 & 12.9