data mining and data warehousing, Exams of Data Mining

good subject for learning and enhancing knowledge

Typology: Exams

2017/2018

Uploaded on 04/23/2018

jasmeet
jasmeet 🇮🇳

3

(2)

1 document

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Comparison between Schedules
S.N. Long Term Scheduler Short Term Scheduler Medium Term Scheduler
1 It is a job scheduler It is a CPU scheduler It is a process swapping scheduler.
2 Speed is lesser than short term
scheduler
Speed is fastest among other
two
Speed is in between both short and
long term scheduler.
3 It controls the degree of
multiprogramming
It provides lesser control over
degree of multiprogramming
It reduces the degree of
multiprogramming.
4 It is almost absent or minimal in
time sharing system
It is also minimal in time
sharing system
It is a part of Time sharing systems.
5 It selects processes from pool and
loads them into memory for
execution
It selects those processes
which are ready to execute
It can re-introduce the process into
memory and execution can be
continued.
Operation on process
1. Process creation: A user requests, and already running process can creates new
processes. Parent process creates children processes using a system call, which, in
turn create other processes, forming a tree of processes.
2. Process preempting: A process preempted if I/O event or timeout occurs. Then
process moves from running state to ready state and CPU loads another process
from ready state to running state, if available.
3. Process blocking: When a process needs I/O event during its execution, then
process moves from running state to waiting state and dispatches another process
to CPU.
4. Process termination: A process terminated if when a process completes its
execution. Also, these events: OS, Hardware interrupt, and Software interrupt can
cause termination of a process.
pf2

Partial preview of the text

Download data mining and data warehousing and more Exams Data Mining in PDF only on Docsity!

Comparison between Schedules

S.N. Long Term Scheduler Short Term Scheduler Medium Term Scheduler 1 It is a job scheduler It is a CPU scheduler It is a process swapping scheduler. 2 Speed is lesser than short term scheduler

Speed is fastest among other two

Speed is in between both short and long term scheduler. 3 It controls the degree of multiprogramming

It provides lesser control over degree of multiprogramming

It reduces the degree of multiprogramming. 4 It is almost absent or minimal in time sharing system

It is also minimal in time sharing system

It is a part of Time sharing systems.

5 It selects processes from pool and loads them into memory for execution

It selects those processes which are ready to execute

It can re-introduce the process into memory and execution can be continued.

Operation on process

  1. Process creation: A user requests, and already running process can creates new processes. Parent process creates children processes using a system call, which, in turn create other processes, forming a tree of processes.
  2. Process preempting: A process preempted if I/O event or timeout occurs. Then process moves from running state to ready state and CPU loads another process from ready state to running state, if available.
  3. Process blocking: When a process needs I/O event during its execution, then process moves from running state to waiting state and dispatches another process to CPU.
  4. Process termination: A process terminated if when a process completes its execution. Also, these events: OS, Hardware interrupt, and Software interrupt can cause termination of a process.

Scheduling Criteria

There are many different criterias to check when considering the "best" scheduling algorithm :

  • CPU utilization

To make out the best use of CPU and not to waste any CPU cycle, CPU would be working most of the time(Ideally 100% of the time). Considering a real system, CPU usage should range from 40% (lightly loaded) to 90% (heavily loaded.)

  • Throughput

It is the total number of processes completed per unit time or rather say total amount of work done in a unit of time. This may range from 10/second to 1/hour depending on the specific processes.

  • (^) Turnaround time

It is the amount of time taken to execute a particular process, i.e. The interval from time of submission of the process to the time of completion of the process(Wall clock time).

  • Waiting time

The sum of the periods spent waiting in the ready queue amount of time a process has been waiting in the ready queue to acquire get control on the CPU.

  • Load average

It is the average number of processes residing in the ready queue waiting for their turn to get into the CPU.

  • Response time

Amount of time it takes from when a request was submitted until the first response is produced. Remember, it is the time till the first response and not the completion of process execution(final response).

In general CPU utilization and Throughput are maximized and other factors are reduced for proper optimization.