Loading presentation...

Present Remotely

Send the link below via email or IM

Copy

Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

DeleteCancel

CPU Scheduling Linux VSwindows XP

No description
by

rawan rasheed

on 12 December 2013

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of CPU Scheduling Linux VSwindows XP

CPU Scheduling Linux VS windows XP
algorithm
Introduction
CPU Scheduling is the process used to maximize the CPU utilization and where the Operating System decides which programs get to use the CPU
windows VS Linux
windows
priority based, preemptive algorithm
Linux
priority based, preemptive algorithm
algorithm
dispatcher
in
priority value
Range of time quantum
relationship between priories and time slice
dispatcher
windows
dispatcher use 32 level of priority divided in two classes variable class ( ranges from 1 to 15)
Linux
Dispatcher uses 141 level priority divided in two classes real time ( ranges from 1 to 99 )
priority value
windows
higher value indicate higher priority dispatcher assign higher priority task shorter time quanta and lower priority tasks longer time quanta
Linux
lower value indicate higher priority dispatcher assign higher priority task longer time quanta and lower priority tasks shorter time quanta
Range of time quantum
windows
10ms_120ms

Linux
10ms_200ms


relationship between priories and time slice
windows
running the process in CPU until higher priority process arrive in ready queue. dispatcher uses a queue for each scheduling priority.
relationship between priories and time slice
Linux
kernel maintain a run queue contain all run able task, each processor maintain its own run queue
Reference table:
[1] Abraham Silberschatz, Greg Gagne, and Peter Baer Galvin, "Operating System Concepts, Eighth Edition ", Chapter 5 , Chapter 21 , Chapter 22 .
Daniel P. Bovet & Marco Cesati ,"Understanding the Linux Kernel" Chapter 10 .
the end
thank you :)
Full transcript