Site Loader
Rock Street, San Francisco

This report will be about simulations of
CPU scheduling (Algorithm Evaluation). The central processing unit or as it referred
to the CPU is a processor that is responsible for giving instructions to the
computer so it would know what to do. The CPU lets the computer know when it
should follow out certain instructions which as people know is a program. This
program will receive information and will input all of the information from a
device and process all of it so the computer could understand it and output the
information. Most technology nowadays has a CPU built into it the most commonly
known products are mobile phones and computers however many other devices also
have a CPU such as washing machines, DVD players, printers and many more. Most CPUs
are contained on a singular integrated circuit chip they are very small but
very powerful. However you can get multicore processors as well but they are
still a single chip but they contain a few CPUs on it which is classed as
cores. This report will talk about the importance of scheduling and how it’s a fundamental
to operating systems. It will also contain information on how to get a more
accurate evaluation of scheduling algorithms by using simulations. The report
will talk about how to create a simulation, how it will work and how it will process
information. Will show how and why when variables value is increased the
simulator modifies the system state to reflect the activities of the devices,
the process and the scheduler that keeps everything intact and running


Scheduling is very
important to an operating system it is a necessity and fundamental function for
an operating system to be able to run. A queue is created when the CPU is not
in use and the operating system is left to figure out which process it needs to
get ready to execute. So how does the CPU know which process should be carried
out first? Well the CPU works out the order and importance of a process by the
helpful hand of the short term scheduler. The short term scheduler selects
which process should be carried out. The short term scheduler creates a queue
where it lines up all the processes waiting to run on the CPU. When priorities
are acquired the information will be passed onto the dispatcher. A dispatcher is
another fundamental. Dispatchers hand over control to the processes so they can
run on the CPU that is selected by the short term scheduler.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!

order now


The purpose of this
assignment is to simulate algorithms to achieve a more accurate and precise
evaluation on how a choice of certain scheduling algorithms can effect CPU
utilization and how effective schedulers are when they assign processors to any
process. There are a few different scheduling algorithms that run differently
and have different properties from each other some may run better than others
on selected scenarios. As different processes need to run at different times
and different orders so the selection of different algorithms can help select
which one is best for the case.


A system always has a strategy which is called
a Process scheduling Policy what this does is it decides which is going to run
at a given time. So when a system has a choice of which process to execute the
process scheduling policy steps in and decides what should be dealt with first.
However there is also a scheduler and a dispatcher that also have jobs to do. These
two the scheduler and dispatcher assign a processor to the selected process. Every process has its own identity and own address which
consists of three things which is the stack region, data region and the data
region. These three things help identify each process and give it
individuality. The stack region stores all the instruction and local variables that
are used for active procedure calls. The contents of the stack tend to grow as
the process issues are issued and then get smaller when the procedures return.
The data region works by storing all the variables and dynamically allocated
memory that process uses during execution. The text region works by storing all
the codes that processor has to execute.


What is a scheduling algorithm? Well a
scheduling algorithm is a method which gives certain things access to system resources
so threads, processes or data flows can get access to processor time and
communications bandwidth. Scheduling algorithms are used to meet target quality
and to be the most effective. As all CPUs need to be able to multi task there
needs to be some sort arrangement for the CPU to be able to carry out all the
tasks that it needs too. More than one process needs to be executed at a time
so the algorithms help set priorities and keep things running smoothly.




Post Author: admin


I'm Dora!

Would you like to get a custom essay? How about receiving a customized one?

Check it out