computer security and operating system, C/C++ Programming

Assignment Help:
The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that
use the shortest CPU cycle will be selected for running rst. Shortest remaining time
rst algorithm (SRT) is used in real-time process management in operating systems.
Hints:
? You need to assume a list of processes that have di erent length (For the purpose of
demonstration, the length may need to set to very large. You can generate the pro-
cesses either manually or using random functions within your chosen programming
language)
? You need to arrange the processes become ready at di erent times for the SRT
algorithm.
? You need to construct a READY Queue to hold both newly arrived and the sent-
back processes in the case of the SRT algorithm.
You are required to
Task 1) [ 30 % ]
Produce a
owchart for the algorithm
Task 2) [ 30 % ]
Implement the algorithm in a programming language that you are familiar with (e.g.
C or C++).
Task 3) [ 20 % ]
? Run your program with three cases (each having at least ve processes) for the
two algorithms.
? Each case should be run for both algorithms in order for you to make a com-
parison of the average turnaround time.
? Record your input and output for each of the three runs (It would be preferred
to display your results on computer screen.).
1? Inputs should include case speci c information such as the arival time of the
process and the number of CPU cycles the process takes to run to completion.
? The single important output is the average turnaround time for case speci c
inputs (although a repesentation of the order of processes may be useful for
debugging).
Task 4) [ 20 % ]
Write a brief report covering your diagrams, source code, input and output for each
run of your program, and a short conclusion of the algorithm including a comparison
of the average turnaround times for the cases tested for the two algorithms. Also
make comment on preemptive and nonpreemptive algorithms

Related Discussions:- computer security and operating system

Develop diablo 2 lod 1.13d dupe method for closed battle.net, Develop Diabl...

Develop Diablo 2 LOD 1.13d Dupe Method for Closed Battle.net This hack is for diablo 2 lord of destruction The program must work on all realms, all cores, all ladders (4x rea

Explain automatic variables, Automatic Variables Automatic variables ar...

Automatic Variables Automatic variables are variable which are explained within the functions. They lose their value when the function terminates. It can be accessed only in th

Singly linked list, For this program you will add and test 2 new member fun...

For this program you will add and test 2 new member functions to the IntSLList class posted on the website. The two member functions are: insertByPosn(int el, int pos) Assuming t

Coding, A palindrome is a string that reads the same from both the ends. Gi...

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome

How to write a global inline function, How to write a global inline functio...

How to write a global inline function First, let's get away from member functions for a moment and consider a global function.  To make a request that this function be in line:

However shouldn''t i always use a printon() method instead , Q: however sho...

Q: however shouldn't I always use a printOn() method instead of a friend function? A: No. The usual cause people wish to always use a printOn() method instead of  a friend fu

Implementation of the definition class - c++ program, Implementation of the...

Implementation of the Definition class: void Definition::put_word(char *s) {    word = new char[strlen(s)+1];    strcpy(word,s);    nmeanings = 0; }   voi

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd