CS399 New Beginnings Jonathan Walpole

CS399 New Beginnings Jonathan Walpole

Project 3 • Part 1: The Sleeping Barber problem • - Use semaphores and mutex variables for thread synchronization • - You decide how to test your code!! • We’re not providing the sample output for this one! • Part 2: The Gaming Parlor problem • - Use monitors and condition variables for synchronization • - Avoid deadlock when handling resource requests • - Sample output given in handout

Scheduling

Process State Model New Process Termination Ready Running Blocked

CPU Scheduling Criteria • CPU Utilization • – how busy is the CPU? • Throughput • – how many jobs finished/unit time? • Turnaround Time • – how long from job submission to job termination? • Response Time • – how long does it take to get a response • Missed deadlines

Scheduler Options • Priorities • - May use priorities to determine who runs next • - Dynamic vs. Static algorithms • Dynamically alter the priority of the tasks while they are in the system (possibly with feedback) • Static algorithms typically assign a fixed priority when the job is initially started • Preemptive vs. Nonpreemptive • Preemptive systems allow the task to be interrupted at any time so that the O.S. can take over again

Scheduling Policies • First-Come, First Served (FIFO) • Shortest Job First (non-preemptive) • Shortest Job First (with preemption) • Round-Robin Scheduling • Priority Scheduling • Real-Time Scheduling

First-Come, First-Served (FIFO) • Start jobs in the order they arrive (FIFO queue) • Run each job until completion

First-Come, First-Served (FIFO) Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2

First-Come, First-Served (FIFO) Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2

0 5 10 15 20 First-Come, First-Served (FIFO) Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Arrival Times of the Jobs

0 5 10 15 20 First-Come, First-Served (FIFO) Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2

0 5 10 15 20 First-Come, First-Served (FIFO) Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 2 2 6 1 3 4 4 5 4 6 5 7 5 8 2 10

0 5 10 15 20 First-Come, First-Served (FIFO) Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 3 2 2 6 1 7 3 4 4 5 9 4 6 5 7 12 5 8 2 10 12

Shortest Job First • Select the job with the shortest (expected) running time • Non-Preemptive

0 5 10 15 20 Shortest Job First Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Same Job Mix

0 5 10 15 20 Shortest Job First Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2

0 5 10 15 20 Shortest Job First Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 2 2 6 1 3 4 4 7 4 6 5 9 5 8 2 1

0 5 10 15 20 Shortest Job First Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 3 2 2 6 1 7 3 4 4 7 11 4 6 5 9 14 5 8 2 1 3

0 5 10 15 20 Shortest Remaining Time Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 • Preemptive version of SJF Same Job Mix

0 5 10 15 20 Shortest Remaining Time Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2

CS399 New Beginnings Jonathan Walpole